Visualisation of Large and Complex Networks Using PolyPlane

Hong, Seok-Hee and Murtagh, Tom (2004) Visualisation of Large and Complex Networks Using PolyPlane. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 471-481 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_49).

Full text not available from this repository.

Abstract

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. This research has been supported by a SESQUI grant from the University of Sydney, a research grant from the School of Information Technologies, Special Study Leave Program of the University of Sydney, and NICTA Summer Vacation Scholarship. Animated drawings are available from http://www.cs.usyd.edu.au/~shhong/3dtreedraw.htm. National ICT Australia is funded by the Australian Governmentrsquos Backing Australiarsquos Ability initiative, in part through the Australian Research Council.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_49
Classifications:P Styles > P.720 Straight-line
P Styles > P.060 3D
ID Code:619

Repository Staff Only: item control page

References

E. G. Goffman, M. R. Garey and D. S. Johnson, Approximation Algorithms for Bin Packing: A Survey, Approximation Algorithms for NP-Hard Problems, D. Hochbaum (editor), PWS Publishing, Boston, pp. 46-93. 1997.

G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1998.

P. Eades, Drawing Free Trees, Bulleting of the Institute of Combinatorics and its Applications, pp. 10-36, 1992.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness, Freeman, 1979.

I. Herman, G. Melancon G, M. Marshall, Graph Visualization in Information Visualization: a Survey, IEEE Transactions on Visualization and Computer Graphics, 6, pp. 24-44, 2000.

S. Hong and P. Eades, Drawing Trees Symmetrically in Three Dimensions, Algorithmica, vol. 36, no. 2, 2003.

B. Johnson and B. Shneiderman, Tree-maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures, Proc. of IEEE Visualization'91, IEEE, Piscataway, NJ, pp. 284-291, 1991.

J. Lamping, R. Rao and P. Piroli, A Focus + Context Technique Based on Hyperbolic Geometry for Visualization Large Hierarchies, Proc. of ACM CHI'95 Conference: Human Factors in Computing Systems, ACM, New York, NY, pp. 401-408, 1995.

T. Munzner, H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space, Proc. of the 1997 IEEE Symposium on Information Visualization, pp. 2-10, 1997.

T. Murtagh and S. Hong, 3DTreeDraw: A Three Dimensional Tree Drawing system, Proc. of SoCG, pp. 380-382, 2003.

Q. V. Nguyen and M. Huang, A Space-Optimized Tree Visualization, Proc. of IEEE Symposium on Information Visualization (InfoVis2002), pp. 85-92, 2002.

E. Reingold and J. Tilford, Tidier Drawing of Trees, IEEE Transactions on Software Engineering, 7, pp 223-228, 1981.

G. Roberston, J. Mackinlay and S. Card, Cone Trees: Animated 3D Visualizations of Hierarchical Information, Proc. of SIGCHI'91, pp. 189-194, 1991.