{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:32Z","timestamp":1725663692295},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_186","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:53:42Z","timestamp":1330250022000},"page":"219-232","source":"Crossref","is-referenced-by-count":3,"title":["A plane-sweep algorithm for finding a closest pair among convex planar objects"],"prefix":"10.1007","author":[{"given":"Frank","family":"Bartling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Hinrichs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"No.1","key":"18_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle, D. P. Dobkin: Intersection of Convex Objects in Two and Three Dimensions, Journal of the ACM, Vol. 34, No. 1 (1987), 1\u201327.","journal-title":"Journal of the ACM"},{"issue":"12","key":"18_CR2","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TC.1983.1676186","volume":"32","author":"F. Chin","year":"1983","unstructured":"F. Chin, C. A. Wang: Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons, IEEE Trans. Comput. 32 (12), 1203\u20131207 (1983).","journal-title":"IEEE Trans. Comput."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner: Computing the Extreme Distances between two Convex Polygons, Journal of Algorithms 6, 213\u2013224 (1985).","journal-title":"Journal of Algorithms"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune: A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2, 153\u2013174 (1987).","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","volume":"26","author":"K. Hinrichs","year":"1988","unstructured":"K. Hinrichs, J. Nievergelt, P. Schorn: Plane-Sweep Solves the Closest Pair Problem Elegantly, Information Processing Letters 26, 255\u2013261 (1988).","journal-title":"Information Processing Letters"},{"issue":"4","key":"18_CR6","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee: Two-Dimensional Voronoi Diagrams in the Lp-metric, Journal of the ACM 27 (4), 604\u2013618 (1980).","journal-title":"Journal of the ACM"},{"key":"18_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata, M. I. Shamos: Computational Geometry: An Introduction, Springer-Verlag, Berlin, Heidelberg, New York, 1985."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"M. I. Shamos, D. Hoey: Geometric Intersection Problems, Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science, 208\u2013215 (1976).","DOI":"10.1109\/SFCS.1976.16"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","volume":"14","author":"M. Sharir","year":"1985","unstructured":"M. Sharir: Intersection and Closest-Pair Problems for a Set of Planar Discs, SIAM J. Comput. 14, 448\u2013468 (1985).","journal-title":"SIAM J. Comput."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C. K. Yap","year":"1987","unstructured":"C. K. Yap: An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments, Discrete Comput. Geometry 2, 365\u2013393 (1987).","journal-title":"Discrete Comput. Geometry"}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_186.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:21Z","timestamp":1619573301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_186","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}