Veröffentlichung

Titel:

Minimum Rectilinear Polygons for Given Angle Sequences

AutorInnen:

William S. Evans
Krzysztof Fleszar
Philipp Kindermann
Noushin Saeedi
Chan-Su Shin
Alexander Wolff

Kategorie:

Konferenzbandbeiträge

erschienen in:

Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG^2 2015), pp. 105-119

Abstract:

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns plus 4. It is known that any such sequence can be realized by a rectilinear polygon. In this paper, we consider the problem of finding realizations that minimize the perimeter or the area of the polygon or the area of the bounding box of the polygon. We show that all three problems are NP-hard in general. Then we consider the special cases of x-monotone and xy-monotone rectilinear polygons. For these, we can optimize the three objectives efficiently.

Download:

Springer

BibTeX-Eintrag:

@InProceedings{efkssw-mrpga-jcdcgg15, Title = {Minimum Rectilinear Polygons for Given Angle Sequences}, Author = {William S. Evans and Krzysztof Fleszar and Philipp Kindermann and Noushin Saeedi and Chan-Su Shin and Alexander Wolff}, Booktitle = {Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG'15)}, Year = {2016}, Pages = {105--119}, Publisher = {Springer-Verlag}, Series = {Lecture Notes in Computer Science}, Volume = {9943}, Abstract = {A \emph{rectilinear} polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns plus 4. It is known that any such sequence can be realized by a rectilinear polygon. In this paper, we consider the problem of finding realizations that minimize the perimeter or the area of the polygon or the area of the bounding box of the polygon. We show that all three problems are NP-hard in general. Then we consider the special cases of $x$-monotone and $xy$-monotone rectilinear polygons. For these, we can optimize the three objectives efficiently.}, Doi = {10.1007/978-3-319-48532-4_10} }