Vertical ray shooting for fat objects

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 288-295

  De Berg, Mark ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Fat objects; Geometric data structures; Ray shooting; Realistic input models

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; QUERY LANGUAGES;

FAT OBJECTS; GEOMETRIC DATA STRUCTURES; RAY SHOOTING; REALISTIC INPUT MODELS;

DATA STRUCTURES;

EID: 33244490292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064137     Document Type: Conference Paper

References (22)

1. P.K. Agarwal and J. Matoušek. On range-searching with semi-algebraic sets. Discr. Comput. Geom. 11: 393-418 (1993).
2. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. LNCS 703, Springer-Verlag, 1993.
3. M. de Berg, M. Katz, F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Algorithmica 34:81-97 (2002).
4. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications (2nd edition). Springer-Verlag, 2000.
5. M. de Berg and M. Streppel. Approximate range searching using binary space partitions. To appear in Proc. IARCS Conf. Found. Software Tech. Theoret. Comput. Sci. (FSTTCS), 2004.
6. C.A. Duncan, Balanced Aspect Ratio Trees, Ph.D. Thesis, John Hopkins University, 1999.
7. 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.
8. A. Efrat. The complexity of the union of (α, β)-covered objects. In Proc. 15th ACM Symp. Comput. Geom., pages 134-142, 1999.
9. A. Efrat and M. Sharir. The complexity of the union of fat objects in the plane. In Proc. 13th ACM Symp. Comput. Geom. pages 104-112, 1997.
10. A. Efrat and M. Katz. On the union of αcurved objects. In Proc. 14th ACM Symp. Comput. Geom., pages 206-213, 1998.
11. M.J. Katz. Personal communication.
12. 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).
13. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles in the plane. Discr. Comput. Geom. 1:59-71 (1986).
14. D. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput. 12:28-35 (1983).
15. M. van Kreveld. On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl. 9:197-210 (1998).
16. J. Matouek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. SIAM J. Comput. 23:154-169 (1994).
17. J. Pach and G. Tardos. On the boundary complexity of the union of fat triangles. SIAM J. Comput. 31: 1745-1760 (2002).
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 (eds.), Handbook of Discrete and Computational Geometry, CRC Press, 1997.
20. P.K. Agarwal and M. Sharir. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, 1995.
21. A.F. van der Stappen. Motion planning amidst fat obstacles. Ph.D. thesis, Utrecht University, Utrecht, the Netherlands, 1994.
22. 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.