Planarity-Preserving Clustering and Embedding for Large Planar Graphs

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.

• Type: Conference
• Year: 1999
• Where: GD
• Authors: Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
• Keywords: Arbitrary Planar Graphs, Computer Graphics, GD 1999, Large Planar Graphs, Planar Graphs