Abstract
In this paper, we present a θ(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane. Up to now, only an O(n log n) worst-case deterministic and an O(n) expected time bound have been shown, leaving an O(n) deterministic solution open to conjecture.
This work is supported by NSERC grant OPG0041629.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aurenhammer A., (1991), ‘Voronoi diagrams: a Survey', ACM Computing Surveys 23. pp.345–405.
Aggarwal A., (1988), ‘Computational Geometry', MIT Lecture Notes 18.409 (1988).
Aggarwal A., Guibas L., Saxe J., and Shor P., (1989), ‘A linear time algorithm for computing the Voronoi diagram of a convex polygon', Disc. and Comp. Geometry 4, pp.591–604.
Bern M. and Eppstein D., (1992), ‘Mesh generation and optimal triangulation', Technical Report, Xero Palo Research Center.
Djidjev H., and Lingas A., (1989) ‘On computing the Voronoi diagram for restricted planar figures', Lecture Notes on Computer Science, pp.54–64.
Chazelle B., (1991), ‘Triangulating a simple polygon in linear time', Disc. and Comp. Geometry, Vol.6 No.5, pp.485–524.
Chew P., (1987), ‘Constrained Delaunay Triangulation', Proc. of the 3rd ACM Symp. on Comp. Geometry, pp.213–222.
Klein R., and Lingas A., (1992), ‘A linear time algorithm for the bounded Voronoi diagram of a simple polygon in L1 metrics', Proc. the 8th ACM Symp. on Comp. Geometry, pp124–133.
Klein R., and Lingas A., (1993), ‘A linear time randomized algorithm for the bounded Voronoi diagram of a simple polygon', Proc. the 9th ACM Symp. on Comp. Geometry, pp124–133.
Lee D. and Lin A., (1986), ‘Generalized Delaunay triangulations for planar graphs', Disc. and Comp. Geometry 1, pp.201–217.
Lingas, A., (1987), ‘A space efficient algorithm for the Constrained Delaunay triangulation', Lecture Notes in Control and Information Sciences, Vol. 113, pp. 359–364.
Levcopoulos C. and Lingas, A., (1990), ‘Fast algorithms for Constrained Delaunay triangulation', Lecture Notes on Computer Science Vol. 447, pp.238–250.
Preparata F. and Shamos M., (1985), Computational Geometry, Springer-Verlag.
Seidel R., (1988), ‘Constrained Delaunay triangulations and Voronoi diagrams with obstacles', Rep. 260, IIG-TU Graz, Austria, pp. 178–191.
Wang C. and Schubert L., (1987), ‘An optimal algorithm for constructing the Delaunay triangulation of a set of line segments', Proc. of the 3rd ACM Symp. on Comp. Geometry, pp.223–232.
Joe B. and Wang C., (1993), ‘Duality of Constrained Delaunay triangulation and Voronoi diagram', Algorithmica, pp.
Wang C., (1993), ‘Efficiently updating the constrained Delaunay triangulations', BIT, 33 (1993), pp. 176–181.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, C.A., Chin, F. (1995). Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_150
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_150
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive