DocumentCode
3453308
Title
Graph Drawing by Force-Directed Method in Mirror Frames
Author
Lee, Jing ; Pei, Ching-Hsing
Author_Institution
Dept. of Electron. Eng., Southern Taiwan Univ., Yung-Kang, Taiwan
fYear
2010
fDate
27-28 Nov. 2010
Firstpage
1
Lastpage
4
Abstract
The most widely used algorithms for graph drawing are force-directed algorithms. We should modify a hybrid force model that is coupling a traditional spring force model and a novel repulsive force model will be proposed to solve the graph drawing problems in 2-D space. Especially, regular triangle drawing frame can be applied to binary tree drawing problems that on an important contribution to computer science. And apply circle drawing frame to normal graph drawing problems, we get satisfactory and aesthetic criteria graphics.
Keywords
computer graphics; directed graphs; trees (mathematics); aesthetic criteria graphics; binary tree; computer science; force-directed method; graph drawing; mirror frames; novel repulsive force model; traditional spring force model; Binary trees; Computational modeling; Force; Image edge detection; Mirrors; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Database Technology and Applications (DBTA), 2010 2nd International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-6975-8
Electronic_ISBN
978-1-4244-6977-2
Type
conf
DOI
10.1109/DBTA.2010.5659031
Filename
5659031
Link To Document