Almost tight upper bounds for vertical decompositions in four dimensions

Journal of the ACM

Volumn 51, Issue 5, 2004, Pages 699-730

  Koltun, Vladlen ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Arrangements; Decompositions; Point location; Range searching; Ray shooting; Robot motion planning

Indexed keywords

ARRANGEMENTS; DECOMPOSITIONS; POINT LOCATION; RANGE SEARCHING; RAY SHOOTING; ROBOT MOTION PLANNING;

ALGORITHMS; BOUNDARY CONDITIONS; DECOMPOSITION; MOTION PLANNING; OPTIMIZATION; ROBOTICS;

LINEAR ALGEBRA;

EID: 12344324489     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1017460.1017461     Document Type: Article

References (29)

1. AGARWAL, P. K., ARONOV, B., AND SHARIR, M. 1997. Computing envelopes in four dimensions with applications. SIAM J. Comput. 26, 1714-1732.
2. AGARWAL, P. K., EFRAT, A., AND SHARIR, M. 1999. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput 29, 912-953.
3. AGARWAL, P. K., AND ERICKSON, J. 1999. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, Eds. Contemporary Mathematics, vol. 223. American Mathematical Society, Providence, RI, 1-56.
4. AGARWAL, P. K., AND MATOUŠEK, J. 1994. On range searching with semialgebraic sets. Disc. Comput. Geom. 11, 393-418.
5. AGARWAL, P. K., SCHWARZKOPF, O., AND SHARIR, M. 1996. The overlay of lower envelopes and its applications. Disc. Comput. Geom. 15, 1-13.
6. AGARWAL, P. K., AND SHARIR, M. 1996. Efficient randomized algorithms for some geometric optimization problems. Disc. Comput. Geom. 16, 317-337.
7. AGARWAL, P. K., AND SHARIR, M. 2000. Arrangements and their applications. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers B.V., North-Holland, Amsterdam, The Netherlands, 49-119.
8. AGARWAL, P. K., SHARIR, M., AND TOLEDO, S. 1994. Applications of parametric searching in geometric optimization. J. Algorithms 17, 292-318.
9. CHAZELLE, B., EDELSBRUNNER, H., GUIBAS, L. J., AND SHARIR, M. 1991. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoret. Comput. Sci. 84, 77-105. (Also in Proc. International Colloquium on Automata, Languages and Programming (1989), pp. 179-193.)
10. CHAZELLE, B., EDELSBRUNNER, H., GUIBAS, L. J., AND SHARIR, M. 1991. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoret. Comput. Sci. 84, 77-105. (Also in Proc. International Colloquium on Automata, Languages and Programming (1989), pp. 179-193.)
11. CHAZELLE, B., EDELSBRUNNER, H., GUIBAS, L. J., AND SHARIR, M. 1993. Diameter, width, closest line pair and parametric searching. Disc. Comput. Geom. 10, 183-196.
12. CHAZELLE, B., AND SHARIR, M. 1990. An algorithm for generalized point location and its applications. J. Symb. Comput. 10, 281-309.
13. CLARKSON, K. L. 1988. A randomized algorithm for closest-point queries. SIAM J. Comput. 77, 830-847.
14. CLARKSON, K. L., AND SHOR, P. W. 1989. Applications of random sampling in computational geometry, II. Disc. Comput. Geom. 4, 387-421.
15. COLLINS, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages. 134-183.
16. DE BERG, M. 1993. Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science, vol. 703. Springer-Verlag, Berlin, Germany.
17. DE BERG, M., GUIBAS, L. J., AND HALPERIN, D. 1996. Vertical decompositions for triangles in 3-space. Disc. Comput. Geom. 15, 35-61.
18. DE BERG, M., HALPERIN, D., OVERMARS, M., SNOEYINK, J., AND VAN KREVELD, M. 1994. Efficient ray shooting and hidden surface removal. Algorithmica 12, 30-53.
19. GUIBAS, L. J., HALPERIN, D., MATOUŠEK, J., AND SHARIR, M. 1995. On vertical decomposition of arrangements of hyperplanes in four dimensions. Disc. Comput. Geom. 14, 113-122.
20. HALPERIN, D. 1997. Arrangements. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, Chap. 21, 389-412.
21. HALPERIN, D., AND SHARIR, M. 1994. New bounds for lower envelopes in three dimensions, with applications to visibility in terrains. Disc. Comput. Geom. 12, 313-326.
22. KOLTUN, V. 2004. Sharp bounds for vertical decompositions of linear arrangements in four dimensions. Disc. Comput. Geom. 31, 435-460.
23. MOHABAN, S., AND SHARIR, M. 1997. Ray shooting amidst spheres in three dimensions and related problems. SIAM J. Comput. 26, 654-674.
24. PELLEGRINI, M. 1993. Ray shooting on triangles in 3-space. Algorithmica 9, 471-494.
25. SCHWARZKOPF, O., AND SHARIR, M. 1997. Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications. Disc. Comput. Geom. 18, 269-288.
26. SHARIR, M. 1994. Almost tight upper bounds for lower envelopes in higher dimensions. Disc. Comput. Geom. 12, 327-345.
27. SHARIR, M. 1997. Algorithmic motion planning. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, Chap. 40, 733-754.
28. SHARIR, M., AND AGARWAL, P. K. 1995. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York.
29. TAGANSKY, B. 1996. A new technique for analyzing substructures in arrangements of piecewise linear surfaces. Disc. Comput. Geom. 16, 455-479.