Planarity-preserving clustering and embedding for large planar graphs?

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 7th International Symposium, GD 1999, Proceedings
EditorsJan Kratochvil
Number of pages11
ISBN (Print)3540669043, 9783540669043
StatePublished - 1999
Event7th International Symposium on Graph Drawing, GD 1999 - Prague, Czech Republic
Duration: Sep 15 1999Sep 19 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other7th International Symposium on Graph Drawing, GD 1999
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Planarity-preserving clustering and embedding for large planar graphs?'. Together they form a unique fingerprint.

Cite this