{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:56:55Z","timestamp":1743073015757,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_18","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T06:13:18Z","timestamp":1385014398000},"page":"202-213","source":"Crossref","is-referenced-by-count":1,"title":["On Some Proximity Problems of Colored Sets"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer, New York (1985)"},{"key":"18_CR2","unstructured":"Shamos, M.I.: Computational geometry, Ph.D. thesis, Yale University (1978)"},{"key":"18_CR3","doi-asserted-by":"publisher","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\u00a034, 75\u201380 (1980)","journal-title":"Archiv der Mathematik"},{"key":"18_CR4","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: Proc. MELECON 1983 (1983)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 101\u2013115 (1989)","DOI":"10.1007\/BF02187718"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 203\u2013210 (1990)","DOI":"10.1145\/98524.98567"},{"issue":"1","key":"18_CR7","first-page":"343","volume":"6","author":"A. Rex","year":"1991","unstructured":"Rex, A.: Dwyer, Higher-dimensional voronoi diagrams in linear expected time. Discrete Comput. Geom.\u00a06(1), 343\u2013367 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: An optimal convex hull algorithm and new results on cuttings. In: Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 29\u201338 (1991)","DOI":"10.1109\/SFCS.1991.185345"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"P.K. Agarwal","year":"1992","unstructured":"Agarwal, P.K., Matousek, J., Suri, S.: Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. Theory Appl.\u00a01(4), 189\u2013201 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR10","doi-asserted-by":"publisher","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\u00a042, 55\u201360 (1992)","journal-title":"Information Processing Letters"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. 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. Assoc. Comput. Mach.\u00a042, 67\u201390 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/PL00009327","volume":"18","author":"T.M. Chan","year":"1997","unstructured":"Chan, T.M., Snoeyink, J., Yap, C.-K., Dividing, P., Pruning, D.: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discrete Comput. Geom.\u00a018(4), 433\u2013454 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00454-001-0029-8","volume":"26","author":"E.A. Ramos","year":"2001","unstructured":"Ramos, E.A.: An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. Discrete Comput. Geom.\u00a026, 233\u2013244 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"18_CR14","doi-asserted-by":"publisher","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\u00a012(6), 489\u2013509 (2002)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Guha, S.: Extreme Distances in Multicolored Point Sets. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS 2002, Part III. LNCS, vol.\u00a02331, pp. 14\u201325. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-47789-6_2"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Snoeyink, J.: Point location. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. ch. 34 (2004)","DOI":"10.1201\/9781420035315.pt4"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(02)00431-0","volume":"296","author":"O. Cheong","year":"2003","unstructured":"Cheong, O., Shin, C.S., Vigneron, A.: Computing farthest neighbors on a convex polytope. Theor. Comput. Sci.\u00a0296(1), 47\u201358 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"18_CR18","doi-asserted-by":"publisher","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.\u00a035(5), 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-73951-7_39","volume-title":"Algorithms and Data Structures","author":"M. L\u00f6ffler","year":"2007","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 446\u2013457. Springer, Heidelberg (2007)"},{"key":"18_CR20","unstructured":"Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, 3rd edn. Springer (2008)"},{"key":"18_CR21","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: Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE 2009), pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Chen, Y., Shen, S., Gu, Y., Hui, M., Li, F., Liu, C., Liu, L., Ooi, B.C., Yang, X., Zhang, D., Zhou, Y.: MarcoPolo: A community system for sharing and integrating travel information on maps. In: Proceedings of the 12th International Conference on Extending Database Technology (EDBT 2009), pp. 1148\u20131151 (2009)","DOI":"10.1145\/1516360.1516500"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14553-7_27","volume-title":"Frontiers in Algorithmics","author":"R. Fleischer","year":"2010","unstructured":"Fleischer, R., Xu, X.: Computing Minimum Diameter Color-Spanning Sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 285\u2013292. Springer, Heidelberg (2010)"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"C. Fan","year":"2013","unstructured":"Fan, C., Ju, W., Luo, J., Zhu, B.: On Some Geometric Problems of Color-Spanning Sets. Journal of Combinatorial Optimization\u00a026(2), 266\u2013283 (2013)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T22:03:31Z","timestamp":1647468211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}