Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 88-94

  Aronov, Boris ^a   De Berg, Mark ^b   Gray, Chris ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Computational geometry; Fat objects; Intersection searching; Ray shooting

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; QUERY LANGUAGES;

FAT OBJECTS; INTERSECTION SEARCHING; POLYHEDRA; RAY SHOOTING;

COMPUTATIONAL GEOMETRY;

EID: 33748081122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137872     Document Type: Conference Paper

References (23)

1. P. K. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 1997.
2. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Contemporary Mathematics, volume 223, pages 1-56. American Mathematical Society, 1998.
3. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM Journal on Computing, 22(4):794-806, 1993.
4. P. K. Agarwal and J. Matoušek. On range-searching with semi-algebraic sets. Discrete and Computational Geometry, 11:393-418, 1993.
5. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Stolfi. Lines in space: Combinatorics and algorithms. Algorithmica, 15(5):428-447, 1996.
6. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. Springer-Verlag New York, LNCS 703, 1993.
7. M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica, 28:353-366, 2000.
8. M. de Berg. Vertical ray shooting for fat objects. In Proc. 21st Annual Symposium on Computational Geometry, pages 288-295, 2005.
9. M. de Berg and C. Gray. Vertical ray shooting and computing depth orders for fat objects. In Proc. 17th Annual Symposium on Discrete algorithm, pages 494-503, New York, NY, USA, 2006. ACM Press.
10. M. de Berg and M. Streppel. Approximate range searching using binary space partitions. In Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 110-121, 2004.
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 1997.
12. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoretical Computer Science, 27(3)-.241-253, 1983.
13. J. Erickson. New lower bounds for Hopcroft's problem. Discrete and Computational Geometry, 16:389-418, 1996.
14. M. J. Katz. 3-d vertical ray shooting and 2-d point enclosure, range searching, and arc shooting amidst convex fat objects. Computational Geometry: Theory and Applications, 8:299-316, 1997.
15. J. S. B. Mitchell, D. M. Mount, and S. Suri. Query-sensitive ray shooting. International Journal of Computational Geometry and Applications, 7(4):317-347, 1997.
16. S. Mohaban and M. Sharir. Ray shooting amidst spheres in three dimensions and related problems. SIAM Journal on Computing, 26(3):654-674, 1997.
17. M. H. Overmars and A. F. van der Stappen. Range searching and point location among fat objects. In Proc. 2nd European Symposium on Algorithms, pages 240-253. Springer Verlag, LNCS 885, 1994.
18. M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica, 9:471-494, 1993.
19. M. Pellegrini. Ray shooting and lines in space. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 599-614. CRC Press, Boca Raton-New York, 1997.
20. O. Schwarzkopf and J. Vleugels. Range searching in low-density environments. Information Processing Letters, 60:121-127, 1996.
21. M. Sharir and H. Shaul. Ray shooting and stone throwing. In Proc. 11th European Symposium on Algorithms, pages 470-481. Springer-Verlag, LNCS 2832, 2003.
22. M. Sharir and H. Shaul. Ray shooting amid balls, farthest point from a line, and range emptiness queries. In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 525-534, 2005.
23. A. F. van der Stappen. Motion Planning Amidst Fat Obstacles. PhD thesis, Dept. of Computer Science, Utrecht University, 1994.