{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:04Z","timestamp":1761621184642},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11390-014-1475-0","type":"journal-article","created":{"date-parts":[[2014,9,21]],"date-time":"2014-09-21T09:42:35Z","timestamp":1411292555000},"page":"879-886","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Some Proximity Problems of Colored Sets"],"prefix":"10.1007","volume":"29","author":[{"given":"Cheng-Lin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Cheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fa-Rong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,12]]},"reference":[{"key":"1475_CR1","unstructured":"Shamos M I. Computational geometry [Ph.D. Thesis]. Yale University, 1978."},{"key":"1475_CR2","unstructured":"Toussaint G. Solving geometric problems with the rotating calipers. In Proc. MELECON, May 1983."},{"key":"1475_CR3","unstructured":"Preparata F P, Shamos M I. Computational Geometry: An Introduction. New York, NY, USA: Springer-Verlag, 1985."},{"issue":"6","key":"1475_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1142\/S0218195902001006","volume":"12","author":"G Malandain","year":"2002","unstructured":"Malandain G, Boissonnat J. Computing the diameter of a point set. International Journal of Computational Geometry and Applications, 2002, 12(6): 489\u2013509.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"1475_CR5","doi-asserted-by":"crossref","unstructured":"Kreveld M V, L\u00f6ffler M. Largest bounding box, smallest diameter, and related problems on imprecise points. In Proc. the 10th WADS, Aug. 2007, pp.446\u2013457.","DOI":"10.1007\/978-3-540-73951-7_39"},{"key":"1475_CR6","doi-asserted-by":"crossref","unstructured":"Kamousi P, Chan T M, Suri S. Stochastic minimum spanning trees in Euclidean spaces. In Proc. the 27th Annual ACM Symp. Computational Geometry, June 2011, pp.65\u201374.","DOI":"10.1145\/1998196.1998206"},{"key":"1475_CR7","doi-asserted-by":"crossref","unstructured":"Agarwal P K, Efrat A, Sankararaman S et al. Nearest-neighbor searching under uncertainty. In Proc. the 31st Symp. Principles of Database Systems, May 2012, pp.225\u2013236.","DOI":"10.1145\/2213556.2213588"},{"key":"1475_CR8","doi-asserted-by":"crossref","unstructured":"Suri S, Verbeek K, Yildiz H. On the most likely convex hull of uncertain points. In Proc. the 21st European Symp. Algorithms, Sept. 2013, pp.791\u2013802.","DOI":"10.1007\/978-3-642-40450-4_67"},{"key":"1475_CR9","doi-asserted-by":"crossref","unstructured":"Zhang D, Chee Y M, Mondal A, Tung A K H, Kitsuregawa M. Keyword search in spatial databases: Towards searching by document. In Proc. the 25th IEEE International Conference on Data Engineering, Mar. 29-Apr. 2, 2009, pp.688\u2013699.","DOI":"10.1109\/ICDE.2009.77"},{"key":"1475_CR10","doi-asserted-by":"crossref","unstructured":"Chen Y, Chen S, Gu Y et al. MarcoPolo: A community system for sharing and integrating travel information on maps.In Proc. the 12th EDBT, Mar. 2009, pp.1148\u20131151.","DOI":"10.1145\/1516360.1516500"},{"key":"1475_CR11","doi-asserted-by":"crossref","unstructured":"Fleischer R, Xu X. Computing minimum diameter color-spanning sets. In Proc. the 4th FAW, Aug. 2010, pp.285\u2013292.","DOI":"10.1007\/978-3-642-14553-7_27"},{"issue":"2","key":"1475_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"W Ju","year":"2013","unstructured":"Ju W, Fan C, Luo J, Zhu B, Daescu O. On some geometric problems of color-spanning sets. Journal of Combinatorial Optimization, 2013, 26(2): 266\u2013283.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"1475_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya P M. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 1989, 4(2): 101\u2013115.","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"1475_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"PK Agarwal","year":"1992","unstructured":"Agarwal P K, Matousek J, Suri S. Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Computational Geometry, 1992, 1(4): 189\u2013201.","journal-title":"Computational Geometry"},{"key":"1475_CR15","unstructured":"Cheong O, Shin C S, Vigneron A. Computing farthest neighbors on a convex polytope. Theor. Comput. Sci.: Computing and Combinatorics, 2003, 296(1): 47\u201358."},{"key":"1475_CR16","doi-asserted-by":"crossref","unstructured":"Agarwal P K, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. In Proc. the 6th SoCG, June 1990, pp.203\u2013210.","DOI":"10.1145\/98524.98567"},{"key":"1475_CR17","doi-asserted-by":"crossref","unstructured":"Dumitrescu A, Guha S. Extreme distances in multicolored point sets. In Proc. Int. Conf. Computational Science, Part III, April 2002, pp.14\u201325.","DOI":"10.1007\/3-540-47789-6_2"},{"issue":"2","key":"1475_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00454-001-0029-8","volume":"26","author":"EA Ramos","year":"2001","unstructured":"Ramos E A. An optimal deterministic algorithm for computing the diameter of a three-dimensional point set. Discrete and Computational Geometry, 2001, 26(2): 233\u2013244.","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"1475_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","volume":"42","author":"A Aggarwal","year":"1992","unstructured":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane. Information Processing Letters, 1992, 42(1): 55\u201360.","journal-title":"Information Processing Letters"},{"key":"1475_CR20","doi-asserted-by":"crossref","unstructured":"de Berg M, Cheong O, van Kreveld M, Overmars M. Computational Geometry (3rd edition), Springer-Verlag, 2008.","DOI":"10.1007\/978-3-540-77974-2"},{"key":"1475_CR21","doi-asserted-by":"crossref","unstructured":"Snoeyink J. Point location. In Handbook of Discrete and Computational Geometry (2nd edition), Goodman J E, O'Rourke J (eds.), 2004, pp.559\u2013574.","DOI":"10.1201\/9781420035315.pt4"},{"key":"1475_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01224932","volume":"34","author":"V Klee","year":"1980","unstructured":"Klee V. On the complexity of d-dimensional Voronoi diagrams. Archiv der Mathematik, 1980, 34: 75\u201380.","journal-title":"Archiv der Mathematik"},{"key":"1475_CR23","doi-asserted-by":"crossref","unstructured":"Chazelle B. An optimal convex hull algorithm and new results on cuttings. In Proc. the 32nd Annu. IEEE Symp. Foundation of Computer Science, Oct. 1991, pp.29\u201338.","DOI":"10.1109\/SFCS.1991.185345"},{"issue":"1","key":"1475_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02574694","volume":"6","author":"RA Dwyer","year":"1991","unstructured":"Dwyer R A. Higher-dimensional Voronoi diagrams in linear expected time. Discrete & Computational Geometry, 1991, 6(1): 343\u2013367.","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"1475_CR25","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/PL00009327","volume":"18","author":"TM Chan","year":"1997","unstructured":"Chan T M, Snoeyink J, Yap C K. Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams. Discrete & Computational Geometry, 1997, 18(4): 433\u2013454.","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"1475_CR26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"PB Callahan","year":"1995","unstructured":"Callahan P B, Kosaraju S R. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 1995, 42(1): 67\u201390.","journal-title":"J. ACM"},{"issue":"5","key":"1475_CR27","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled S, Mendel M. Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput., 2006, 35(5): 1148\u20131184.","journal-title":"SIAM J. Comput."},{"key":"1475_CR28","doi-asserted-by":"crossref","unstructured":"Har-Peled S. Geometric Approximation Algorithms. American Mathematical Society, 2011.","DOI":"10.1090\/surv\/173"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-014-1475-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-014-1475-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-014-1475-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,17]],"date-time":"2022-04-17T13:50:46Z","timestamp":1650203446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-014-1475-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["1475"],"URL":"https:\/\/doi.org\/10.1007\/s11390-014-1475-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}