An optimal mesh computer algorithm for constrained Delaunay triangulation

We present an optimal parallel algorithm that runs in O(√n) time on a √n×√n mesh to compute the constrained Delaunay triangulation of a planar straight line graph G whose vertices lie in an n-element set S. Implications of our result also include an efficient PRAM algorithm for the same problem, a new optimal mesh algorithm to compute a planar Voronoi diagram, as well as a partial solution to the problem of the geodesic Voronoi diagram of a point set inside a simple polygon