{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:25:05Z","timestamp":1762874705546},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0020-0190(88)90150-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"255-261","source":"Crossref","is-referenced-by-count":26,"title":["Plane-sweep solves the closest pair problem elegantly"],"prefix":"10.1016","volume":"26","author":[{"given":"Klaus","family":"Hinrichs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurg","family":"Nievergelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90150-0_BIB1","first-page":"220","article-title":"Divide-and-conquer in multidimensional space","author":"Bentley","year":"1976","journal-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(88)90150-0_BIB2","first-page":"313","article-title":"A sweepline algorithm for Voronoi diagrams","author":"Fortune","year":"1986","journal-title":"Proc. 2nd Ann. ACM Symp. on Computational Geometry"},{"issue":"1","key":"10.1016\/0020-0190(88)90150-0_BIB3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(79)90085-1","article-title":"A note on Rabin's nearest-neighbor algorithm","volume":"8","author":"Fortune","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"10","key":"10.1016\/0020-0190(88)90150-0_BIB4","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90150-0_BIB5","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(88)90150-0_BIB6","series-title":"Algorithms and Complexity","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0020-0190(88)90150-0_BIB7","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975","journal-title":"Proc. 16th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(88)90150-0_BIB8","first-page":"208","article-title":"Geometric intersection problems","author":"Shamos","year":"1976","journal-title":"Proc. 17th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(88)90150-0_BIB9","first-page":"117","article-title":"An optimal algorithm for the all-nearest-neighbors problem","author":"Vaidya","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901500?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:53:16Z","timestamp":1555059196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0020019088901500"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90150-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}