Visualisation of large and complex networks using PolyPlane

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Hong, S. H., & Murtagh, T. (2004). Visualisation of large and complex networks using PolyPlane. In Lecture Notes in Computer Science (Vol. 3383, pp. 471–481). https://doi.org/10.1007/978-3-540-31843-9_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free