{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:00:21Z","timestamp":1777597221646,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424932","type":"print"},{"value":"9783540446767","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_23","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:43:15Z","timestamp":1179492195000},"page":"278-289","source":"Crossref","is-referenced-by-count":38,"title":["Smallest Color-Spanning Objects"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Abellanas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Icking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bel\u00e9n","family":"Palop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P. Agarwal","year":"1991","unstructured":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom., 6(5):407\u2013422, 1991.","journal-title":"Discrete Comput. Geom."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"A. Aggarwal, H. Imai, N. Katoh, and S. Suri. Finding k points with minimum diameter and related problems. J. Algorithms, 12:38\u201356, 1991.","journal-title":"J. Algorithms"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A. Datta","year":"1995","unstructured":"A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474\u2013503, 1995.","journal-title":"J. Algorithms"},{"key":"23_CR4","series-title":"Adv. Comput. Res.","first-page":"181","volume-title":"Computational Geometry","author":"D. P. Dobkin","year":"1983","unstructured":"D. P. Dobkin, R. L. Drysdale, III, and L. J. Guibas. Finding smallest polygons. In F. P. Preparata, editor, Computational Geometry, volume 1 of Adv. Comput. Res., pages 181\u2013214. JAI Press, Greenwich, Conn., 1983."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","volume":"4","author":"A. Efrat","year":"1994","unstructured":"A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theory Appl., 4:119\u2013136, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321\u2013350, 1994.","journal-title":"Discrete Comput. Geom."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, M. H. Overmars, G. Rote, and G. Woeginger. Finding minimum area k-gons. Discrete Comput. Geom., 7:45\u201358, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02574027","volume":"13","author":"J. Erickson","year":"1995","unstructured":"J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. Discrete Comput. Geom., 13:41\u201357, 1995.","journal-title":"Discrete Comput. Geom."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"A. Gajentaan and M. H. Overmars. On a class of O(n\n                           2\n                           ) problems in computational geometry. Comput. Geom. Theory Appl., 5:165\u2013185, 1995.","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR10","unstructured":"T. Graf and K. Hinrichs. Algorithms for proximity problems on colored point sets. In Proc. 5th Canad. Conf. Comput. Geom., pages 420\u2013425, 1993."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D. P. Huttenlocher","year":"1993","unstructured":"D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267\u2013291, 1993.","journal-title":"Discrete Comput. Geom."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"J. Matousek. On geometric optimization with few violated constraints. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 312\u2013321, 1994.","DOI":"10.1145\/177424.178039"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(94)00190-A","volume":"53","author":"J. Matousek","year":"1995","unstructured":"J. Matousek. On enclosing k points by a circle. Inform. Process. Lett., 53:217\u2013221, 1995.","journal-title":"Inform. Process. Lett."},{"key":"23_CR14","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 network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 633\u2013701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0925-7721(00)00021-3","volume":"17","author":"D.M. Mount","year":"2000","unstructured":"D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. Chromatic nearest neighbour searching: a query sensitive approach. Comput. Geom. Theory Appl., 17:97\u2013119, 2000.","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166\u2013204, 1981.","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR17","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, NY, 1985."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0190(97)00212-3","volume":"65","author":"M. Segal","year":"1998","unstructured":"M. Segal and K. Kedem. Enclosing k points in the smallest axis parallel rectangle. Inform. Process. Lett., 65:95\u201399, 1998.","journal-title":"Inform. Process. Lett."},{"key":"23_CR19","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995."},{"key":"23_CR20","volume-title":"Report MPI-I-92-152","author":"M. Smid","year":"1992","unstructured":"M. Smid. Finding k points with a smallest enclosing square. Report MPI-I-92-152, Max-Planck-Institut Inform., Saarbr\u00fccken, Germany, 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:13:26Z","timestamp":1550326406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}