{"date_published":"1991-06-20T00:00:00Z","quality_controlled":"1","doi":"10.1007/3-540-54233-7_172","month":"06","alternative_title":["LNCS"],"publication":"18th International Colloquium on Automata, Languages and Programming","intvolume":"       510","conference":{"end_date":"1991-07-12","start_date":"1991-07-08","name":"ICALP: Automata, Languages and Programming","location":"Madrid, Spain"},"scopus_import":"1","article_processing_charge":"No","date_updated":"2022-02-28T14:53:03Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","volume":510,"day":"20","oa_version":"None","abstract":[{"text":"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(radicklog n) time.","lang":"eng"}],"publisher":"Springer","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-54233-7_172"}],"author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Grigni, Michelangelo","first_name":"Michelangelo","last_name":"Grigni"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","first_name":"John","last_name":"Hershberger"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"full_name":"Snoeyink, Jack","last_name":"Snoeyink","first_name":"Jack"}],"extern":"1","acknowledgement":"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.","date_created":"2018-12-11T12:06:42Z","publist_id":"2066","_id":"4059","language":[{"iso":"eng"}],"type":"conference","page":"661 - 673","title":"Ray shooting in polygons using geodesic triangulations","year":"1991","status":"public","citation":{"ama":"Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: <i>18th International Colloquium on Automata, Languages and Programming</i>. Vol 510. Springer; 1991:661-673. doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>","apa":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &#38; Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations. In <i>18th International Colloquium on Automata, Languages and Programming</i> (Vol. 510, pp. 661–673). Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>","short":"B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.","mla":"Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” <i>18th International Colloquium on Automata, Languages and Programming</i>, vol. 510, Springer, 1991, pp. 661–73, doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>.","ista":"Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” In <i>18th International Colloquium on Automata, Languages and Programming</i>, 510:661–73. Springer, 1991. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>.","ieee":"B. Chazelle <i>et al.</i>, “Ray shooting in polygons using geodesic triangulations,” in <i>18th International Colloquium on Automata, Languages and Programming</i>, Madrid, Spain, 1991, vol. 510, pp. 661–673."}}