Expected time analysis for Delaunay point location

Computational Geometry: Theory and Applications

Volumn 29, Issue 2, 2004, Pages 61-89

  Devroye, Luc ^a   Lemaire, Christophe ^a   Moreau, Jean Michel ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Computational geometry; Delaunay triangulation; Expected time analysis; Point location; Probabilistic analysis; Random tree; Voronoi diagram

Indexed keywords

EID: 4344644967     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.02.002     Document Type: Article

References (35)

1. Angluin D., Valiant L.G. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sci. 18:1979;155-193.
2. Bentley J.L. Multidimensional binary search trees used for associative searching. Comm. ACM. 18:1975;509-517.
3. Bentley J.L., Weide B.W., Yao A.C. Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Software. 6:1980;563-580.
4. Bern M., Eppstein D., Yao F.F. The expected extremes in a Delaunay triangulation. Internat. J. Comput. Geom. Appl. 1:1991;79-91.
5. Boissonnat J.-D., Teillaud M. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci. 112:1993;339-354.
6. Boissonnat J.-D., Yvinec M. Géométrie Algorithmique. 1995;Ediscience, Paris.
7. Boissonnat J.-D., Yvinec M. Algorithmic Geometry. 1998;Cambridge University Press, Cambridge.
8. Borouchaki H., George P.L. Triangulation de Delaunay et maillages. 1997;Hermès.
9. Bose P., Devroye L. Intersections with random geometric objects. Computational Geometry. 10:1998;139-154.
10. Chanzy P., Devroye L., Zamora-Cura C. Analysis of range search for random k-d trees. Acta Inform. 37:2001;355-383.
11. Chazelle B., Devillers O., Hurtado F., Mora M., Sacristan V., Teillaud M. Splitting a Delaunay triangulation in linear time. Proceedings of the Ninth European Symposium on Algorithms. Lecture Notes in Computer Science. vol. 2161:2001;312-320 Springer-Verlag, Berlin.
12. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Boston.
13. Devillers O., Meiser S., Teillaud M. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Computational Geometry. 2:1992;55-80.
14. Devillers O., Pion S., Teillaud M. Walking in a triangulation. Proceedings of the 17th Annual Symposium on Computational Geometry. 2001;106-114.
15. Devillers O. The Delaunay hierarchy. Internat. J. Found. Comput. Sci. 13:2002;163-180.
16. Devroye L., Mücke E., Zhu B. A note on point location in Delaunay triangulations of random points. Algorithmica. 22:1998;477-482.
17. Devroye L., Lemaire C., Moreau J.-M. Fast Delaunay point location with search structures. Eleventh Canadian Conference on Computational Geometry, 15-18 August 1999, p. Vancouver, Canada. 1999.
18. Devroye L., Jabbour J., Zamora-Cura C. Squarish k-d trees. SIAM J. Comput. 30:2000;1678-1700.
19. Gonnet G.H., Baeza-Yates R. Handbook of Algorithms and Data Structures. 1991;Addison-Wesley, Workingham, England.
20. Green P., Sibson R. Computing Dirichlet tesselations in the plane. Comput. J. 21:1978;168-173.
21. Guibas L., Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4:1985;74-123.
22. Guibas L.J., Knuth D.E., Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica. 1992;381-413.
23. Hinrichs K., Nievergelt J., Schorn P. An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. Acta Inform. 29:1992;383-394.
24. Knuth D.E. The Art of Computer Programming, vol. 2. second ed. 1981;Addison-Wesley, Reading, MA.
25. Lawson C.L. Software for C1 surface interpolation. Rice J. Mathematical Software III. 1977;161-194 Academic Press, New York.
26. C. Lemaire, Triangulation de Delaunay et arbres multidimensionnels, PhD Dissertation, Université Jean Monnet, Saint-Étienne, France, 1997.
27. Mücke E.P., Saias I., Zhu B. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. Computational Geometry. 12:1999;63-83.
28. Nievergelt J., Reingold E.M. Binary search trees of bounded balance. SIAM J. Comput. 2:1973;33-43.
29. Okabe A., Boots B., Sugihara K. Spatial Tessellations. 1992;Wiley, New York.
30. Okamoto M. Some inequalities relating to the partial sum of binomial probabilities. Ann. Math. Statist. 10:1958;29-35.
31. Panchenko D. Some extensions of an inequality of Vapnik and Chervonenkis. Electron. Comm. Probab. 7:2002;55-65.
32. Reingold E.M., Nievergelt J., Deo N. Combinatorial Algorithms: Theory and Practice. 1977;Prentice Hall, Englewood Cliffs, NJ.
33. Robson J.M. The height of binary search trees. Australian Comput. J. 11:1979;151-153.
34. Sproull R.F. Refinements to nearest-neighbor searching in k -dimensional trees. Algorithmica. 6:1991;579-589.
35. Vapnik V.N., Chervonenkis A.Ya. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16:1971;264-280.