vix.ing · top · new · best · stats · spec

On recent advances in 2D Constrained Delaunay triangulation algorithms

2017/07/19 by Gaur, Pranav Kant, Surojit Kumar Bose, Bose, S. K.
Computer Science · Engineering · Social Sciences · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Geographic Information Systems Studies #Robotics and Sensor-Based Localization

paper · pdf · doi:10.48550/arxiv.1707.05949

openalex publication_date 2017/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this article, recent works on 2D Constrained Delaunay triangulation(CDT) algorithms have been reported. Since the review of CDT algorithms presented by de Floriani(Issues on Machine Vision, Springer Vienna, pg. 95--104, 1989), different algorithms for construction and applications of CDT have appeared in literature each concerned with different aspects of computation and different suitabilities. Therefore, objective of this work is to report an update over that review article considering contemporary prominent algorithms and generalizations for the problem of two dimensional Constrained Delaunay triangulation.

Related