Abstract
In this paper we present an algorithm that generalizes Lawson’s algorithm for transforming any triangulation of a point set into the Delaunay triangulation. Lawson’s algorithm flips illegal edges into legal edges. Our algorithm uses lob reductions instead of flips, in a lob reduction an arbitrary number (possibly zero) of illegal edges are replaced by a single edge. Our algorithm reaches the Delaunay triangulation of a set S of n sites O(n 2) time. If the elements of S are the vertices of a convex polygon our algorithm is very efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Adam, M. Elbaz, and J.-C. Spehner. Construction du diagramme de Delaunay dans le plan en utilisant les mélanges de tris. In Actes 4ème Journées AFIG, pages 215–223, 1996.
A. Aggarwal, Leonidas J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591–604, 1989.
J.-D. Boissonnat and F. P. Preparata. Robust plane sweep for interesting segments. Report TR 3270, INRIA, Sophia Antipolis, September 1997.
L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97–108, 1989.
B. Delaunay, Sur la sphère vide. Bull. Acad. Sci. USSR: Class. Sci. Math. Nat., 7:793–800, 1934.
H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153–174, 1987.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 225–265. World Scientific, Singapore, 2nd edition, 1992.
F. Hurtado, M. Noy, and J. Urrutia. Flipping edges in triangulations. Discrete Comput Geom, 22:333–346, 1999.
P. Kauffmann. La construction du diagramme de Delaunay par balayage dans le plan et ses applications. Ph.D. thesis, Université de Haute-Alsace, Mulhouse, France, 1999.
C. L. Lawson. Software for C 1 surface interpolation. In J. R. Rice, editor, Math. Software III, pages 161–194. Academic Press, New York, NY, 1977.
D. T. Lee and A. K. Lin. Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom., 1:201–217, 1986.
M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci., pages 151–162, 1975.
D. Schmitt and J.-C. Spehner. Angular properties of Delaunay diagrams in any dimension. Discrete Comput. Geom., 5:17–36, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kauffmann, P., Spehner, JC. (2001). The construction of Delaunay diagrams by lob reduction. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-47738-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42306-5
Online ISBN: 978-3-540-47738-9
eBook Packages: Springer Book Archive