{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:10Z","timestamp":1787340550817,"version":"build-2736575974"},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,8]]},"abstract":"<jats:p>It is an open question in computational geometry as to whether there exists an $O(E\\log E + I)$ algorithm to determine the I intersections of a collection of E line segments in the plane. An approach utilizing a work list bubble sort and a distribution-based search is presented. The resulting algorithm has $O(E\\log E + I)$ expected time complexity. In the worst case the algorithm has the same complexity as the algorithm of Bentley and Ottmann [IEEE Trans. Comput., 28 (1979), pp. 643\u2013647]: $O(E\\log E + I\\log E)$. The algorithm requires only $O(E)$ space and in contrast to prior work, no restrictions are placed upon the nature of the intersections.<\/jats:p>","DOI":"10.1137\/0214046","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"625-637","source":"Crossref","is-referenced-by-count":9,"title":["An $O(E\\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem"],"prefix":"10.1137","volume":"14","author":[{"given":"Eugene W.","family":"Myers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,2]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90003-7"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675432"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Jon Louis Bentley, Michael Ian Shamos,  Divide-and-conquer in multidimensional space,  Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), Assoc. Comput. Mach., New York,  1976,  220\u2013230 55:138690365.68050","DOI":"10.1145\/800113.803652"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.6312179"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin, B. Chazelle,  Detection is easier than computation,  Proc. 12th ACM Symposium on Theory of Computing,  1980,  146\u2013153","DOI":"10.1145\/800141.804662"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90028-5"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90002-X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/965105.807480"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Leo J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts,  A new representation for linear lists,  Conference Record of the Ninth Annual ACM Symposium on Theory of Computing (Boulder, Colo., 1977), Assoc. Comput. Mach., New York,  1977,  49\u201360 57:4707","DOI":"10.1145\/800105.803395"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90143-X"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90011-9"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"M. H. Overmars, J. van Leeuwan,  Dynamically maintaining configurations in the plane,  Proc. 12th ACM Symposium on theory of Computing,  1980,  135\u2013145","DOI":"10.1145\/800141.804661"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0210035"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"B. K. Rosen,  Linear cost is sometimes quadratic,  Proc. 8th ACM Conference on Principles of Programming Languages,  1981,  117\u2013124","DOI":"10.1145\/567532.567545"},{"key":"R15","unstructured":"A. Schmitt,  H. J. Schneider, H.  Gotter,  Reporting intersections of line segments: An improvement of the Ottman-Bentley algorithm,  Proc. 8th Conference on Graph Theoretic Concepts in Computer Science, Carl Hanser Verlag, Munchen,  1982,  257\u2013266"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1145\/357290.357294"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos,  Geometric complexity,  Seventh Annual ACM Symposium on Theory of Computing (Albuquerque, N.M., 1975), Assoc. Comput. Mach., New York,  1975,  224\u2013233 57:46280357.68046","DOI":"10.1145\/800116.803772"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos, Dan Hoey,  Geometric intersection problems,  17th Annual Symposium on Foundations of Computer Science (Houston, Tex., 1976), IEEE Comput. Soc., Long Beach, Calif.,  1976,  208\u2013215 56:13770","DOI":"10.1109\/SFCS.1976.16"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/356625.356626"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90064-9"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:10Z","timestamp":1787337550000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["10.1137\/0214046"],"URL":"https:\/\/doi.org\/10.1137\/0214046","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}