Constrained delaunay triangulations

@article{Chew2005ConstrainedDT,
  title={Constrained delaunay triangulations},
  author={L. Chew},
  journal={Algorithmica},
  year={2005},
  volume={4},
  pages={97-108}
}
  • L. Chew
  • Published 2005
  • Computer Science
  • 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
    476 Citations
    Point placement algorithms for Delaunay triangulation of polygonal domains
    • 2
    Towards a Definition of Higher Order Constrained Delaunay Triangulations
    • 10
    • Highly Influenced
    • PDF
    A Constrained Delaunay Triangulation Algorithm Based on Incremental Points
    • 1
    SELF-DELAUNAY MESHES FOR SURFACES
    • 6
    • PDF
    Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction
    • 9
    • Highly Influenced
    • PDF
    Conforming weighted delaunay triangulations
    • M. Alexa
    • Computer Science
    • ACM Trans. Graph.
    • 2020
    • PDF
    Optimal higher order Delaunay triangulations of polygons
    • 8
    • PDF
    Optimal Higher Order Delaunay Triangulations of Polygons
    • 3
    • PDF

    References

    SHOWING 1-10 OF 23 REFERENCES
    Generalized delaunay triangulation for planar graphs
    • 276
    • PDF
    Generalized delaunay triangulation for planar graphs
    • 276
    • PDF
    There is a planar graph almost as good as the complete graph
    • P. Chew
    • Mathematics, Computer Science
    • SCG '86
    • 1986
    • 232
    There is a planar graph almost as good as the complete graph
    • P. Chew
    • Mathematics, Computer Science
    • SCG '86
    • 1986
    • 232
    Delaunay-based representation of surfaces defined over arbitrarily shaped domains
    • 147
    Delaunay-based representation of surfaces defined over arbitrarily shaped domains
    • 147
    Two algorithms for constructing a Delaunay triangulation
    • D. Lee, B. Schachter
    • Computer Science
    • International Journal of Computer & Information Sciences
    • 2004
    • 1,016
    • PDF
    Proximity and reachability in the plane.
    • 149
    Proximity and reachability in the plane.
    • 149
    Efficient computation of continuous skeletons
    • D. Kirkpatrick
    • Computer Science
    • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
    • 1979
    • 288