High-dimensional shape fitting in linear time

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 39-47

  Har Peled, Sariel ^a   Varadarajan, Kasturi ^b  

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

^b University of Iowa   (United States)

Author keywords

Computational convexity; Projective clustering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING;

SHAPE FITTING;

COMPUTATIONAL GEOMETRY;

EID: 0038038333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777799     Document Type: Conference Paper

References (18)

1. M. Bǎdoiu and K. L. Clarkson. Optimal core-sets for balls. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, 801-802, 2003.
2. H. L. Bodlaender, P. Gritzmann, V. Klee, and J. van Leeuwen. The computational complexity of norm-maximization. Combinatorica, 10:203-225, 1990.
3. 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. 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. A. Brieden. On geometric optimization problems likely not contained in apx. to appear, 2002.
6. H. Edelsbrunner. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, 1987.
7. n. Mathematical Programming, 73:1-5, 1996.
8. P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program., 59:163-213, 1993.
9. 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. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, 2nd edition, 1988. 2nd edition 1994.
11. 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. 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. P. Kumar, J. S. B. Mitchell, and E. A. Yildirim. Fast smallest enclosing hypersphere computation. In Proc. 5th Workshop Algorithm Eng. Exper., 2003.
14. J. Matoušek. Lectures on Discrete Geometry. Springer, 2002.
15. N. Megiddo. On the complexity of some geometric problems in unbounded dimension. J. Symb. Comput., 10:327-334, 1990.
16. Y. Nesterov. Global quadratic optimization via conic relaxation. Technical report, Catholic University of Louvaine, Belgium, 1998.
17. A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic forms over intersection of ellipsoids with common center. Mathematical Programming, 86(3):463-473, 1999.
18. 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.