Cone Trees: animated 3D visualizations of hierarchical information
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A focus+context technique based on hyperbolic geometry for visualizing large hierarchies
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
3DTreeDraw: a three dimensional tree drawing system
Proceedings of the nineteenth annual symposium on Computational geometry
H3: laying out large directed graphs in 3D hyperbolic space
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
A Space-Optimized Tree Visualization
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Tree-Maps: a space-filling approach to the visualization of hierarchical information structures
VIS '91 Proceedings of the 2nd conference on Visualization '91
IEEE Transactions on Software Engineering
MultiPlane: a new framework for drawing graphs in three dimensions
GD'05 Proceedings of the 13th international conference on Graph Drawing
PhylloTrees: phyllotactic patterns for tree layout
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large and complex network. The algorithm uses the concept of subplanes, where a set of subtrees is laid out. The subplanes are defined using regular polytopes for easy navigation. The algorithm can be implemented to run in linear time. We implemented the algorithm and the experimental results show that it produces nice layouts of large trees with up to ten thousand nodes. We further discuss how to extend this method for more general case.