On recent advances in 2D Constrained Delaunay triangulation algorithms

TL;DR

This paper reviews recent advances in 2D Constrained Delaunay triangulation algorithms, highlighting new algorithms and generalizations developed since the 1989 review, to update the state of the art in this computational geometry area.

Contribution

It provides an updated overview of contemporary algorithms and generalizations for 2D Constrained Delaunay triangulation since the last comprehensive review.

Findings

Summarizes recent algorithmic developments in CDT

Highlights new generalizations and applications of CDT

Provides a comparative overview of contemporary methods

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.