Shape fitting with outliers

SIAM Journal on Computing

Volumn 33, Issue 2, 2004, Pages 269-285

  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

APPROXIMATION; APPROXIMATION ALGORITHMS; OUTLIERS; SHAPE FITTING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER VISION; DATA MINING; SET THEORY;

PROBLEM SOLVING;

EID: 2342636412     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703427963     Document Type: Article

References (23)

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 (2000), pp. 687-705.
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 (1999), pp. 912-953.
3. P. K. AGARWAL AND S. HAR-PELED, Maintaining approximate extent measures of moving points, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 148-157.
4. P. K. AGARWAL, S. HAR-PELED, AND K. R. VARADARAJAN, Approximating extent measures of points, J. ACM, to appear.
5. P. K. AGARWAL AND J. MATOUŠEK, On range searching with semialgebraic sets, Discrete Comput. Geom., 11 (1994), pp. 393-418.
6. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley-Interscience, New York, 2000.
7. T. M. CHAN, Low-dimensional linear programming with violations, in Proceedings of the 43th Annual IEEE Symposium Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 2002, pp. 570-579.
8. M. CHARIKAR, S. KHULLER, D. M. MOUNT, AND G. NARASIMHAN, Algorithms for facility location problems with outliers, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 642-651.
9. B. CHAZELLE, The Discrepancy Method, Cambridge University Press, Cambridge, UK, 2000.
10. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
11. N. CRISTIANINI AND J. SHAW-TAYLOR, Support Vector Machines, Cambridge University Press, Cambridge, UK, 2000.
12. A. DATTA, H.-P. LENHOF, C. SCHWARZ, AND M. SMID, Static and dynamic algorithms for k-point clustering problems, J. Algorithms, 19 (1995), pp. 474-503.
13. R. O. DUDA, P. E. HART, AND D. G. STORK, Pattern Classification, 2nd ed., Wiley-Interscience, New York, 2001.
14. J. DUNAGAN AND S. VEMPALA, Optimal outlier removal in high-dimensional spaces, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2001, pp. 627-636.
15. D. EPPSTEIN AND J. ERICKSON, Iterated nearest neighbors and finding minimal polytopes, Discrete Comput. Geom., 11 (1994), pp. 321-350.
16. J. ERICKSON. New lower bounds for convex hull problems in odd dimensions, SIAM J. Comput., 28 (1999), pp. 1198-1214.
17. J. ERICKSON AND R. SEIDEL, Better lower bounds on detecting affine and spherical degeneracies, Discrete Comput. Geom., 13 (1995), pp. 41-57.
18. 2 for moving points.
19. S. HAR-PELED AND K. R. VARADARAJAN, Approximate shape fitting via linearization, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 66-73.
20. S. HAR-PELED AND Y. WANG, Shape fitting with outliers, www.uiuc.edu/~sariel/research/papers/02/outliers/, 2002.
21. J. MATOUŠEK, On enclosing k points by a circle. Inform. Process. Lett., 53 (1995), pp. 217-221.
22. J. MATOUŠEK, On geometric optimization with few violated constraints, Discrete Comput. Geom., 14 (1995), pp. 365-384.
23. K. MULMULEY, On levels in arrangements and Voronoi diagrams, Discrete Comput. Geom., 6 (1991), pp. 307-338.