Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...