Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces

Discrete and Computational Geometry

Volumn 18, Issue 3, 1997, Pages 269-288

  Schwarzkopf, O ^a   Sharir, M ^b,c  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031514212     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009319     Document Type: Article

References (21)

1. P.K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of lower envelopes in three dimensions and its applications, Discrete Comput. Geom. 15 (1996), 1-13.
2. P.K. Agarwal, M. Sharir, and P. Shor, Sharp upper and lower bounds for the length of general Davenport-Schinzel sequences, J. Combin. Theory Ser. A. 52 (1989), 228-274.
3. B. Aronov and M. Sharir, Triangles in space, or: Building (and analyzing) castles in the air, Combinatorica 10(2) (1990), 137-173.
4. B. Aronov and M. Sharir, Castles in the air revisited, Discrete Comput. Geom. 12 (1994), 119-150.
5. B. Aronov and M. Sharir, On translational motion planning in three dimensions, Proc. 10th ACM Symp. on Computational Geometry, 1994, pp. 21-30. Also to appear in SIAM J. Comput.
6. M. de Berg, K. Dobrindt, and O. Schwarzkopf, On lazy randomized incremental construction, Discrete Comput. Geom. 14 (1995), 261-286.
7. 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.
8. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Internat. Colloq. on Automata, Languages and Programming, 1989, pp. 179-193. (Also in Theoretical Computer Science 84 (1991), 77-105.)
9. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Internat. Colloq. on Automata, Languages and Programming, 1989, pp. 179-193. (Also in Theoretical Computer Science 84 (1991), 77-105.)
10. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5 (1990), 99-160.
11. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
12. D. Halperin and M. Sharir, New bounds for lower envelopes in three dimensions, with applications to visibility in terrains, Discrete Comput. Geom. 12 (1994), 313-326.
13. D. Halperin and M. Sharir, Almost tight upper bounds for the single cell and zone problems in three dimensions. Discrete Comput. Geom. 14 (1995), 385-410.
14. 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.
15. 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), 121-134.
16. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986), 151-177.
17. M. Sharir, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom. 6 ( 1991 ), 593-613.
18. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
19. M. Sharir, Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications, Proc. 4th Internat. Workshop on Algorithms and Data Structures (WADS'95), Lecture Notes in Computer Science, Vol. 955, Springer-Verlag, Berlin, 1995, pp. 109-121.
20. M. Sharir and P. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
21. B. Tagansky, A new technique for analyzing substructures in arrangements. Discrete Comput. Geom. 16 (1996), 455-479.