Proportional contact representations of planar graphs

Authors:
Muhammad Jawaherul Alam;Therese Biedl;Stefan Felsner;Michael Kaufmann;Stephen G. Kobourov
Affiliations:
Department of Computer Science, University of Arizona, Tucson, AZ;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada;Institut für Mathematik, Technische Universität Berlin, Berlin, Germany;Wilhelm-Schickhard-Institut für Informatik, Universität Tübingen, Tübingen, Germany;Department of Computer Science, University of Arizona, Tucson, AZ
Venue:
GD'11 Proceedings of the 19th international conference on Graph Drawing
Year:
2011

Citing 11
Cited 3

On grid intersection graphs

Discrete Mathematics
Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM Journal on Computing
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Contact graphs of line segments are NP-complete

Discrete Mathematics
RecMap: Rectangular Map Approximations

INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
On rectangular cartograms

Computational Geometry: Theory and Applications
Rectangular layouts and contact graphs

ACM Transactions on Algorithms (TALG)
On touching triangle graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
Triangle contact representations and duality

GD'10 Proceedings of the 18th international conference on Graph drawing
Contact representations of planar graphs with cubes

Proceedings of the twenty-seventh annual symposium on Computational geometry
Optimal polygonal representation of planar graphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Computing cartograms with optimal complexity

Proceedings of the twenty-eighth annual symposium on Computational geometry
Planar graphs as VPG-Graphs

GD'12 Proceedings of the 20th international conference on Graph Drawing
Proportional contact representations of 4-connected planar graphs

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study contact representations for planar graphs, with vertices represented 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. Several natural optimization goals for such representations include minimizing the complexity of the polygons, the cartographic error, and the unused area. We describe constructive algorithms for proportional contact representations with optimal complexity for general planar graphs and planar 2-segment graphs, which include maximal outerplanar graphs and partial 2-trees.