Abstract
An edge of a simple closed polygon is called eliminating if it can be translated in parallel towards the interior of the polygon to eliminate itself or one of its neighbor edges without violating simplicity.
In this paper we prove that in each simple closed polygon there exist at least two eliminating edges; this lower bound is tight since for all n ≥ 5 there exists a polygon with only two eliminating edges. Furthermore we present an algorithm that computes in total O(n log n) time using O(n) space an eliminating edge for each elimination step. We thus obtain the first non-trivial algorithm that computes for P a sequence of n − 3 edge translations reducing P to a triangle.
Preview
Unable to display preview. Download preview PDF.
References
F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345–405, 1991.
Francis Chin, Jack Snoeyink, and Cao-An Wang. Finding the medial axis of a simple polygon in linear time. In Proc. 6th Annu. Internat. Sympos. Algorithms Comput. (ISAAC 95), volume 1004 of Lecture Notes in Computer Science, pages 382–391. Springer-Verlag, 1995.
L. Guibas and J. Hershberger. Morphing simple polygons. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 267–276, 1994.
Atsuyuki Okabe, Barry Boots, and Kokichki Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, England, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, T., Veezhinathan, K. (1998). Reducing simple polygons to triangles - A proof for an improved conjecture -. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055047
Download citation
DOI: https://doi.org/10.1007/BFb0055047
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive