{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:23Z","timestamp":1725663383162},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:33:20Z","timestamp":1330202000000},"page":"442-457","source":"Crossref","is-referenced-by-count":1,"title":["A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"unstructured":"G. B. Beretta: An implementation of a plane-sweep algorithm on a personal computer, Ph. D. Thesis Nr. 7538, ETH Zurich, 1984.","key":"31_CR1"},{"doi-asserted-by":"crossref","unstructured":"S. Fortune: A Sweepline Algorithm for Voronoi Diagrams, Proc. 2nd Ann. Symp. on Computational Geometry, ACM, 313\u2013322, 1986.","key":"31_CR2","DOI":"10.1145\/10515.10549"},{"doi-asserted-by":"crossref","unstructured":"M. Shamos, D. Hoey: Closest-Point Problems, 16th Annual IEEE Symposium on Foundations of Computer Science, 151\u2013162 (1975).","key":"31_CR3","DOI":"10.1109\/SFCS.1975.8"},{"doi-asserted-by":"crossref","unstructured":"M. Shamos, D. Hoey: Geometric intersection problems, 17th Annual IEEE Symposium on Foundations of Computer Science, 208\u2013215 (1976).","key":"31_CR4","DOI":"10.1109\/SFCS.1976.16"},{"doi-asserted-by":"crossref","unstructured":"P. Vaidya: An Optimal Algorithm for the All-Nearest-Neighbors Problem, Proc. 27th IEEE Symp. Foundations of Computer Science, 117\u2013122, 1986.","key":"31_CR5","DOI":"10.1109\/SFCS.1986.8"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:14Z","timestamp":1619571434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}