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} }
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.
Figures and Topics from this paper
77 Citations
The Employment of Regular Triangulation for Constrained Delaunay Triangulation
- Computer Science
- ICCSA
- 2004
- 6
The Strange Complexity of Constrained Delaunay Triangulation
- Mathematics, Computer Science
- CCCG
- 2003
- 5
- PDF
Updating and constructing constrained delaunay and constrained regular triangulations by flips
- Mathematics, Computer Science
- SCG '03
- 2003
- 61
- PDF
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
- 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
- Mathematics, Computer Science
- Symposium on Computational Geometry
- 2005
- 58
- PDF
Incrementally constructing and updating constrained Delaunay tetrahedralizations with finite-precision coordinates
- Computer Science
- Engineering with Computers
- 2013
- 19
- PDF
Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates
- Mathematics
- 2014
- 3
- PDF
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2008
- 113
- PDF