Cone Trees: animated 3D visualizations of hierarchical information
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Area-efficient upward tree drawings
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Algorithm animation using 3D interactive graphics
UIST '93 Proceedings of the 6th annual ACM symposium on User interface software and technology
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Strictly-upward drawings of ordered search trees
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Linear area upward drawings of AVL trees
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A note on parallel algorithms for optimal h-v drawings of binary trees
Computational Geometry: Theory and Applications
On the approximability of two tree drawing conventions
Information Processing Letters
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computing Proximity Drawings of Trees in the 3-Dimemsional Space
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Universal 3-Dimensional Visibility Representations for Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
The Strength of Weak Proximity
GD '95 Proceedings of the Symposium on Graph Drawing
Proximity Drawings of Outerplanar Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume
GD '96 Proceedings of the Symposium on Graph Drawing
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D
GD '96 Proceedings of the Symposium on Graph Drawing
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings
GD '96 Proceedings of the Symposium on Graph Drawing
3DCube: A Tool for Three Dimensional Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Recognizing Rectangle of Influence Drawable Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Three-Dimensional Graph Drawing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Proximity Drawability: a Survey
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Proximity Constraints and Representable Trees
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Area Requirement of Gabriel Drawings
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially with the size of the graph. This holds even when we restrict ourselves to binary trees. Our method is quite general and yields the first algorithms to construct (a) polynomial area weak Gabriel drawings of ternary trees, (b) polynomial area weak β-proximity drawing of binary trees for any 0 ≤ β