{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:07:00Z","timestamp":1648559220222},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf01178779","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:50:34Z","timestamp":1108659034000},"page":"383-394","source":"Crossref","is-referenced-by-count":8,"title":["An all-round sweep algorithm for 2-dimensional nearest-neighbor problems"],"prefix":"10.1007","volume":"29","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","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"[Fo 87] Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica2, 153?174 (1987)","journal-title":"Algorithmica"},{"key":"CR2","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/3-540-50728-0_62","volume-title":"Graph-theoretic concepts in computer science","author":"K. Hinrichs","year":"1989","unstructured":"[HNS 89] Hinrichs, K., Nievergelt, J., Schorn, P.: A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited 14-th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), Amsterdam., In: Leeuven, J. van (ed.) Graph-theoretic concepts in computer science (Lect. Notes Comput. Sci., Vol. 344, pp. 442?457) Berlin Heidelberg New York: Springer 1989"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"[Mi 89] Milenkovic, V.: Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic. 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 500?505","DOI":"10.1109\/SFCS.1989.63525"},{"key":"CR4","volume-title":"Robust algorithms in, a program library for geometric computation","author":"P. Schorn","year":"1991","unstructured":"[Sch 91] Schorn, P.: Robust algorithms in, a program library for geometric computation. PhD Dissertation No. 9519, ETH Zurich, Switzerland, 1991"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"[SH 75] Shamos, M., Hoey, D.: Closest-point problems. 16th Annual IEEE Symposium on Foundations of Computer Science, 1975, pp. 151?162","DOI":"10.1109\/SFCS.1975.8"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. Vaidya","year":"1989","unstructured":"[Va 89] Vaidya, P.: AO(n logn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom.4, 101?115 (1989)","journal-title":"Discrete Comput. Geom."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178779\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:22:15Z","timestamp":1586118135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01178779"],"URL":"https:\/\/doi.org\/10.1007\/bf01178779","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}