Vertical ray shooting and computing depth orders for fat objects

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 494-503

  De Berg, Mark ^a   Gray, Chris ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; RAY TRACING; SET THEORY; TIME SERIES ANALYSIS;

POLYHEDRA; QUERY; RAY SHOOTING;

PROBLEM SOLVING;

EID: 33244462374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109612     Document Type: Conference Paper

References (24)

1. P. Agarwal, M. de Berg, D. Halperin, and M. Sharir. Efficient generation of multi-directional assembly sequences. In Proc. Symp. on Discrete Algorithms (SODA), pages 122-131, 1996.
2. P.K. Agarwal, M.J. Katz, and M. Sharir. Computing depth orders for fat objects and related problems. Comput. Geom. Theory Appl. 5:187-206 (1995).
3. P.K. Agarwal and J. Matoušek. On range-searching with semi-algebraic sets. Discr. Comput. Geom. 11: 393-418 (1993).
4. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. LNCS 703, Springer-Verlag, 1993.
5. M. de Berg. Vertical ray shooting for fat objects. In Proc. 21st ACM Symp. Comput. Geom., pages 288-295, 2005.
6. M. de Berg, H. David, M.J. Katz, M. Overmars, A.F. van der Stappen, and J. Vleugels. Guarding Scenes against invasive hypercubes. Comput. Geom. Theory Appl. 26:99-117 (2003).
7. M. de Berg, M. Katz, F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Algorithmica 34:81-97 (2002).
8. M. de Berg, M. van Kreveld, M. Overmans, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications (2nd edition). Springer-Verlag, 2000.
9. M. de Berg, M. Overniars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput. 23:437-446 (1994).
10. M. de Berg and M. Streppel. Approximate range searching using binary space partitions. Proc. IARCS Conf. Found. Software Tech. Theoret. Comput. Sci. (FSTTCS), pages 110-121, 2004.
11. B. Chazelle and L. J. Guibas. Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1:133-162 (1986)
12. B. Chazelle and L. J. Guibas. Fractional Cascading: II. Applications. Algorithmica 1:163-191 (1986)
13. C.A. Duncan. Balanced Aspect Ratio Trees. Ph.D. Thesis, John Hopkins University, 1999.
14. C.A. Duncan, M.T. Goodrich, S.G. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 10th Ann. ACM-SIAM Sympos. Discrete Algorithms, pages 300-309, 1999.
15. A. Efrat, M.J. Katz, F. Nielsen, and M. Sharir. Dynamic data structures for fat objects and their applications. Comput. Geom. Theory Appl. 15:215-227 (2000).
16. J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes. Computer Graphics, Principles and Practice, Second Edition. Addison-Wesley, 1990.
17. M.J. Katz. 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geom. Theory Appl. 8:299-316 (1998).
18. M.J. Katz. Personal communication, 2005.
19. M.J. Katz, M. Overmars, and M. Sharir. Efficient hidden surface removal for objects with small union size. Comput. Geom. Theory Appl. 2:223-234 (1992).
20. M. van Kreveld. On fat partitioning, fat covering and the union size of polygons. Comput. Geom. Theory Appl. 9(4):197-210, (1998).
21. M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica 9: 471-494 (1993).
22. M.Pellegrini. Ray shooting and lines in space. In: J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry, CRC Press, 1997.
23. A.F. van der Stappen. Motion planning amidst fat obstacles. Ph.D. thesis, Utrecht University, Utrecht, the Netherlands, 1994.
24. A.F. van der Stappen, D. Halperin, and M.H. Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl. 3:353-373, 1993.