{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:12:05Z","timestamp":1764349925422},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T00:00:00Z","timestamp":1189555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00454-007-9013-2","type":"journal-article","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T16:25:21Z","timestamp":1189527921000},"page":"38-58","source":"Crossref","is-referenced-by-count":12,"title":["Robust Shape Fitting via Peeling and Grating Coresets"],"prefix":"10.1007","volume":"39","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,12]]},"reference":[{"key":"9013_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/B978-044482537-7\/50003-6","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp.\u00a049\u2013119. Elsevier, Amsterdam (2000)"},{"key":"9013_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Yu, H.: A space-optimal data-stream algorithm for coresets in the plane. In: Proc. 23rd Annu. Sympos. Comput. Geom., pp.\u00a01\u201310, 2007","DOI":"10.1145\/1247069.1247071"},{"key":"9013_CR3","first-page":"192","volume":"61","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Arge, L., Erickson, J., Franciosa, P., Vitter, J.S.: Efficient searching with linear constraints. J.\u00a0Comput. Sys. Sci. 61, 192\u2013216 (2000)","journal-title":"J.\u00a0Comput. Sys. Sci."},{"key":"9013_CR4","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s004540010062","volume":"24","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Aronov, B., Har-Peled, S., Sharir, M.: Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom. 24, 687\u2013705 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s00454-001-0039-6","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Aronov, B., Sharir, M.: Exact and approximation algorithms for minimum-width cylindrical shells. Discrete Comput. Geom. 26, 307\u2013320 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00454-001-0019-x","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Guibas, L.J., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR7","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J.\u00a0Assoc. Comput. Mach. 51, 606\u2013635 (2004)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9013_CR8","volume-title":"Combinatorial and Computational Geometry","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Geometric approximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. Math. Sci. Research Inst. Pub., Cambridge (2005)"},{"key":"9013_CR9","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pp.\u00a0886\u2013894, 2005"},{"key":"9013_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J.\u00a0Algorithms 38, 91\u2013109 (2001)","journal-title":"J.\u00a0Algorithms"},{"key":"9013_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J.\u00a0Algorithms 31, 1\u201328 (1999)","journal-title":"J.\u00a0Algorithms"},{"key":"9013_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1142\/S0218195902000748","volume":"12","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M.: Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. Int. J. Comput. Geom. Appl. 12, 67\u201385 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9013_CR13","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Low-dimensional linear programming with violations. SIAM J. Comput. 879\u2013893 (2005)","DOI":"10.1137\/S0097539703439404"},{"key":"9013_CR14","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T.M. Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. Theory Appl. 35, 20\u201335 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9013_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom. 9, 145\u2013158 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02187685","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Preparata, F.P.: Halfspace range search: an algorithmic application of k-sets. Discrete Comput. Geom. 1, 83\u201393 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR17","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT 25, 76\u201390 (1985)","journal-title":"BIT"},{"key":"9013_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0216005","volume":"16","author":"R. Cole","year":"1987","unstructured":"Cole, R., Sharir, M., Yap, C.K.: On k-hulls and related problems. SIAM J. Comput. 16, 61\u201377 (1987)","journal-title":"SIAM J. Comput."},{"key":"9013_CR19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S0097539703427963","volume":"33","author":"S. Har-Peled","year":"2004","unstructured":"Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM J. Comput. 33, 269\u2013285 (2004)","journal-title":"SIAM J. Comput."},{"key":"9013_CR20","unstructured":"http:\/\/www.cc.gatech.edu\/projects\/large_models\/ . Large geometric models archive"},{"key":"9013_CR21","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0220013","volume":"20","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Approximate levels in line arrangements. SIAM J. Comput. 20, 222\u2013227 (1991)","journal-title":"SIAM J. Comput."},{"key":"9013_CR22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J. Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365\u2013384 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9013_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)"},{"key":"9013_CR24","unstructured":"Yu, H., Agarwal, P.K., Poreddy, R., Varadarajan, K.R.: Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica (to appear)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9013-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-007-9013-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9013-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:33Z","timestamp":1559087253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-007-9013-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,12]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9013"],"URL":"https:\/\/doi.org\/10.1007\/s00454-007-9013-2","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,12]]}}}