A fast polygon triangulation algorithm based on uniform plane subdivision
- 30 April 2003
- journal article
- conference paper
- Published by Elsevier BV in Computers & Graphics
- Vol. 27 (2), 239-253
- https://doi.org/10.1016/s0097-8493(02)00281-9
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Randomized Algorithm for Triangulating a Simple Polygon in Linear TimeDiscrete & Computational Geometry, 2001
- A Contribution to Triangulation Algorithms for Simple PolygonsJournal of Computing and Information Technology, 2000
- A universal trapezoidation algorithm for planar polygonsComputers & Graphics, 1999
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJournal of Algorithms, 1995
- Slicing an ear using prune-and-searchPattern Recognition Letters, 1993
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygonsComputational Geometry, 1991
- The Graham scan triangulates simple polygonsPattern Recognition Letters, 1990
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977
- Polygons Have EarsThe American Mathematical Monthly, 1975