How to get close to the median shape

Computational Geometry: Theory and Applications

Volumn 36, Issue 1, 2007, Pages 39-51

  Har Peled, Sariel ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation algorithms; Shape fitting

Indexed keywords

EID: 84867921047     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.02.003     Document Type: Conference Paper

References (18)

1. P.K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir Approximation exact algorithms for minimum-width annuli and shells Discrete Comput. Geom. 24 4 2000 687 705
2. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan Approximating extent measures of points J. Assoc. Comput. Mach. 51 4 2004 606 635
3. P. Agarwal, S. Har-Peled, H. Yu, Robust shape fitting via peeling and grating coresets, in: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, 2006, pp. 182-191
4. P.K. Agarwal, and J. Matoušek On range searching with semialgebraic sets Discrete Comput. Geom. 11 1994 393 418
5. G. Barequet, and S. Har-Peled Efficiently approximating the minimum-volume bounding box of a point set in three dimensions J. Algorithms 38 2001 91 109
6. T.M. Chan Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus Internat. J. Comput. Geom. Appl. 12 2 2002 67 85
7. ℓ 1 regression Proc. 16th ACM-SIAM Sympos. Discrete Algorithms Philadelphia, PA 2005 Society for Industrial and Applied Mathematics 257 266
8. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang Matrix approximation and projective clustering via volume sampling Proc. 17th ACM-SIAM Sympos. Discrete Algorithms New York 2006 ACM Press 1117 1126
9. A. Frieze, R. Kannan, and S. Vempala Fast Monte-Carlo algorithms for finding low-rank approximations J. Assoc. Comput. Mach. 51 6 2004 1025 1041
10. J. Gao, M. Langberg, L. Schulman, Analysis of incomplete data and an intrinsic-dimension Helly theorem, in: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, 2006, pp. 464-473
11. S. Har-Peled, V. Koltun, Separability with outliers, in: Proc. 16th Annu. Internat. Sympos. Algorithms Comput., 2005, pp. 28-39
12. S. Har-Peled, A. Kushal, Smaller coresets for k-median and k-means clustering, in: Proc. 21st Annu. ACM Sympos. Comput. Geom., 2005, pp. 126-134
13. S. Har-Peled, S. Mazumdar, Coresets for k-means and k-median clustering and their applications, in: Proc. 36th Annu. ACM Sympos. Theory Comput., 2004, pp. 291-300
14. S. Har-Peled, and Y. Wang Shape fitting with outliers SIAM J. Comput. 33 2 2004 269 285
15. J. O'Rourke Finding minimal enclosing boxes Internat. J. Comput. Inform. Sci. 14 1985 183 199
16. G.A.F. Seber, and C.J. Wild Nonlinear Regression 1989 John Wiley & Sons
17. l 1 linear approximation of points Proc. 4th Annu. ACM Sympos. Comput. Geom. 1988 ACM Press 352 361
18. Y. Zhou, and S. Suri Algorithms for a minimum volume enclosing simplex in three dimensions SIAM J. Comput. 31 5 2002 1339 1357