{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T10:32:41Z","timestamp":1673692361850},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p> Determining the best shape to fit a set of points is a fundamental problem in many areas of computer science. We present an algorithm to approximate the k-flat that best fits a set of n points with n - m outliers. This problem generalizes the smallest m-enclosing ball, infinite cylinder, and slab. Our algorithm gives an arbitrary constant factor approximation in O(n<jats:sup>k+2<\/jats:sup>\/m) time, regardless of the dimension of the point set. While our upper bound nearly matches the lower bound, the algorithm may not be feasible for large values of k. Fortunately, for some practical sets of inliers, we reduce the running time to O(n<jats:sup>k+2<\/jats:sup>\/m<jats:sup>k+1<\/jats:sup>), which is linear when m = \u03a9(n). <\/jats:p>","DOI":"10.1142\/s0218195911003809","type":"journal-article","created":{"date-parts":[[2011,11,4]],"date-time":"2011-11-04T10:59:47Z","timestamp":1320404387000},"page":"559-569","source":"Crossref","is-referenced-by-count":1,"title":["FITTING FLATS TO POINTS WITH OUTLIERS"],"prefix":"10.1142","volume":"21","author":[{"given":"GUILHERME D.","family":"DA FONSECA","sequence":"first","affiliation":[{"name":"Universidade Federal do Estado do Rio de Janeiro (UNIRIO), Rio de Janeiro, RJ, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9013-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009478"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000748"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.09.009"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.09.001"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1267-6"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195905001750"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00022-2"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1123-0"},{"key":"rf15","first-page":"269","volume":"32","author":"Har-Peled S.","journal-title":"Discr. Comput. Geom."},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2006.08.033"},{"key":"rf19","first-page":"170","volume":"27","author":"Sch\u00f6mer E.","journal-title":"Algorithmica"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195911003809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:17:08Z","timestamp":1565191028000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195911003809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":14,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1142\/S0218195911003809"],"URL":"https:\/\/doi.org\/10.1142\/s0218195911003809","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}