{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T17:04:42Z","timestamp":1744823082111},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1007\/bf01377181","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T23:41:34Z","timestamp":1112398894000},"page":"18-29","source":"Crossref","is-referenced-by-count":14,"title":["An optimal algorithm for the on-line closest-pair problem"],"prefix":"10.1007","volume":"12","author":[{"given":"C.","family":"Schwarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"J. L. Bentley and M. I. Shamos. Divide-and-conquer in multidimensional space.Proc. 8th Annual ACM Symp. on Theory of Computing, 1976, pp. 220?230.","DOI":"10.1145\/800113.803652"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle. A theorem on polygon cutting with applications.Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science, 1982, pp. 339?349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson and R. S. Drysdale. Enumeratingk distances forn points in the plane.Proc. 7th ACM Symp. on Computational Geometry, 1991, pp. 234?238.","DOI":"10.1145\/109648.109674"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons.Algorithmica 2 (1987), 209?233.","journal-title":"Algorithmica"},{"key":"CR5","volume-title":"Report No. STAN-CS-87-1163","author":"J. Hershberger","year":"1987","unstructured":"J. Hershberger. Efficient Algorithms for Shortest Path and Visibility Problems. Report No. STAN-CS-87-1163, Stanford University, Stanford, CA, 1987."},{"key":"CR6","volume-title":"Lecture Notes in Computer Science, Vol. 156","author":"M. H. Overmars","year":"1983","unstructured":"M. H. Overmars.The Design of Dynamic Data Structures. Lecture Notes in Computer Science, Vol. 156. Springer-Verlag, Berlin, 1983."},{"key":"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 and M. I. Shamos.Computational Geometry, An Introduction. Springer-Verlag, New York, 1985."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0218195992000044","volume":"2","author":"J. S. Salowe","year":"1992","unstructured":"J. S. Salowe. Enumerating interdistances in space.Internat. J. Comput. Geom. Appl. 2 (1992), 49?59.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"C. Schwarz and M. Smid. AnO(n logn log logn) algorithm for the on-line closest pair problem.Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 280?285.","DOI":"10.1145\/142675.142742"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey. Closest-point problems.Proc. 16th Annual IEEE Symp. on Foundations of Computer Science, 1975, pp. 151?162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"CR11","first-page":"33","volume":"2","author":"M. Smid","year":"1991","unstructured":"M. Smid. Maintaining the minimal distance of a point set in less than linear time.Algorithms Rev. 2 (1991), 33?44.","journal-title":"Algorithms Rev."},{"key":"CR12","first-page":"364","volume-title":"Lecture Notes in Computer Science, Vol. 557","author":"M. Smid","year":"1991","unstructured":"M. Smid. Rectangular point location and the dynamic closest pair problem. Proc. 2nd Annual Internat. Symp. on Algorithms. Lecture Notes in Computer Science, Vol. 557. Springer-Verlag, Berlin, 1991, pp. 364?374."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF02187852","volume":"7","author":"M. Smid","year":"1992","unstructured":"M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time.Discrete Comput. Geom. 7 (1992), 415?431.","journal-title":"Discrete Comput. Geom."},{"key":"CR14","unstructured":"K. J. Supowit. New techniques for some dynamic closest-point and farthest-point problems.Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 84?90."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. M. Vaidya","year":"1989","unstructured":"P. M. Vaidya. AnO(n logn) algorithm for the all-nearest-neighbors problem.Discrete Comput. Geom. 4 (1989), 101?115.","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01377181.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01377181\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01377181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:18:19Z","timestamp":1586189899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01377181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["BF01377181"],"URL":"https:\/\/doi.org\/10.1007\/bf01377181","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}