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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics