{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:33:33Z","timestamp":1725496413245},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435945"},{"type":"electronic","value":"9783540477891"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47789-6_2","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T18:56:19Z","timestamp":1196448979000},"page":"14-25","source":"Crossref","is-referenced-by-count":2,"title":["Extreme Distances in Multicolored Point Sets"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Sumanta","family":"Guha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P. K. Agarwal","year":"1991","unstructured":"P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and Emo Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete & Computational Geometry, 6 (1991), 407\u2013422.","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"P. K. Agarwal","year":"1992","unstructured":"P. K. Agarwal, J. Matou\u0161ek and S. Suri, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, Computational Geometry: Theory and Applications, 1 (1992), 189\u2013201.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","volume":"42","author":"A. Aggarwal","year":"1992","unstructured":"A. Aggarwal, H. Edelsbrunner, P. Raghavan and P. Tiwari, Optimal time bounds for some proximity problems in the plane, Information Processing Letters, 42(1) (1992), 55\u201360.","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"J. L. Bentley and M. I. Shamos, Divide-and-conquer in multidimensional space, Proceedings of the 8-th Annual Symposium on Theory of Computing, 1976, 220\u2013230.","key":"2_CR4","DOI":"10.1145\/800113.803652"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/PL00009340","volume":"19","author":"S. N. Bespamyatnikh","year":"1998","unstructured":"S. N. Bespamyatnikh, An Optimal Algorithm for Closest-Pair Maintenance, Discrete & Computational Geometry, 19 (1998), 175\u2013195.","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0167-8655(83)90041-7","volume":"2","author":"B. K. Bhattacharya","year":"1983","unstructured":"B. K. Bhattacharya and G. T. Toussaint, Optimal algorithms for computing the minimum distance between two finite planar sets, Pattern Recognition Letters, 2 (1983), 79\u201382.","journal-title":"Pattern Recognition Letters"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0196-6774(83)90040-8","volume":"4","author":"B. K. Bhattacharya","year":"1983","unstructured":"B. K. Bhattacharya and G. T. Toussaint, Efficient algorithms for computing the maximum distance between two finite planar sets, Journal of Algorithms, 4 (1983), 121\u2013136.","journal-title":"Journal of Algorithms"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/103516.103518","volume":"38","author":"D. Dobkin","year":"1991","unstructured":"D. Dobkin and S. Suri, Maintenance of geometric extrema, Journal of the ACM, 38 (1991), 275\u2013298.","journal-title":"Journal of the ACM"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02574030","volume":"13","author":"D. Eppstein","year":"1995","unstructured":"D. Eppstein, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete & Computational Geometry, 13 (1995), 111\u2013122.","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"D. Eppstein, Spanning trees and spanners, in J.-R. Sack and J. Urrutia (Editors), Handbook of Computational Geometry, Elsevier, North-Holland, 2000, 425\u2013461."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-52921-7_91","volume-title":"Proceedings of the 1st Annual SIGAL International Symposium on Algorithms","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and M. Sharir, A hyperplane incidence problem with applications to counting distances, Proceedings of the 1st Annual SIGAL International Symposium on Algorithms, LNCS vol. 450, Springer Verlag, 1990, 419\u2013428."},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-63397-9_26","volume-title":"Proceedings of the 5th European Symposium on Algorithms","author":"D. Krznaric","year":"1997","unstructured":"D. Krznaric, C. Levcopoulos, Minimum spanning trees in d dimensions, Proceedings of the 5th European Symposium on Algorithms, LNCS vol. 1248, Springer Verlag, 1997, 341\u2013349."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"J. S. B. Mitchell","year":"2000","unstructured":"J. S. B. Mitchell, Geometric shortest paths and geometric optimization, in J.-R. Sack and J. Urrutia (Editors), Handbook of Computational Geometry, Elsevier, North-Holland, 2000, 633\u2013701."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01840396","volume":"5","author":"C. Monma","year":"1990","unstructured":"C. Monma, M. Paterson, S. Suri and F. Yao, Computing Euclidean maximum spanning trees, Algorithmica, 5 (1990), 407\u2013419.","journal-title":"Algorithmica"},{"unstructured":"J. Pach, Personal communication.","key":"2_CR15"},{"key":"2_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"J. Pach and P.K. Agarwal, Combinatorial Geometry, John Wiley, New York, 1995."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/0167-8655(93)90144-3","volume":"14","author":"J. M. Robert","year":"1993","unstructured":"J. M. Robert, Maximum distance between two sets of points in \n                      \n                        \n                      \n                      $$\n\\mathbb{R}^d \n$$\n                    , Pattern Recognition Letters, 14 (1993), 733\u2013735.","journal-title":"Pattern Recognition Letters"},{"doi-asserted-by":"crossref","unstructured":"G. Robins and J. S. Salowe, On the Maximum Degree of Minimum Spanning Trees, Proceedings of the 10-th Annual ACM Symposium on Computational Geometry, 1994, 250\u2013258.","key":"2_CR18","DOI":"10.1145\/177424.177978"},{"doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, Closest-point problems, Proceedings of the 16-th Annual IEEE Symposium on Foundations of Computer Science, 1975, 151\u2013162.","key":"2_CR19","DOI":"10.1109\/SFCS.1975.8"},{"unstructured":"G. Toth, Personal communication.","key":"2_CR20"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-8655(82)90046-0","volume":"1","author":"G. T. Toussaint","year":"1982","unstructured":"G. T. Toussaint and M. A. McAlear, A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets, Pattern Recognition Letters, 1 (1982), 21\u201324.","journal-title":"Pattern Recognition Letters"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P. M. Vaidya","year":"1989","unstructured":"P. M. Vaidya, Geometry helps in matching, SIAM Journal on Computing, 18 (1989), 1201\u20131225.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P. Valtr","year":"1998","unstructured":"P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete & Computational Geometry, 19(3) (1998), 461\u2013469.","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47789-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T01:39:04Z","timestamp":1551145144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47789-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435945","9783540477891"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-47789-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}