{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:01Z","timestamp":1742596801633,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_259","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:14Z","timestamp":1330257974000},"page":"325-336","source":"Crossref","is-referenced-by-count":3,"title":["Computing the smallest k-enclosing circle and related problems"],"prefix":"10.1007","author":[{"given":"Alon","family":"Efrat","sequence":"first","affiliation":[]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"Alon","family":"Ziv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"31_CR1","unstructured":"P. Agarwal, M. Sharir, and S. Toledo. New applications of parametric searching in computational geometry, to appear in J. Algorithms, 1993."},{"key":"31_CR2","unstructured":"P. K. Agarwal and J. Matou\u0161ek. Dynamic half-space range reporting and its applications, manuscript, 1992."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, H. Imai, N. Katoh, and S. Suri. Finding k points with minimum diameter and related problems. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 283\u2013291, 1989.","DOI":"10.1145\/73833.73865"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di. Sorting in c log n parallel steps. Combinatorica, 3:1\u201319, 1983.","journal-title":"Combinatorica"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"L. P. Chew and K. Kedem. Improvements on geometric pattern matching problems. In Proc. 3rd Scand. Workshop Algorithm Theory, volume 621 of Lecture Notes in Computer Science, pages 318\u2013325. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55706-7_28"},{"key":"31_CR6","first-page":"200","volume":"31","author":"R. Cole","year":"1984","unstructured":"R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 31:200\u2013208, 1984.","journal-title":"J. ACM"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317\u2013340, 1986.","journal-title":"SIAM J. Comput."},{"key":"31_CR8","unstructured":"D. Eppstein. New algorithms for minimum area k-gons. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 83\u201388, 1992."},{"key":"31_CR9","unstructured":"T. C. Kao and D. M. Mount. An algorithm for computing compacted Voronoi diagrams defined by convex distance functions. In Proc. 3rd Canad. Conf. Comput. Geom., pages 104\u2013109, 1991."},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59\u201371, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"H.-P. Lenhof and M. Smid. Enumerating the k closest pairs optimally. In Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci., pages 380\u2013386, 1992.","DOI":"10.1109\/SFCS.1992.267752"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D. Leven","year":"1987","unstructured":"D. Leven and M. Sharir. Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams. Discrete Comput. Geom., 2:9\u201331, 1987.","journal-title":"Discrete Comput. Geom."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30:852\u2013865, 1983.","journal-title":"J. ACM"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comput., 12:759\u2013776, 1983.","journal-title":"SIAM J. Comput."},{"key":"31_CR15","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":"31_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","volume":"1","author":"R. Seidel","year":"1991","unstructured":"R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1:51\u201364, 1991.","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M. Sharir","year":"1991","unstructured":"M. Sharir. On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom., 6:593\u2013613, 1991.","journal-title":"Discrete Comput. Geom."},{"key":"31_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C. K. Yap","year":"1987","unstructured":"C. K. Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom., 2:365\u2013393, 1987.","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_259.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:00:08Z","timestamp":1742594408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_259","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}