Planarity-preserving clustering and embedding for large planar graphs

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

Research output: Contribution to journalArticle

7 Scopus citations

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(logn) 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(nlogn), where n is the number of vertices of graph G.

Original languageEnglish (US)
Pages (from-to)95-114
Number of pages20
JournalComputational Geometry: Theory and Applications
Volume24
Issue number2
DOIs
StatePublished - Feb 1 2003

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

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

  • Cite this