Voronoi Diagrams of Lines in 3-Space under Polyhedral Convex Distance Functions

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 238-255

  Chew, L Paul ^a   Kedem, Klara ^b   Sharir, Micha ^c,d   Tagansky, Boaz ^c   Welzl, Emo ^e  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

^e ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000671228     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0957     Document Type: Article

References (15)

1. B. Aronov and M. Sharir, On translational motion planning in three dimensions, in "Proceedings of the Tenth ACM Symposium on Computational Geometry, 1994," pp. 21-30, SIAM J. Comput. 26 (1997), 1785-1803.
2. B. Aronov and M. Sharir, On translational motion planning in three dimensions, in "Proceedings of the Tenth ACM Symposium on Computational Geometry, 1994," pp. 21-30, SIAM J. Comput. 26 (1997), 1785-1803.
3. F. Aurenhammer, Voronoi diagrams - A survey of a fundamental geometric data structure, ACM Comput. Surveys 23 (1991), 346-405.
4. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, in "Proceedings of the Eleventh ACM Symposium on Computational Geometry, 1995," pp. 79-88. Also to appear in Discrete Comput. Geom.
5. 1 Voronoi diagram of moving points, in "Proceedings of the Fifth Canadian Conference on Computational Geometry, 1993," pp. 364-369.
6. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
7. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, Heidelberg, 1987.
8. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1 (1986), 25-44.
9. J. Pach and M. Sharir, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis, Discrete Comput. Geom. 4 (1989), 291-309.
10. M. Sharir, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom. 6 (1991), 593-613.
11. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
12. M. Sharir and P. Agarwal, "Davenport-Schinzel Sequences and Their Geometric Applications," Cambridge Univ. Press, New York, 1995.
13. B. Tagansky, A new technique for analyzing substructures in arrangements, in "Proceedings of the Eleventh ACM Symposium on Computational Geometry, 1995," pp. 200-210, Discrete Comput. Geom. 16 (1996), 455-479.
14. B. Tagansky, A new technique for analyzing substructures in arrangements, in "Proceedings of the Eleventh ACM Symposium on Computational Geometry, 1995," pp. 200-210, Discrete Comput. Geom. 16 (1996), 455-479.
15. A. Wiernik and M. Sharir, Planar realization of nonlinear Davenport-Schinzel sequences by segments, Discrete Comput. Geom. 3 (1988), 15-47.