Planarity-Preserving Clustering and Embedding for Large Planar Graphs

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 186-196(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_19).

Full text not available from this repository.

Abstract

In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(log n) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(n log n), where n is the number of vertices of graph G.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_19
Classifications: G Algorithms and Complexity > G.490 Embeddings
P Styles > P.180 Cluster
M Methods > M.600 Planar
G Algorithms and Complexity > G.350 Clusters
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/327

Actions (login required)

View Item View Item