An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- 1 February 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (1), 143-178
- https://doi.org/10.1137/0217010
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Fast triangulation of simple polygonsLecture Notes in Computer Science, 1983
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A new data structure for representing sorted listsActa Informatica, 1982
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- Triangulating a simple polygonInformation Processing Letters, 1978