Abstract
Let P be a simple polygon with n vertices. We present a simple decomposition scheme that partitions the interior of P into O(n) so-called geodesic triangles, so that any line segment interior to P crosses at most 2 log n of these triangles. This decomposition can be used to preprocess P in time O(n log n) and storage O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms are fairly simple and easy to implement. We also extend this technique to the case of ray-shooting amidst k polygonal obstacles with a total of n edges, so that a query can be answered in O(√klog n) time.
Work by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-89-21421. Work by Micha Sharir has been supported by ONR Grants N00014-89-J-3042 and N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, Proc. 5th ACM Symp. on Computational Geometry, 1989, 315–325.
B. Chazelle, A theorem on polygon cutting with applications, Proc. 23rd Annu. IEEE Sympos. Foundat. Comput. Sci., (1982), 339–349.
B. Chazelle, Triangulating a simple polygon in linear time, Proc. 31st Annu. IEEE Sympos. Foundat. Comput. Sci., (1990), 220–230. To appear in Discrete Comput. Geom. (1991).
B. Chazelle, H. Edelsbrunner and L. Guibas, The complexity of cutting complexes, Discrete Comput. Geom. 4 (1989), 139–181.
B. Chazelle and L. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica 1 (1986), 133–162.
B. Chazelle and L. Guibas, Fractional cascading: II. Applications, Algorithmica 1 (1986), 163–191.
B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551–581.
D. Dobkin and D. Kirkpatrick, Fast detection of polyhedral intersection, Theoretical Computer Science 27 (1983), 241–253.
H. Edelsbrunner, L. Guibas and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Computing 15 (1986), 317–340.
L. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. Computer Systems Sci. 39 (1989), 126–152.
L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987), 209–233.
D. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Computing 12 (1983), 28–35.
D.T. Lee and F. Preparata, Euclidean shortest path in the presence of rectilinear barriers, Networks 14 (1984), 393–410.
J. Matoušek, More on cutting arrangements and spanning trees with low stabbing number, Tech. Rept. B-90-2, Freie Universität Berlin, February 1990.
K. Mehlhorn, Data Structures and Algorithms, I: Sorting and Searching, Springer-Verlag, Heidelberg 1984.
F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer Verlag, Heidelberg 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chazelle, B. et al. (1991). Ray shooting in polygons using geodesic triangulations. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_172
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_172
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive