Voronoi diagrams in higher dimensions under certain polyhedral distance functions

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 79-88

  Boissonnat, Jean Daniel ^a   Sharir, Micha ^b,c   Tagansky, Boaz ^b   Yvinec, Mariette ^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

GRAPHIC METHODS;

COMBINATORIAL COMPLEXITY; DISTANCE FUNCTIONS; HIGHER DIMENSIONS; HYPER-CUBES; POINTS IN GENERAL POSITION; UPPER BOUND; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 84990660121     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220288     Document Type: Conference Paper

References (13)

1. F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structure, ACM Comput. Surv., 23(1991), 345-405.
2. 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), 197-204.
3. K. Clarkson and P. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4(1989), 387-421.
4. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg 1987.
5. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1(1986), 25-44.
6. 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.
7. 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.
8. D. Leven and M. Sharir, Intersection and proximity problems and Voronoi diagrams, in Advances in Robotics, Vol. I, (J. Schwartz and C. Yap, Eds.), 1987, 187-228.
9. K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms, Prentice Hall, 1993.
10. J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge 1994.
11. F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York 1985.
12. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12(1994), 327-345.
13. B. Tagansky, A new technique for analyzing substructures in arrangements, this proceedings.