Triangulating a simple polygon in linear time
- 1 September 1991
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 6 (3) , 485-524
- https://doi.org/10.1007/bf02574703
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygonsComputational Geometry, 1991
- Decomposition and intersection of simple splinegonsAlgorithmica, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978