Paper Info
Title
A Planar Straight-line Grid Drawing Algorithm for High Degree General Trees with User-Specified Angular Coefficient
Abstract
General trees are usually displayed as planar straight-line grid drawings which provide an easily understandable structure to the viewer. Current general tree drawing algorithms have one common problem: their drawings on high degree trees produce many small angles, which makes it difficult to distinguish edges. The algorithm we propose in this paper allows the user to provide an angular coefficient and then employs the 'best-effort-delivery' to draw edges such that the angles are above the angular coefficient. It allows the non-root nodes to place their children within a maximum of three quads of the Cartesian plane. When a node has too many children, resulting in an impossibility of achieving angles above the specified angular coefficient, our algorithm distributes all remaining children evenly among the three quads.
Year
DOI
Venue
2008
10.1109/IV.2008.26
IV
Keywords
Field
DocType
general tree,high degree tree,Planar Straight-line Grid Drawing,Cartesian plane,angular coefficient,High Degree General Trees,non-root node,common problem,User-Specified Angular Coefficient,planar straight-line grid drawing,remaining child,current general tree,specified angular coefficient
Line (geometry),Visualization,Computational geometry,Algorithm,Binary tree,Planar,Mesh generation,Grid,Mathematics,Cartesian coordinate system
Conference
ISSN
Citations 
PageRank 
1550-6037
1
0.40
References 
Authors
2
3
Name
Order
Citations
PageRank
Chu Yao110.40
Adrian Rusu28210.65
Andrew Crowell310.74