Abstract
We solve some problems related toray shooting in the plane, such as finding the first object hit by a query ray or counting the number of objects intersected by the query line. Our main results are an algorithm for finding the first hit when the objects are lines, and an algorithm for the case when the objects are segments. If the segments form simple polygons, this information can be used for reducing the complexity of the algorithms. The algorithms are efficient in space and in query time. Moreover, they are simple and therefore of practical use.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number.Proceedings of the 5th Annual ACM Conference on Computational Geometry, pages 315–325, 1989.
P. K. Agarwal and J. Matoušek. Ray shooting and parametric search.Proceedins of the 24th Annual ACM Symposium on the Theory of Computing, pages 517–526, 1992.
P. K. Agarwal and M. Sharir. Applications of a new space partitioning algorithm. InProceedings of the First Workshop on Algorithms and Data Structures, pages 379–391, 1991.
R. Bar-Yehuda and S. Fogel. Partitioning a sequence into few monotone subsequences. Technical Report 640, Department of Computer Science, Technion, Haifa, 1990.
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeynik. Ray shooting in polygons using geodesic triangulations. InICALP, pages 661–673, 1991.
B. Chazelle and L. Guibas. Visibility and intersection problems in plane geometry.Discrete & Computational Geometry, 4:551–581, 1989.
B. Chazelle, M. Sharir, and E. Welzl. Quasi-optimal upper bounds for simplex range searching and new zone theorems.Proceedings of the 6th Annual ACM Conference on Computational Geometry, pages 23–33, 1990.
B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension.Discrete & Computational Geometry, 4:467–489, 1989.
S. Cheng and R. Janardan. Space-efficient ray shooting and intersection searching: algorithms, dynamization, and applications.Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 7–16, January 1991.
M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal.Proceedings of the 7th Symposium on Computational Geometry, pages 51–60, 1991.
H. Edelsbrunner.Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1987.
H. Edelsbrunner and L. Guibas. Topological sweeping an arrangement.Journal of Computer and System Sciences, 38:165–194, 1989.
H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyper planes with applications.SIAM Journal on Computing, 15:341–363, 1986.
H. Edelsbrunner and E. Welzl. Halfplanar range search in linear space andO(n0.695) query time.Information Processing Letters, 23:289–293, 1986.
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, 1989.
D. Hausler and E. Welzl.ɛ-nets and simplex range queries.Discrete & Computational Geometry, 2:127–151, 1987.
J. Matousek. More on cutting arrangements and spanning trees with low crossing number. Technical Report B-90-2, Freie Universitat Berlin, February 1990.
J. Matoušek. Spanning trees with low crossing number.Informatique Theorique et Applications, 6(25): 103–123, 1991.
J. Matoušek and E. Welzl. Good splitters for counting points in triangles.Proceedings of the 5th Annual ACM Conference on Computational Geometry, pages 124–130, 1989.
M. Pellegrini. Stabbing and ray shooting in 3 dimensional space.Proceedings of the 6th Annual ACM Conference on Computational Geometry, pages 177–186, 1990.
H. Schipper and M. Overmars. Dynamic partition trees.BIT, 31(3):421–436, 1991.
D. E. Wilard. Polygon retrieval.SIAM Journal on Computing, 11:149–165, 1982.
Author information
Authors and Affiliations
Additional information
Communicated by Nimrod Megiddo.
This research was partially supported by the NY Metropolitan Research Fund. The second author is currently at IBM Haifa Research Group, Haifa 32000, Israel.
Rights and permissions
About this article
Cite this article
Bar-Yehuda, R., Fogel, S. Variations on ray shooting. Algorithmica 11, 133–145 (1994). https://doi.org/10.1007/BF01182772
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01182772