Title: Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Abstract: 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.