Proportional contact representations of planar graphs

Md Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We study contact representations for planar graphs, with vertices rep- resented by simple polygons and adjacencies represented by point-contacts or side-contacts between the corresponding polygons. Specifically, we consider proportional contact representations, where pre-specified vertex weights must be represented by the areas of the corresponding polygons. Natural optimization goals for such representations include minimizing the complexity of the polygons, and the unused area. We describe al- gorithms for proportional contact representations with optimal polygonal complexity for general planar graphs and planar 2-segment graphs, which include maximal outer-planar graphs and partial 2-trees.

Original languageEnglish (US)
Pages (from-to)701-728
Number of pages28
JournalJournal of Graph Algorithms and Applications
Issue number3
StatePublished - 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Proportional contact representations of planar graphs'. Together they form a unique fingerprint.

Cite this