Shape fitting with outliers

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 29-38

  Har Peled, Sariel ^a   Wang, Yusu ^b  

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

^b Duke University   (United States)

Author keywords

Approximation; Outliers; Shape fitting

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

SHAPE FITTING;

COMPUTATIONAL GEOMETRY;

EID: 0038714886     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777798     Document Type: Conference Paper

References (22)

1. 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.
2. P. K. Agarwal, A. Efrat, and M. Sharir. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput., 29:912-953, 1999.
3. P. K. Agarwal and S. Har-Peled. Maintaining the approximate extent measures of moving points. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 148-157, 2001.
4. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. http://valis.cs.uiuc.edu/.edu/̃sariel/research/ papers/01/fitting/, 2002.
5. P. K. Agarwal and J. Matoušek. On range searching with semialgebraic sets. Discrete Comput. Geom., 11:393-418, 1994.
6. N. Alon and J. H. Spencer. The probabilistic method. Wiley Inter-Science, 2nd edition, 2000.
7. 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.
8. T. M. Chan. Low-dimensional linear programming with violations. In Proc. 43th Annu. IEEE Sympos. Found. Comput. Sci., 2002. to appear.
9. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 642-651, 2001.
10. B. Chazelle. The Discrepancy Method. Cambridge University Press, 2000.
11. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
12. A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474-503, 1995.
13. J. Dunagan and S. Vempala. Optimal outlier removal in high-dimensional spaces. In Proc. 33rd Annu. ACM Sympos. Theory Comput., pages 627-636, 2001.
14. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321-350, 1994.
15. J. Erickson. New lower bounds for convex hull problems in odd dimensions. SIAM J. Comput., 28:1198-1214, 1999.
16. J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. Discrete Comput. Geom., 13:41-57, 1995.
17. 2 for moving points. menuscript, 2002.
18. 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.
19. S. Har-Peled and Y. Wang. Shape fitting with outliers http://ww.uiuc.edu/̃sariel/research/papers/02/outliers/, 2002.
20. J. Matoušek. On enclosing k points by a circle. Inform. Process. Lett., 53:217-221, 1995.
21. J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.
22. J. Matoušek. On constants for cuttings in the plane. Discrete Comput. Geom., 20:427-448, 1998.