How to get close to the median shape

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 402-410

  Har Peled, Sariel ^a  

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

Author keywords

Approximation; Shape fitting

Indexed keywords

ALGORITHMS; CURVE FITTING; FUNCTIONS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

LI FITTING; SHAPE FITTING; SUBQUADRATIC ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 33748051724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137915     Document Type: Conference Paper

References (19)

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