Skip to search formSkip to main contentSkip to account menu

Constrained Delaunay triangulation

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are… 
2008
2008
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc… 
2006
2006
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are in P, let CDT(P, S) be the… 
2004
2004
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage… 
1999
1999
We describe a Delaunay triangulation-based algorithm to search for the nearest line or polygonal boundary to an arbitrary point… 
1995
1995
  • R. Klein
  • 1995
  • Corpus ID: 2647905
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay… 
1993
1993
TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the… 
1993
1993
A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the… 
1991
1991
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in…