• DOI:10.1007/bf01553881
Corpus ID: 189918468

Constrained delaunay triangulations

@article{Chew1989ConstrainedDT,
  title={Constrained delaunay triangulations},
  author={L. Paul Chew},
  journal={Algorithmica},
  year={1989},
  volume={4},
  pages={97-108}
}

L. Paul Chew

Published 1989

Algorithmica

Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation. We show that the CDT can be built in optimalO(n logn) time using a divide-and-conquer technique. This matches the time required to build an arbitrary (unconstrained… CONTINUE READING

View on Springer

Save to Library

Create Alert

Cite

Launch Research Feed