The union of convex polyhedra in three dimensions

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1670-1688

  Aronov, Boris ^a   Sharir, Micha ^b,c   Tagansky, Boaz ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Combinatorial complexity; Combinatorial geometry; Computational geometry; Convex polyhedra; Geometric algorithms; Randomized algorithms

Indexed keywords

EID: 0000045918     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793250755     Document Type: Article

References (37)

1. B. ARONOV, M. BERN, AND E. EPPSTEIN, Arrangements of polytopes with applications, manuscript, 1993.
2. B. ARONOV, J. MATOUŠEK, AND M. SHARIR, On the sum of squares of cell complexities in hyperplane arrangements, J. Combin. Theory Ser. A, 65 (1994), pp. 311-321.
3. [31 B. ARONOV, M. PELLEGRINI, AND M. SHARIR, On the zone of a surface in a hyperplane arrangement, Discrete Comput. Geom., 9 (1993), pp. 177-188.
4. B. ARONOV AND M. SHARIR, Triangles in space, or building (and analyzing) castles in the air, Combinatorica, 10 (1990), pp. 137-173.
5. B. ARONOV AND M. SHARIR, Castles in the air revisited, Discrete Comput. Geom., 12 (1994), pp. 119-150.
6. B. ARONOV AND M. SHARIR, The union of convex polyhedra in three dimensions, Proc. 34th Annual IEEE Sympos. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 518-527.
7. B. ARONOV AND M. SHARIR, The common exterior of convex polygons in the plane, Comput. Geom. Theory Appl., 8 (1997), pp. 139-149.
8. B. ARONOV AND M. SHARIR, On translational motion planning in three dimensions, SIAM J. Comput., 26 (1997), pp. 1785-1803.
9. 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), pp. 51-71.
10. 3, Comput. Geom. Theory Appl., to appear; J. Algorithms, to appear.
11. 3, Comput. Geom. Theory Appl., to appear; J. Algorithms, to appear.
12. J.-D. BOISSONNAT, M. SHARIR, B. TAGANSKY, AND M. YVINEC, Voronoi diagrams in higher dimensions under certain polyhedral convex distance functions, in Proc. 11th ACM Symp. on Comput. Geom., ACM, New York, 1995, pp. 79-88.
13. B. CHAZELLE, An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM J. Comput., 21 (1992), pp. 671-696.
14. B. CHAZELLE, H. EDELSBRUNNER, L. GUIBAS, M. SHARIR, AND J. SNOEYINK, Computing a face in an arrangement of line segments, SIAM J. Comput., 22 (1993), pp. 1286-1302.
15. 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, in Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 197-204.
16. K. CLARKSON AND P. SHOR, Applications of random sampling in computational geometry II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
17. M. DE BERG, K. DOBRINDT, AND O. SCHWARZKOPF, On lazy randomized incremental construction, Discrete Comput. Geom., 14 (1995), pp. 261-286.
18. H. EDELSBRUNNER, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
19. H. EDELSBRUNNER, L. GUIBAS, AND M. SHARIR, The complexity and construction of many faces in arrangements of lines and of segments, Discrete Comput. Geom., 5 (1990), pp. 161-196.
20. H. EDELSBRUNNER, R. SEIDEL, AND M. SHARIR, On the zone theorem in hyperplane arrangements, SIAM J. Comput., 22 (1993), pp. 418-429.
21. L. GUIBAS, D. KNUTH, AND M. SHARIR, Randomized incremental construction of Voronoi and Delaunay diagrams, Algorithmica, 7 (1992), pp. 381-413.
22. D. HALPERIN AND M. SHARIR, A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment, Discrete Comput. Geom., 16 (1996), pp. 121-134.
23. D. HALPERIN AND M. SHARIR, New bounds for lower envelopes in three dimensions with applications to visibility in terrains, Discrete Comput. Geom., 12 (1994), pp. 313-326.
24. D. HALPERIN AND M. SHARIR, Arrangements and their applications in robotics: Recent developments, in The Algorithmic Foundations of Robotics, K. Goldberg, D. Halperin, J.C. Latombe, and R. Wilson, eds., A.K. Peters, Boston, MA, 1995, pp. 495-511.
25. D. HALPERIN AND M. SHARIR, Almost tight upper bounds for the single cell and zone problems in three dimensions, Discrete Comput. Geom., 14 (1995), pp. 385-410.
26. G. O. KATONA, On a problem of L. Fejes Tóth, Stud. Sci. Math. Hung., 12 (1977), pp. 77-80.
27. M. D. KOVALEV, Svoisto vypuklykh mnozhestv i ego prilozhenie, Mat. Zametki, 44 (1988), pp. 89-99.
28. K. KEDEM, R. LIVNE, J. PACK, AND M. SHARIR, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom., 1 (1986), pp. 59-71.
29. J. MATOUŠEK, J. PACK, M. SHARIR, S. SIFRONY, AND E. WELZL, Fat triangles determine linearly many holes, SIAM J. Comput., 23 (1994), pp. 154-169.
30. K. MEHLHORN, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
31. N. MILLER AND M. SHARIR, Efficient randomized algorithms for constructing the union of fat triangles and of pseudo-disks, manuscript, 1991.
32. F. PREPARATA AND M. SHAMOS, Computational Geometry. An Introduction, Springer-Verlag, New York, 1985.
33. M. SHARIR, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom., 6 (1991), pp. 593-613.
34. M. SHARIR, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom., 12 (1994), pp. 327-345.
35. M. SHARIR AND P.K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge, New York, Melbourne, 1995.
36. E.H. SPANIER, Algebraic Topology, Springer-Verlag, New York, Heidelberg, Berlin, 1966.
37. B. TAGANSKY, A new technique for analyzing substructures in arrangements, Discrete Comput. Geom., 16 (1996), pp. 455-479.