Algorithms for Drawing Graphs: An Annotated Bibliography
Algorithms for Drawing Graphs: An Annotated Bibliography
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Finding interesting rules from large sets of discovered association rules
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Generation of transfer functions with stochastic search techniques
Proceedings of the 7th conference on Visualization '96
Supporting the restructuring of data abstractions through manipulation of a program visualization
ACM Transactions on Software Engineering and Methodology (TOSEM)
Interactive Orthogonal Graph Drawing
IEEE Transactions on Computers
Linked-List Visualization for Debugging
IEEE Software
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems
IEEE Transactions on Software Engineering
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing Large Graphs with H3Viewer and Site Manager
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A graphical user interface for editing formal specification objects
Journal of Computing Sciences in Colleges
A system for graph-based visualization of the evolution of software
Proceedings of the 2003 ACM symposium on Software visualization
Volume upper bounds for 3D graph drawing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Animated Exploration of Dynamic Graphs with Radial Layout
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
User-oriented visual layout at multiple granularities
AVI '96 Proceedings of the workshop on Advanced visual interfaces
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Challenges in graph-based relational data visualization
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Multiple foci visualisation of large hierarchies with FlexTree
Information Visualization
Methodology and architecture of JIVE
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Visualization of Barrier Tree Sequences
IEEE Transactions on Visualization and Computer Graphics
Difference map readability for dynamic graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
A survey of multiple tree visualisation
Information Visualization
The "Map" in the mental map: Experimental results in dynamic graph drawing
International Journal of Human-Computer Studies
| Hi-index | 0.01 |
A tree-drawing algorithm that addresses the weaknesses of current approaches to constructing graphical user interfaces is presented. Present algorithms either do not let you draw tree nodes of varying shapes and sizes or they draw such trees in a way that does not produce trees as compact as they could be, which is especially important when diagramming a large system. Also, they cannot reuse layout information when the trees changes, so after every change the layout must be recomputed and the tree redrawn. The main difference between these traditional approaches and the author's approach is that his algorithm is more geometric. Unlike other algorithms, it uses an explicit representation of node and subtree contours, and it stores every contour as a polygon. It has three advantages over traditional algorithms. It allows one to draw trees with nodes of any polygonal shape compactly. The data structure supports insert and delete operations on subtrees. It is simple to implement, yet flexible.