Query-sensitive ray shooting

International Journal of Computational Geometry and Applications

Volumn 7, Issue 4, 1997, Pages 317-347

  Mitchell, Joseph S B ^a   Mount, David M ^b   Suri, Subhash ^c  

^a USA   (United States)

^b University of Maryland   (United States)

^c WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031536841     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819599700020X     Document Type: Article

References (34)

1. P. K. Agarwal. A deterministic algorithm for partitioning arrangements of lines and its applications. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 11-22, 1989.
2. P. K. Agarwal, B. Aronov, and S. Suri. Stabbing triangulations by lines in three dimensions. In Proc. 11th ACM Sympos. Comput. Geom., pages 267-276, 1995.
3. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput., 22(4):794-806, 1993.
4. P. K. Agarwal and J. Matoušek. On range searching with semi-algebraic sets. Discrete Comput. Geom., 11:393-418, 1994.
5. P. K. Agarwal and M. Sharir. Ray shooting amidst convex polytopes in three dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 260-270, 1993.
6. P. K. Agarwal and M. Sharir. Applications of a new space-partitioning technique. Discrete Comput. Geom., 9:11-38, 1993.
7. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
8. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573-582, 1994.
9. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal, volume 703 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993.
10. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 21-30, 1991.
11. M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Lett., 45:95-99, 1993.
12. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. In Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci., pages 231-241, 1990.
13. P. B. Callahan and S. R. Kosaraju. A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields. In Proc. 24th Annu. ACM Sympos. Theory Comput., pages 546-556, 1992.
14. P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest-pair and n-body potential fields. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 263-272, 1995.
15. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. 49n Proc. 18th Internat. Colloq. Automata Lang. Program., volume 510 of Lecture Notes in Computer Science, pages 661-673. Springer-Verlag, 1991.
16. B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. In Proc. 1st Anntt. ACM Sympos. Comput. Geom., pages 135-146, 1985.
17. S. W. Cheng and R. Janardan. Space-efficient ray shooting and intersection searching: Algorithms, dynamization and applications. In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 7-16, 1991.
18. S. W. Cheng and R. Janardan. Algorithms for ray-shooting and Intersection searching. J. Algorithms, 13:670-692, 1992.
19. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pages 226-232, 1983
20. C. R. Dyer. The space efficiency of quadtrees, Computer Graphics and Image Processing, 19:335-348, 1982.
21. A. S. Glassner. An Introduction to Ray Tracing. Academic Press, San Deigo, CA, 1989.
22. M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths via balanced geodesic triangulations. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 318-327, 1993.
23. M. Held, J. T. Klosowski, and J. S. B. Mitchell. Evaluation of collision detection methods from virtual reality fly-throughs. In Proc. 7th Canad. Conf. Comput. Geom., pages 205-210, 1995.
24. J. Hershberger and S. Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. J. Algorithms, 18:403-431, 1995.
25. B. Von Herzen and A. H. Barr. Accurate triangulations of deformed, intersecting surfaces. Computer Graphics, 21(4):103-110, July 1987.
26. G. M. Hunter and K. Steiglitz. Operations on images using quad trees, IEEE Trans. on Pattern Analysis and Machine Intelligence, 1:145-153, 1979.
27. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 212-221, 1992.
28. D. W. Moore. Simplicial mesh generation with applications. Ph.D. thesis, Dept. Comput. Sci., Cornell Univ., Ithaca, NY, 1992. Report 92-1322.
29. M. Overmars, H. Schipper, and M. Sharir. Storing line segments in partition trees. BIT, 30:385-403, 1990.
30. M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica, 9:471-494, 1993.
31. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
32. O. Schwarzkopf. Ray shooting in convex polytopes. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 286-295, 1992.
33. F. X. Sillion and C. Puech. Radiosity and Global Illumination. Morgan Kaufmann, San Francisco, 1994.
34. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101-115, 1989.