Ray Shooting and Stone Throwing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 470-481

  Sharir, Micha ^a   Shaul, Hayim ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NONTRIVIAL SOLUTION; QUERY TIME; RAY SHOOTING; SPECIAL CLASS; THREE DIMENSIONS;

ALGORITHMS;

EID: 0142152730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_43     Document Type: Article

References (17)

1. P. K. Agarwal. Applications of a new space partition technique. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes Comput. Sci., pages 379-392, 1991.
2. P. K. Agarwal. Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, New York, USA, 1991.
3. P. K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number. SIAM J. Comput., 21:540-570, 1992.
4. P. K. Agarwal and J. Matousek. Ray shooting and parametric search. SIAM J. Comput., 22(4):794-806, 1993.
5. P. K. Agarwal and J. Matousek. On range searching with semi-algebraic sets. Discrete Comput. Geom., 11:393-418, 1994.
6. P. K. Agarwal and M. Sharir. Applications of a new space-partitioning technique. Discrete Comput. Geom., 9:11-38, 1993.
7. P. K. Agarwal and M. Sharir. Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions. SIAM J. Comput., 25:100-116, 1996.
8. B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
9. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Stolfi. Lines in space: Combinatorics and algorithms. Algorithmica, 15:428-447, 1996.
10. B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. Discrete Comput. Geom., 4:551-581, 1989.
11. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal. Algorithmica, 12:30-53, 1994.
12. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra - a unified approach. In Proc. 17th Internat. Colloq. Automata Lang. Program., volume 443 of Lecture Notes Comput. Sci., pages 400-413. Springer-Verlag, 1990.
13. V. Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 56-65, 2001.
14. J. Matousek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
15. S. Mohaban and M. Sharir. Ray shooting amidst spheres in three dimensions and related problems. SIAM J. Comput., 26:654-674, 1997.
16. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
17. J. Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York, NY, 1991.