• DOI:10.1145/336154.336222
Corpus ID: 15874083

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

View on ACM

people.eecs.berkeley.edu

Save to Library

Create Alert

Cite

Launch Research Feed

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.