Folding a triangulated simple polygon: Structural and algorithmic results
We describe a linear-time algorithm that folds a triangulated simple polygon into a single triangle. Using this technique, we derive a particularly simple proof of Chvàtal's art gallery theorem and improve or simplify a number of algorithms that deal with triangulated simple polygons. We describe two improved algorithms, both based on the degree sequence of the boundary vertices of the given triangulated simple polygon. The first is a linear-time algorithm that, using only the parity of the degree of each vertex, colors the vertices of a triangulated simple polygon using three colors. The second algorithm reconstructs the polygon and its triangulation from the degree sequence. We then show that our results extend to k-trees.
Unable to display preview. Download preview PDF.
- E. Hare, S. Hedetniemi, R. Laskar, K. Peters, and T. Wimer, “Linear-time computability of combinatorial problems on generalized series-parallel graphs,” in Discrete Algorithms and Complexity, D.S. Johnson, T. Nishizeki, A. Nozaki, and H.S. Wilf, eds., Academic Press, New York (1986), 437–457.Google Scholar