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 , 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
URI: http://gdea.informatik.uni-koeln.de/id/eprint/619

Actions (login required)

View Item View Item