{"date_published":"1992-01-01T00:00:00Z","day":"01","publisher":"ACM","year":"1992","article_type":"original","oa_version":"None","issue":"1","title":"An optimal algorithm for intersecting line segments in the plane","scopus_import":"1","quality_controlled":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/147508.147511"}],"language":[{"iso":"eng"}],"intvolume":"        39","publist_id":"2078","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"1 - 54","status":"public","date_created":"2018-12-11T12:06:37Z","month":"01","citation":{"apa":"Chazelle, B., &#38; Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>","ista":"Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>. ACM, 1992. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>.","ieee":"B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” <i>Journal of the ACM</i>, vol. 39, no. 1. ACM, pp. 1–54, 1992.","short":"B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.","ama":"Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. 1992;39(1):1-54. doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>."},"article_processing_charge":"No","acknowledgement":"B, Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR 87-00917. H, Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the NSF under Grant CCR 87-14565. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for\r\nComputing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.","abstract":[{"lang":"eng","text":"The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used."}],"publication":"Journal of the ACM","publication_status":"published","doi":"10.1145/147508.147511","author":[{"first_name":"Bernard","full_name":"Chazelle, Bernard","last_name":"Chazelle"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"}],"_id":"4046","publication_identifier":{"issn":["0004-5411"],"eissn":["1557-735X"]},"type":"journal_article","extern":"1","volume":39,"date_updated":"2022-03-16T08:32:17Z"}