In this paper, we present a Θ(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane. Up to now, only an O(n log n) worst-case deterministic and an O(n) expected time bound have been shown, leaving an O(n) deterministic solution open to conjecture.
CITATION STYLE
Wang, C. A., & Chin, F. (1995). Finding the constrained delaunay triangulation and constrained voronoi diagram of a simple polygon in linear-time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 979, pp. 280–294). Springer Verlag. https://doi.org/10.1007/3-540-60313-1_150
Mendeley helps you to discover research relevant for your work.