A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case

Computational Geometry: Theory and Applications

Volumn 17, Issue 1-2, 2000, Pages 69-96

  Lemaire, C ^a   Moreau, J M ^b  

^a DIF   (France)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

Author keywords

Average case complexity; Delaunay triangulation; K d tree; Multi dimensional divide and conquer; Worst case complexity

Indexed keywords

EID: 0346639352     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00017-1     Document Type: Article

References (37)

1. Adam B. Construction des diagrammes de Delaunay dans le plan et dans l'espace. Ph.D. Thesis. 1996;Université de Haute-Alsace, France.
2. Adam B., Elbaz M., Spehner J.C. Construction du diagramme de Delaunay dans le plan en utilisant les mélanges de tris. Quatrièmes Journées de l'AFIG, Dijon, France. 1996;215-223.
3. Aurenhammer F. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surveys. 23:(3):1991;345-405.
4. Benouamer M.O., Jaillon P., Michelucci D., Moreau J.-M. A lazy arithmetic library. Proc. of 11th IEEE Symposium on Computer Arithmetic, Windsor, Ontario. 1993;242-249.
5. Bentley J.L. Multi-dimensional binary search trees used for associative searching. Comm. ACM. 18:(9):1975;509-517.
6. Berger M. Géométrie, 3. Convexes et polytopes polyèdres réguliers, aires et volumes. 1974;Fernand Nathan, Paris.
7. Berger M. Geometry, Vols. 1-2. 1987;Springer, Berlin.
8. Bern M., Eppstein D., Yao F. The expected extremes in a Delaunay triangulation. Internat. J. Comput. Geom. Appl. 1:1991;79-91.
9. Buckley C.E. A divide-and-conquer algorithm for computing 4-dimensional convex hulls. Proc. of Computational Geometry and its Applications. Lecture Notes in Computer Science. 333:1988;113-135 Springer, Berlin.
10. Burnikel C., Könnemann J., Mehlhorn K., Näher S., Schirra S., Uhrig C. Exact geometric computation in LEDA. Proc. of 11th Annu. ACM Symposium on Computational Geometry. 1995;C18-C19.
11. d , Technical Report 95-22. 1995;Instituto CNUCE-CNR, Pisa, Italy.
12. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press/McGraw-Hill, Cambridge, MA.
13. Dwyer R.A. A faster divide-and-conquer algorithm for constructing Delaunay triangulations. Algorithmica. 2:1987;137-151.
14. Dwyer R.A. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6:1991;343-367.
15. Edelsbrunner H. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. 10:1987;Springer, Heidelberg, Germany.
16. Elbaz M. Les diagrammes de Voronoi et de Delaunay dans le plan et dans l'espace. Ph.D. Thesis. 1992;Université de Haute-Alsace, France.
17. Fabri A., Giezeman G.-J., Kettner L., Schirra S., Schoenherr S. On the design of CGAL, the computational geometry algorithms library, Technical Report MPI-I-98-007. 1998;Max Plank Institute for Computer Science.
18. Fortune S., van Wyk C. Efficient exact arithmetic for computational geometry. Proc. of 9th ACM Symposium on Computational Geometry, San Diego, CA. 1993;163-172.
19. Friedman J.H., Bentley J.L., Finkel R.A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software. 3:1977;209-226.
20. Guibas L.J., Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graphics. 4:1985;74-123.
21. Iri M., Ohya T., Murota K. Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms. J. Oper. Res. Soc. Japan. 27:1984;306-337.
22. Katajainen J., Koppinen M. Constructing Delaunay triangulations by merging buckets in quadtree order. Ann. Soc. Math. Polon. Ser. IV Fund. Inform. 11:(3):1988;275-288.
23. Lee D.T., Schachter B.J. Two algorithms for constructing a Delaunay triangulation. Internat. J. Comput. Inform. Sci. 9:1980;219-242.
24. Lemaire C. Triangulation de Delaunay et arbres multidimensionnels. Ph.D. Thesis. 1997;ENSM.SE, Saint-Étienne, France. (in French). Postscript version available at: http://lisse.emse.fr.
25. Lemaire C., Moreau J.-M. Triangulation de Delaunay euclidienne dans le plan: optimisation du divide and conquer à l'aide d'un tri selon deux directions, Technical Report 02D07669. 1996;SETRA, Bagneux, France.
26. Lemaire C., Moreau J.-M. Amélioration de la complexité en moyenne de l'algorithme de Lee et Schachter par division et fusion bi-directionnelles. Revue Internationale de CFAO et d'Informatique Graphique. 12:(4):1997;317-336.
27. Maus A. Delaunay triangulation and the convex hull of n points in expected linear time. BIT. 24:1984;151-163.
28. Mehlhorn K., Näher S. LEDA: A Platform for Combinatorial and Geometric Computing. 1999;Cambridge University Press, New York.
29. Michelucci D., Moreau J.-M. Lazy arithmetic. IEEE Trans. Comput. 46:(9):1997;961-975.
30. Overmars M.H. Designing the computational geometry algorithms library CGAL. Proc. of 1st ACM Workshop on Applied and Computational Geometry. Lecture Notes in Computer Science. 1148:1996;113-119 Springer, Berlin.
31. Shamos M.I., Hoey D. Closest-point problems. Proc. of 16th Annu. IEEE Symposium on Foundations of Computer Science. 1975;151-162.
32. Shewchuck J.R. Triangle: engineering a 2d quality mesh generator and Delaunay triangulator. Lin M.C., Manocha D. Proc. of 1st ACM Workshop on Applied and Computational Geometry. Lecture Notes in Computer Science. 1148:1996;124-133 Springer, Berlin. Program available at http://www.cs.cmu.edu/~quake/triangle.html.
33. Shewchuk J.R. Robust adaptive floating-point geometric predicates. Proc. of 12th ACM Annu. Symposium on Computational Geometry. 1996;141-150.
34. Shewchuk J.R. Adaptive precision floating-point arithmetic and fast robust geometric predicates, Technical Report CMU-CS-96-140. May 1996;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
35. Su P., Drysdale R.L.S. A comparison of sequential Delaunay triangulation algorithms. Proc. of 11th Annu. ACM Symposium on Computational Geometry. 1995;61-70.
36. Su P., Drysdale R.L.S. A comparison of sequential Delaunay triangulation algorithms. Computational Geometry. 7:1997;361-385.
37. Sugihara K., Iri M. Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic. Proc. of the IEEE. 80:(9):1992;1471-1484.