Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations

Computational Geometry: Theory and Applications

Volumn 12, Issue 1-2, 1999, Pages 63-83

  Mücke, Ernst P ^a,b   Saias, Isaac ^a,c   Zhu, Binhai ^a,d  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b ANSYS INC   (United States)

^c BiosGroup Inc   (United States)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Computational geometry; Delaunay triangulations; Geometric computing; Point location; Randomized algorithms; Three dimensional

Indexed keywords

EID: 0041758594     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(98)00035-2     Document Type: Article

References (24)

1. B. Aronov, S. Fortune, Average-case ray shooting and minimum weight triangulations, in: Proceedings of the 13th Annual Symposium on Computational Geometry, 1997, pp. 203-212.
2. T. Asano, M. Edahiro, H. Imai, M. Iri, K. Murota, Practical use of bucketing techniques in computational geometry, in: G.T. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 153-195.
3. M. Bern, D. Eppstein, F. Yao, The expected extremes in a Delaunay triangulation, Internat. J. Comput. Geom. Appl. 1 (1991) 79-91.
4. J. Bonet, J. Peraire, An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems, Internat. J. Numer. Methods Engrg. 31 (1991) 1-17.
5. H. Borouchaki, S.H. Lo, Fast Delaunay triangulation in three dimensions, Comput. Methods Appl. Mech. Engrg. 128 (1-2) (1995) 153-167.
6. P. Bose, L. Devroye, Intersections with random geometric objects, Manuscript, School of Computer Science, McGill University, 1995.
7. A. Bowyer, Computing Dirichlet tessellations, The Computer Journal 24 (1981) 162-166.
8. E. Brisson, Representing geometric structures in d dimensions: Topology and order, Discrete Comput. Geom. 9 (4) (1993) 387-426.
9. O. Devillers, Improved incremental randomized Delaunay triangulation, Technical Report 3298, INRIA, Sophia-Antipolis, 1997.
10. L. Devroye, E. Mücke, B. Zhu, A note on point location in Delaunay triangulations of random points, Algorithmica (Special Issue on Average Case Analysis of Algorithms) 22 (4) (1998) 477-482.
11. D.P. Dobkin, M.J. Laszlo, Primitives for the manipulation of three-dimensional subdivisions, Algorithmica 4 (1) (1989) 3-32.
12. D.P. Dobkin, R.J. Lipton, Multidimensional searching problems, SIAM J. Comput. 5 (1976) 181-186.
13. R. A. Dwyer, Higher-dimensional Voronoi diagrams in linear expected time, Discrete Comput. Geom. 6 (1991) 343-367.
14. H. Edelsbrunner, An acyclicity theorem for cell complexes in d dimensions, Combinatorica 10 (1990) 251-260.
15. M. Garland, P.S. Heckbert, Fast polygonal approximation of terrains and height fields, Technical Report CMU-CS-95-181, School of Computer Science, Carnegie Mellon University, 1995.
16. P.L. George, F. Hermeline, Delaunay's mesh of a convex polyhedron in dimension d, Application to arbitrary polyhedra, Internat. J. Numer. Methods Engrg. 33 (5) (1992) 975-995.
17. M.T. Goodrich, M. Orletsky, K. Ramaiyer, Methods for achieving fast query times in point location data structures, in: Proceedings of 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97), 1997, pp. 757-766.
18. P.J. Green, R. Sibson, Computing Dirichlet tessellations in the plane, The Computer Journal 21 (1978) 168-173.
19. L.J. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Trans. Graphics 4 (2) (1985) 74-123.
20. E.P. Mücke, Shapes and implementations in three-dimensional geometry, Ph.D. Thesis, Technical Report UIUCDCS-R-93-1836, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1993.
21. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, Berlin, 1985.
22. J.R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, in: Proceedings of the 1st ACM Workshop on Applied Computational Geometry, 1996, pp. 124-133.
23. J. Snoeyink, Point location, in: J.E. Goodman and J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 1997, pp. 559-574.
24. H. Trease, D. George, C. Gable, J. Fowler, E. Linnbur, A. Kuprat, A. Khamayseh, The X3D Grid Generation System, in: Proceedings of the 5th International Conference on Numerical Grid Generation in Computational Field Simulations, 1996, pp. 239-244.