Voronoi diagrams in higher dimensions under certain polyhedral distance functions

Discrete and Computational Geometry

Volumn 19, Issue 4, 1998, Pages 485-519

  Boissonnat, J D ^a   Sharir, M ^b,c   Tagansky, B ^c   Yvinec, M ^a,d  

^a INRIA   (France)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

^d UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038897223     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009366     Document Type: Article

References (22)

1. B. Aronov, Personal communication.
2. B. Aronov, M. Sharir, and B. Tagansky, The union of convex polyhedra in three dimensions, to appear in SIAM J. Comput.
3. F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structure, ACM Comput. Surv., 23 (1991), 345-405.
4. F. Aurenhammer and H. Imai, Geometric relations among Voronoi diagrams, Geom. Dedicate, 27 (1988), 65-75.
5. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom. 8 (1992), 51-71.
6. L.P. Chew, K. Kedem, M. Sharir, B. Tagansky, and E. Welzl, Voronoi diagrams of lines in three dimensions under a polyhedral convex distance function, Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 197-204.
7. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
9. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1 (1986), 25-44.
10. L. Guibas, D.E. Knuth, and M. Sharir, Randomized incremental construction of Voronoi and Delaunay diagrams, Algorithmica 7 (1992), 381-413.
11. D. Halperin and M. Sharir, New bounds for lower envelopes in three dimensions with applications to visibility of terrains, Discrete Comput. Geom. 12 (1994), 313-326.
12. C. Icking, R. Klein, N.M. Lê, and L. Ma, Convex distance functions in 3-space are different, Fund. Inform. 22 (1995), 331-352.
13. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986), 59-71.
14. R. Klein and D. Wood, Voronoi diagrams based on general metrics in the plane, Proc. 5th Svmp. on Theoretical Aspects of Computer Science (R. Cori and M. Wirsing, eds.), LNCS 294, Springer-Verlag, Berlin, 1988, pp. 281-291.
15. D. Leven and M. Sharir, Intersection and proximity problems and Voronoi diagrams, in Advances in Robotics, Vol. I (J. Schwanz and C. Yap, eds.), 1987, pp. 187-228.
16. K. Mehlhorn, Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
17. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, New York, 1993.
18. J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge, 1994.
19. F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
20. R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1 (1991), 51-64.
21. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
22. B. Tagansky, A new technique for analyzing substructures in arrangements, Discrete Comput. Geom. 16 (1996), 455-479.