Triangulating a simple polygon in linear time
- First Online:
- 678 Downloads
We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic strategy is to build a coarse approximation of a triangulation in a bottom-up phase and then use the information computed along the way to refine the triangulation in a top-down phase. The main tools used are the polygon-cutting theorem, which provides us with a balancing scheme, and the planar separator theorem, whose role is essential in the discovery of new diagonals. Only elementary data structures are required by the algorithm. In particular, no dynamic search trees, of our algorithm.
Unable to display preview. Download preview PDF.
- 1.A. Aggarwal and J. Wein, Computational Geometry, Technical Report MIT/LCS/RSS 3, MIT, Cambridge, MA, August 1988.Google Scholar
- 2.B. G. Baumgart, A polyhedron representation for computer vision,Proc. 1975 National Comput. Conf., AFIPS Conference Proceedings, Vol. 44, AFIPS Press, Montvale, NJ (1975), pp. 589–596.Google Scholar
- 3.H. Booth, Some fast Algorithms on Graph and Trees, Ph.D. Thesis, Technical Report CS-TR 296-60, Princeton University, Princeton, NJ, 1990.Google Scholar
- 4.B. Chazelle, A theorem on polygon cutting with applications,Proc. 23rd Ann. IEEE Symp. on Found. of Comput. Sci. (1982), pp. 339–349.Google Scholar
- 10.H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms,Proc. 4th Ann. ACM Symp. Comput. Geom. (1988), pp. 118–133.Google Scholar
- 20.D. G. Kirkpatrick, M. M. Klawe, and R. E. Tarjan,O(n log logn) polygon triangulation with simple data structures,Proc. 6th Ann. ACM Symp. Comput. Geom. (1990), pp. 34–43.Google Scholar
- 25.R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Manuscript, 1990.Google Scholar
- 29.G. Toussaint, An Output-Complexity-Sensitive Polygon Triangulation Algorithm, Report SICS 86.3, McGill University, Montreal, 1988.Google Scholar
- 31.C. K. Yap, A geometric consistency theorem for a symbolic perturbation scheme,Proc. 4th Ann. ACM Symp. Comput. Geom. (1988), pp. 134–142.Google Scholar