Ray shooting amidst spheres in three dimensions and related problems

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 654-674

  Mohaban, Shai ^a   Sharir, Micha ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Computational geometry; Ray shooting

Indexed keywords

EID: 0006627263     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793252080     Document Type: Article

References (29)

1. P. K. AGARWAL, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Comput., 21 (1992), pp. 540-570.
2. P. K. AGARWAL, B. ARONOV, AND M. SHARIR, Computing envelopes in four dimensions with applications, in Proc. 10th ACM Symposium on Computational Geometry, ACM, New York, 1994, pp. 348-358.
3. P. K. AGARWAL, L. GUIBAS, M. PELLEGRINI, AND M. SHARIR, Ray shooting amidst spheres, unpublished note.
4. P. K. AGARWAL AND J. MATOUŠEK, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
5. P. K. AGARWAL AND J. MATOUŠEK, Range searching with semi-algebraic sets, Discrete Comput. Geom., 11 (1994), pp. 393-418.
6. P. K. AGARWAL AND M. SHARIR, Applications of a new space partitioning technique, Discrete Comput. Geom., 9 (1993), pp. 11-38.
7. P. K. AGARWAL AND M. SHARIR, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions, SIAM J. Comput., 25 (1996), pp. 100-116.
8. 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), pp. 224-278.
9. B. ARONOV, M. PELLEGRINI, AND M. SHARIR, On the zone of a surface in a hyperplane arrangement, Discrete Comput. Geom., 9 (1993), pp. 177-186.
10. R. BAR YEHUDA AND S. FOGEL, Good splitters with applications to ray shooting, in Proc. 2nd Canadian Conference on Computational Geometry, Ottawa, Ontario, 1990, pp. 81-85.
11. M. DE BERG, D. HALPERIN, M. H. OVERMARS, J. SNOEYINK, AND M. VAN KREVELD, Efficient ray shooting and hidden surface removal, Algorithmica, 12 (1994), pp. 30-53.
12. B. CHAZELLE, Bounds on the complexity of polytope range searching, J. Amer. Math. Soc., 2 (1989), pp. 637-666.
13. B. CHAZELLE, H. EDELSBRUNNER, M. GRIGNI, L. GUIBAS, J. HERSHBERGER, M. SHARIR, AND J. SNOEYINK, Ray shooting in polygons using geodesic triangulations, Algorithmica, 12 (1994), pp. 54-68.
14. B. CHAZELLE, H. EDELSBRUNNER, L. GUIBAS, AND M. SHARIR, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Theoret. Comput. Sci., 84 (1991), pp. 77-105.
15. B. CHAZELLE, H. EDELSBRUNNER, L. GUIBAS, M. SHARIR, AND J. STOLFI, Lines in space: Combinatorics and algorithms, Algorithmica, 15 (1996), pp. 428-447.
16. B. CHAZELLE AND L. GUIBAS, Visibility and intersection problems in plane geometry, Discrete Comput. Geom., 4 (1989), pp. 551-589.
17. B. CHAZELLE, M. SHARIR, AND E. WELZL, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Algorithmica, 8 (1992), pp. 407-430.
18. 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), pp. 99-160.
19. D. DOBKIN AND D. KIRKPATRICK, Determining the separation of preprocessed polyhedra: A unified approach, in Proc. 17th International Colloquium on Automata, Languages and Programming, Springer-Verlag, Berlin, 1991, pp. 400-413.
20. H. EDELSBRUNNER, L. GUIBAS, J. PACH, R. POLLACK, R. SEIDEL, AND M. SHARIR, Arrangements of curves in the plane: Topology, combinatorics, and algorithms, Theoret. Comput. Sci., 92 (1992), pp. 319-336.
21. L. GUIBAS, M. OVERMARS, AND M. SHARIR, Ray shooting, implicit point location, and related queries in arrangements of segments, Technical Report 433, Department of Computer Science, New York University, New York, 1989.
22. D. HALPERIN AND M. SHARIR, New bounds for lower envelopes in three dimensions with applications to visibility of terrains, Discrete Comput. Geom., 12 (1994), pp. 313-326.
23. D. HAUSSLER AND E. WELZL, Epsilon nets and simplex range searching, Discrete Comput. Geom., 2 (1987), pp. 127-151.
24. J. HERSHBERGER AND S. SURI, A pedestrian approach to ray shooting: Shoot a ray, take a walk, in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1993, pp. 54-63.
25. J. MATOUŠEK, Approximations and optimal geometric divide-and-conquer, in Proc. 23rd ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 506-511.
26. J. MATOUŠEK, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp. 157-182.
27. N. MEGIDDO, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach., 30 (1983), pp. 852-865.
28. M. SHARIR, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom., 12 (1994), pp. 327-345.
29. M. SHARIR AND P. K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge, UK, New York, Melbourne, 1995.