Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Algoritmi za risanje grafov na osnovi sil
Authors:
ID
Božović, Dragana
(
Author
)
ID
Taranenko, Andrej
(
Mentor
)
More about this mentor...
Files:
MAG_Bozovic_Dragana_2015.pdf
(879,65 KB)
MD5: 20CF936AA23C98A013CDE39FC3F1DD9D
Language:
Slovenian
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Tema magistrskega dela je risanje grafov z algoritmi na osnovi sil. V delu predstavimo različne algoritme za risanje grafov na osnovi sil: Tuttovo baricentrično metodo, algoritem Kamada-Kawai, algoritem Fruchtermana in Reingolda, Eadesov algoritem in algoritme za velike grafe. Magistrsko delo je razdeljeno v tri dele. V prvem delu so navedeni osnovni pojmi in definicije. Drugi del se začne s kratkim zgodovinskim pregledom algoritmov za risanje grafov na osnovi sil. Nato so opisani glavni algoritmi in zapisane tudi njihove psevdokode. Zaključimo s kratkim opisom implementacije Tuttove baricentrične metode in algoritma Fruchtermana in Reingolda ter prikažemo rezultate oz. več primerov izrisa grafov s pomočjo teh dveh programov.
Keywords:
algoritmi
,
algoritmi na osnovi sil
,
grafi
,
risanje grafov
Place of publishing:
Maribor
Publisher:
[D. Božović]
Year of publishing:
2015
PID:
20.500.12556/DKUM-53850
UDC:
004.421.2:519.17(043.2)
COBISS.SI-ID:
21560072
NUK URN:
URN:SI:UM:DK:P35YKWTR
Publication date in DKUM:
13.10.2015
Views:
5536
Downloads:
380
Metadata:
Categories:
FNM
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
Force-based graph drawing algorithms
Abstract:
This thesis focuses on force-directed algorithms for graph drawing. In the work we present different force-directed drawing algorithms: the Tutte's barycentric method, the algorithm of Kamada and Kawai, the algorithm of Fruchterman and Reingold, the spring layout method of Eades and some algorithms for large graphs. This master thesis is divided into three parts. In the first part we describe basic concepts and definitions. The second part starts with a short historical overview of force-directed drawing algorithms. Following is a description of main algorithms where pseudocodes of these are also shown. We conclude the thesis with a brief description of how we implemented the Tutte's barycentric method and Fruchterman-Reingold algorithm and show the results, i.e. several different layouts of graphs obtained with them.
Keywords:
algorithms
,
force-directed algorithms
,
graphs
,
graph drawing
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
