Visualisation of Large and Complex Networks Using PolyPlane

  • Seok-Hee Hong
  • Tom Murtagh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)

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.

References

  1. 1.
    Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation Algorithms for Bin Packing: A Survey, Approximation Algorithms for NP-Hard Problems. In: Hochbaum, D. (ed.). pp. 46–93. PWS Publishing, Boston (1997)Google Scholar
  2. 2.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1998)Google Scholar
  3. 3.
    Eades, P.: Drawing Free Trees. Bulleting of the Institute of Combinatorics and its Applications, 10-36 (1992)Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness, Freeman (1979)Google Scholar
  5. 5.
    Herman, I., Melançon, G., Marshall, M.G.: Graph Visualization in Information Visualization: a Survey. IEEE Transactions on Visualization and Computer Graphics 6, 24–44 (2000)CrossRefGoogle Scholar
  6. 6.
    Hong, S., Eades, P.: Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2) (2003)Google Scholar
  7. 7.
    Johnson, B., Shneiderman, B.: Tree-maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures. In: Proc. of IEEE Visualization 1991, pp. 284–291. IEEE, Piscataway (1991)CrossRefGoogle Scholar
  8. 8.
    Lamping, J., Rao, R., Piroli, P.: A Focus + Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies. In: Proc. of ACM CHI 1995 Conference: Human Factors in Computing Systems, pp. 401–408. ACM, New York (1995)CrossRefGoogle Scholar
  9. 9.
    Munzner, T.: H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space. In: Proc. of the 1997 IEEE Symposium on Information Visualization, pp. 2–10 (1997)Google Scholar
  10. 10.
    Murtagh, T., Hong, S.: 3DTreeDraw: A Three Dimensional Tree Drawing System. In: Proc. of SoCG, pp. 380–382 (2003)Google Scholar
  11. 11.
    Nguyen, Q.V., Huang, M.: A Space-Optimized Tree Visualization. In: Proc. of IEEE Symposium on Information Visualization (InfoVis 2002), pp. 85–92 (2002)Google Scholar
  12. 12.
    Reingold, E., Tilford, J.: Tidier Drawing of Trees. IEEE Transactions on Software Engineering 7, 223–228 (1981)CrossRefGoogle Scholar
  13. 13.
    Roberston, G., Mackinlay, J., Card, S.: Cone Trees: Animated 3D Visualizations of Hierarchical Information. In: Proc. of SIGCHI 1991, pp. 189–194 (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Seok-Hee Hong
    • 1
  • Tom Murtagh
    • 2
  1. 1.National ICT Australia; School of Information TechnologiesUniversity of SydneyAustralia
  2. 2.School of Information TechnologiesUniversity of SydneyAustralia

Personalised recommendations