Constrained delaunay triangulations

  title={Constrained delaunay triangulations},
  author={L. Paul Chew},
  • 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
    300 Citations
    Gliders2d: Source Code Base for RoboCup 2D Soccer Simulation League
    • 4
    • Highly Influenced
    • PDF
    A computational model of topological and geometric recovery for visual curve completion
    • 3
    • Highly Influenced
    • PDF
    TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
    • Hang Si
    • Computer Science
    • ACM Trans. Math. Softw.
    • 2015
    • 774
    • Highly Influenced
    Study and Development of Hierarchical Path Finding to Speed Up Crowd Simulation
    • Highly Influenced
    Improving Sampling-Based Path Planning Methods with Fast Marching
    • 1
    • Highly Influenced
    • PDF
    MASTER 3 D face reconstruction using structured light on a hand-held device
    • Highly Influenced
    • PDF
    Triangular Mesh Based Stroke Segmentation for Chinese Calligraphy
    • 5
    • Highly Influenced
    New Advances of the Extended Minimum Cost Flow Phase Unwrapping Algorithm for SBAS-DInSAR Analysis at Full Spatial Resolution
    • 29
    • Highly Influenced
    New improvements of the extended minimum cost flow phase unwrapping for processing multitemporal full resolution interferograms
    • Highly Influenced