{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:04Z","timestamp":1725663784813},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_261","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:55Z","timestamp":1330257955000},"page":"349-360","source":"Crossref","is-referenced-by-count":4,"title":["A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Graf","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Hinrichs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"unstructured":"F. Bartling, Th. Graf, K. Hinrichs: A plane sweep algorithm for finding a closest pair among convex planar objects, Preprints Angewandte Mathematik und Informatik, Universit\u00e4t M\u00fcnster, Bericht Nr. 1\/93-1.","key":"33_CR1"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science 577","first-page":"221","volume-title":"STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science","author":"F. Bartling","year":"1992","unstructured":"F. Bartling, K. Hinrichs: A plane-sweep algorithm for finding a closest pair among convex planar objects, A. Finkel, M. Jantzen (eds.), STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577, 221\u2013232, Springer-Verlag, Berlin, 1992."},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C28","author":"J.L. Bentley","year":"1979","unstructured":"J.L. Bentley and T. Ottmann, Algorithms for reporting and counting intersections, IEEE Transactions on Computers C28, 643\u2013647 (1979).","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","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, 34(1), 1\u201327 (1987).","journal-title":"Journal of the ACM"},{"issue":"12","key":"33_CR5","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":"33_CR6","doi-asserted-by":"publisher","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":"33_CR7","doi-asserted-by":"publisher","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":"33_CR8","volume-title":"Report 92\/2","author":"P.-O. Fj\u00e4llstr\u00f6m","year":"1992","unstructured":"P.-O. Fj\u00e4llstr\u00f6m. J.Katajainen, J. Petersson: Algorithms for the all-nearest-neighbors problem, Report 92\/2, Dept. of Computer Science, University of Copenhagen, Denmark, 1992."},{"issue":"4","key":"33_CR9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01178779","volume":"29","author":"K. Hinrichs","year":"1992","unstructured":"K.Hinrichs, J.Nievergelt, P.Schorn: An all-round algorithm for 2-dimensional nearest-neighbor problems, Acta Informatics, 29(4), 383\u2013394 (1992).","journal-title":"Acta Informatics"},{"key":"33_CR10","volume-title":"PhD Dissertation No. 9519","author":"P. Schorn","year":"1991","unstructured":"P. Schorn: Robust algorithms in a program library for geometric computation, PhD Dissertation No. 9519, ETH Z\u00fcrich, Switzerland, 1991"},{"doi-asserted-by":"crossref","unstructured":"M.Shamos, D.Hoey: Closest-point problems, Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, 151\u2013162 (1975).","key":"33_CR11","DOI":"10.1109\/SFCS.1975.8"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. Vaidya","year":"1989","unstructured":"P.Vaidya: An O(n log n) algorithm for the all-nearest-neighbours-problem, Discrete & Computational Geometry, 4, 101\u2013115 (1989).","journal-title":"Discrete & Computational Geometry"},{"key":"33_CR13","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","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_261.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:41Z","timestamp":1619571521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_261","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}