Abstract
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 deleted and added in the triangulation during the updates.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, A.,Computational Geometry, MIT Lecture Notes 18.409, (1988).
Aggarwal, A., Guibas, L., Saxe, J. and Shor, P.,A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete and Computational Geometry, 4, (1989), pp. 591–604.
Aurrenhammer, F.,Voronoi diagrams — a survey of a fundamental geometric data structure, ACM Computing Survey (1991), pp.
Chew, P.,Constrained Delaunay triangulations, Proc. 3rd Ann. ACM Symp. on Computational Geometry, (1987), pp. 213–222. Also Algorithmica 4 (1989) pp. 97–108.
Djidjev, H. and Lingas, A.,On computing the Voronoi diagram for restricted planar figures, Lecture Notes in Computer Science, 519, (1991), pp. 54–64.
Joe, B. and Wang, C.,Duality of constrained Voronoi diagram and Delaunay triangulation of a set of line segments, Technical Report, (1988), Memorial University of Newfoundland. (To appear in Algorithmica.)
Lee, D. and Lin, A.,Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom., 1 (1986), pp. 201–217.
Levcopoulos, C. and Lingas, A.,On approximation behavior of the greedy triangulation for convex polygon, Algorithmica, 2 (1987), pp. 175–193.
Levcopoulos, C. and Lingas, A.,Fast algorithms for greedy triangulation, (1990), Proc. 2nd Scandinavian Workshop on Algorithm Theory, Bergen, (1990), Lecture Notes on Computer Sciences 447, Springer, pp. 238–250. Also BIT 32: 2 (1992), 280–296.
Lingas, A.,A space efficient algorithm for the greedy triangulation, Proc. 13th IFIP Conference on System Modeling and Optimization, Tokyo (1987), Lecture Notes on Control and Information Sciences 113, (Springer, Berlin, 1987), pp. 359–364.
Lingas, A.,Voronoi diagrams with barriers and the shortest diagonal problem, IPL 32 (1989), pp. 191–198.
Preparata, F. and Shamos, M., (1985),Computational Geometry, Springer-Verlag.
Seidel, R.,Constrained Delaunay triangulations and Voronoi diagrams with obstacles, Rep. 260, HG-TU Graz, Austria, (1988), pp. 178–191.
Wang, C. and Schubert, L., (1987),An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, Proc. 3rd Ann. ACM Symp. on Computational Geometry, pp. 223–232.
Wang, C., (1992),Efficiently Updating Constrained Delaunay Triangulations, Technical Report, Department of Computer Science, Memorial University of Newfoundland.
Author information
Authors and Affiliations
Additional information
This work is supported by NSERC grant OPG0041629.
Rights and permissions
About this article
Cite this article
Wang, C.A. Efficiently updating constrained Delaunay triangulations. BIT 33, 238–252 (1993). https://doi.org/10.1007/BF01989747
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01989747