Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations

@inproceedings{Shewchuk2000SweepAF,
  title={Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations},
  author={J. Shewchuk},
  booktitle={SCG '00},
  year={2000}
}
  • J. Shewchuk
  • Published in SCG '00 2000
  • Mathematics, Computer Science
  • I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a set of vertices and constraining simplices exists, it can be constructed in time, where is the number of input vertices and is the number of output -simplices. In practice, the running time is likely to be in all but the most pathological cases. The CDT of a star-shaped polytope can be constructed in time, yielding an efficient way to delete a vertex from a CDT. 
    77 Citations
    The Employment of Regular Triangulation for Constrained Delaunay Triangulation
    • 6
    Constrained Delaunay Triangulation using Plane Subdivision
    • 17
    • PDF
    The Strange Complexity of Constrained Delaunay Triangulation
    • 5
    • PDF
    Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
    • H. Ledoux
    • Computer Science
    • 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)
    • 2007
    • 27
    • PDF
    Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
    • J. Shewchuk
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2005
    • 58
    • PDF
    General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
    • J. Shewchuk
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2008
    • 113
    • PDF