• DOI:10.1007/BF01989747
Corpus ID: 8160152

Efficiently updating constrained Delaunay triangulations

@article{Wang1993EfficientlyUC,
  title={Efficiently updating constrained Delaunay triangulations},
  author={C. Wang},
  journal={BIT Numerical Mathematics},
  year={1993},
  volume={33},
  pages={238-252}
}

C. Wang

Published 1993

Mathematics, Computer Science

BIT Numerical Mathematics

TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the endpoint set of these obstacles with the restriction that the edge set of the triangulation contains all these obstacles. In this paper we present an optimal Φ(logn +k) algorithm for inserting an obstacle line segment or deleting an obstacle edge in the constrained Delaunay triangulation of a set ofn obstacle line segments in the plane. Herek is the number of Delaunay edges… CONTINUE READING

View on Springer

Save to Library

Create Alert

Cite

Launch Research Feed