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
    14 Citations

    Topics from this paper

    Triangulations intersect nicely
    • 20
    Fast greedy triangulation algorithms
    • 35
    • PDF
    Fast Greedy Triangulation Algorithms
    • 6
    • PDF
    TR A 1 / 0 6 Efficient Constrained Delaunay Triangulation for Large Spatial Databases
    • PDF
    On Greedy Tetrahedralization of Points in 3D

    References

    SHOWING 1-8 OF 8 REFERENCES
    Generalized delaunay triangulation for planar graphs
    • 276
    • PDF
    A linear-time algorithm for computing the voronoi diagram of a convex polygon
    • 322
    • PDF
    On Computing the Voronoi Diagram for Restricted Planar Figures
    • 20
    Voronoi Diagrams with Barriers and the Shortest Diagonal Problem
    • A. Lingas
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1989
    • 31
    Fast algorithms for greedy triangulation
    • 10