We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, able to efficiently maintain a consistent triangulated representation of dynamic polygonal domains. Several applications in the fields of data visualization, reconstruction, geographic information systems and collision-free path planning are discussed.
CITATION STYLE
Kallmann, M., Bieri, H., & Thalmann, D. (2004). Fully Dynamic Constrained Delaunay Triangulations (pp. 241–257). https://doi.org/10.1007/978-3-662-07443-5_15
Mendeley helps you to discover research relevant for your work.