{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:15:08Z","timestamp":1769159708093,"version":"3.49.0"},"reference-count":15,"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf02187852","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:58:18Z","timestamp":1130576298000},"page":"415-431","source":"Crossref","is-referenced-by-count":17,"title":["Maintaining the minimal distance of a point set in polylogarithmic time"],"prefix":"10.1007","volume":"7","author":[{"given":"Michiel","family":"Smid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,6]]},"reference":[{"key":"BF02187852_CR1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon,Discrete Comput. Geom. 4 (1989), 591\u2013604.","journal-title":"Discrete Comput. Geom."},{"key":"BF02187852_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","volume":"11","author":"N. Blum","year":"1980","unstructured":"N. Blum and K. Mehlhorn, On the average number of rebalancing operations in weight-balanced trees,Theoret. Comput. Sci. 11 (1980), 303\u2013320.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02187852_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L. J. Guibas, Fractional cascading I: A data structuring technique,Algorithmica 1 (1986), 133\u2013162.","journal-title":"Algorithmica"},{"key":"BF02187852_CR4","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson and R. S. Drysdale, Enumeratingk distances forn points in the plane,Proc. 7th ACM Symp. on Comp. Geom., 1991 (to appear).","DOI":"10.1145\/109648.109674"},{"key":"BF02187852_CR5","doi-asserted-by":"crossref","unstructured":"D. Dobkin and S. Suri, Dynamically computing the maxima of decomposable functions, with applications,Proc. 30th Annual IEEE Symp. on Foundations of Computer Science, 1989, pp. 488\u2013493.","DOI":"10.1109\/SFCS.1989.63523"},{"key":"BF02187852_CR6","volume-title":"Data Structures and Algorithms, Volume 1:Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn,Data Structures and Algorithms, Volume 1:Sorting and Searching, Springer-Verlag, Berlin, 1984."},{"key":"BF02187852_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and S. N\u00e4her, Dynamic fractional cascading,Algorithmica 5 (1990), 215\u2013241.","journal-title":"Algorithmica"},{"key":"BF02187852_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","volume":"2","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars. Dynamization of order decomposable set problems.J. Algorithms 2 (1981), 245\u2013260.","journal-title":"J. Algorithms"},{"key":"BF02187852_CR9","volume-title":"The Design of Dynamic Data Structures","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":"BF02187852_CR10","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":"BF02187852_CR11","doi-asserted-by":"crossref","unstructured":"J. S. Salowe, Shallow interdistance selection and interdistance enumeration, Manuscript, 1991.","DOI":"10.1007\/BFb0028255"},{"key":"BF02187852_CR12","unstructured":"M. Smid, A worst-case algorithm for semi-online updates on decomposable problems, Report A 03\/90, Fachbereich Informatik, Universit\u00e4t des Saarlandes, 1990."},{"key":"BF02187852_CR13","unstructured":"M. Smid, Maintaining the minimal distance of a point set in less than linear time, Report A 06\/90, Fachbereich Informatik, Universit\u00e4t des Saarlandes, 1990."},{"key":"BF02187852_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\u201390."},{"key":"BF02187852_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\u2013115.","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187852.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187852\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T15:22:21Z","timestamp":1586532141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF02187852"],"URL":"https:\/\/doi.org\/10.1007\/bf02187852","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}