Skip to main content
Article thumbnail
Location of Repository

Optimal Polygonal Representation of Planar Graphs

By Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann and Stephen G. Kobourov

Abstract

In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also show that the lower bound of six sides is matched by an upper bound of six sides with a linear-time algorithm for representing any planar graph by touching hexagons. Moreover, our algorithm produces convex polygons with edges having at most three slopes and with all vertices lying on an O(n)xO(n) grid.Comment: 26 pages, 14 figures. A preliminary version appeared in LATIN 2010, Oaxaca, Mexic

Topics: Computer Science - Computational Geometry, Mathematics - Combinatorics
Year: 2011
OAI identifier: oai:arXiv.org:1104.1482
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.1482 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.