High-dimensional shape fitting in linear time

Discrete and Computational Geometry

Volumn 32, Issue 2, 2004, Pages 269-288

  Har Peled, Sariel ^a   Varadarajan, Kasturi R ^b  

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

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4344568025     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1118-2     Document Type: Conference Paper

References (20)

1. [BC] M. Bǎdoiu and K. L. Clarkson. Optimal core-sets for balls. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 801-802, 2003.
2. [BGKvL] H. L. Bodlaender, P. Gritzmann, V. Klee, and J. van Leeuwen. The computational complexity of norm-maximization. Combinatorial, 10:203-225, 1990.
3. [BH] 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.
4. [BHI] M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. 34th Annu. ACM Sympos. Theory Comput., pages 250-257, 2002.
5. [Br] A. Brieden. Geometric optimization problems likely not contained in APX. Discrete Compout. Geom., 28(2):201-209, 2002.
6. [Ed] H. Edelsbrunner. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, 1987.
7. n. Math. Programming, 73:1-5, 1996.
8. [GK1] P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Programming, 59:163-213, 1993.
9. [GK2] P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: I, containment problems. Discrete Math., 136:129-174, 1994.
10. [GLS] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1st edition, 1988; 2nd edition, 1994.
11. [HV1] S. Har-Peled and K. R. Varadarajan. Approximate shape fitting via linearization. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 66-73, 2001.
12. [HV2] S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 312-318, 2002.
13. [KMY] P. Kumar, J. S. B. Mitchell, and E. A. Yildirim. Fast smallest enclosing hypersphere computation. In Proc. 5th Workshop Algorithm Engrg. Exper., 2003.
14. [Man] O. L. Mangasarian. Nonlinear Programming. Classics in Applied Mathematics. SIAM, Philadelphia, PA, 1994.
15. [Mat] J. Matoušek. Lectures on Discrete Geometry. Springer-Verlag, Berlin, 2002.
16. [Me] N. Megiddo. On the complexity of some geometric problems in unbounded dimension. J. Symbolic Comput., 10:327-334, 1990.
17. [Ne] Y. Nesterov. Global quadratic optimization via conic relaxation. Technical report, Catholic University of Louvaine, Belgium, 1998.
18. [NRT] A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic forms over intersection of ellipsoids with common center. Math. Programming, 86(3):463-473, 1999.
19. [VVZ] K. R. Varadarajan, S. Venkatesh, and J. Zhang. Approximating the radii of point sets in high dimensions. In Proc. 43th Annu. IEEE Sympos. Found. Comput. Sci., 2002.
20. [YZ] Y. Ye and J. Zhang. An improved algorithm for approximating the radii of point sets. In Proc. APPROX, 2003.