Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
D. Avis and G. T. Toussaint, “An efficient algorithm for decomposing a polygon into star-shaped pieces," Pattern Recognition 13 (1981), 395–398.
T. Beyer, W. Jones, and S. Mitchell, “Linear algorithms for isomorphism of maximal outerplanar graphs," J. ACM 26 (1979), 603–610.
V. Chvàtal, “A combinatorial theorem in plane geometry,” J. Combin. Theory Series B 18 (1975), 39–41.
J. Fisk, “A short proof of Chvàtal's watchman theorem,” J. Combin. Theory Series A 24 (1978), 374.
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.
D.J. Rose, “On simple characterizations of k-trees,” Discrete Mathematics 7 (1974), 317–322.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kooshesh, A.A., Moret, B.M.E. (1991). Folding a triangulated simple polygon: Structural and algorithmic results. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_158
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_158
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive