Minimum Rectilinear Polygons for Given Angle Sequences
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.
KeywordsVertical Edge Full Version Simple Polygon Horizontal Edge Minimum Height
- 4.Culberson, J.C., Rawlins, G.J.E.: Turtlegons: generating simple polygons from sequences of angles. In: Proceedings of 1st Annual ACM Symposium on Computational Geometry (SoCG 1985), pp. 305–310 (1985)Google Scholar
- 6.Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.S., Wolff, A.: Minimum rectilinear polygons for given angle sequences. Arxiv report (2016). https://arxiv.org/abs/1606.06940
- 10.Sack, J.R.: Rectilinear computational geometry. Ph.D. thesis, School of Computer Science, McGill University (1984). http://digitool.library.mcgill.ca/R/?func=dbin-jump-full&object_id=71872&local_base=GEN01-MCG02