Separability with outliers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 28-39

  Har Peled, Sariel ^a   Koltun, Vladlen ^b  

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

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; ESTIMATION; GEOMETRY; OPTIMIZATION; PROBLEM SOLVING; STATISTICAL METHODS; THEOREM PROVING;

D DIMENSIONAL SPACES; EXTENT MEASURES; GEOMETRIC PROBLEMS; OUTLIERS;

ALGORITHMS;

EID: 33744956907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_5     Document Type: Conference Paper

References (37)

1. P. K. Agarwal, B. Aronov, T. M. Chan, and M. Sharir. On levels in arrangements of lines, segments, planes, and triangles. Discrete Comput. Geom., 19:315-331, 1998.
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, B. Aronov, and V. Koltun. Efficient algorithms for bichromatic separability. ACM Transactions on Algorithms, 2005. to appear.
4. P. K. Agarwal, B. Aronov, and M. Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:373-388, 1999.
5. P. K. Agarwal, B. Aronov, and M. Sharir. Exact and approximation algorithms for minimum-width cylindrical shells. Discrete Comput. Geom., 26(3):307-320, 2001.
6. P. K. Agarwal, L. J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. Penetration depth of two convex polytopes in 3D. Nordic J. Comput., 7(3):227-240, 2000.
7. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. Assoc. Comput. Mach., 51:606-635, 2004.
8. E. Arkin, F. Hurtado, J. Mitchell, C. Seara, and S. Skiena. Some lower bounds on geometric separability problems. In 11th Fall Workshop on Computational Geometry, 2001.
9. B. Aronov and S. Har-Peled. On approximating the depth and related problems. In Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, 2005.
10. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proc. 43th Annu. IEEE Sympos. Found. Comput. Sci., pages 617-626, 2002.
11. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geom., 16:369-387, 1996.
12. T. M. Chan. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. Internat. J. Comput. Geom. Appl., 12(2):67-85, 2002.
13. T. M. Chan. Low-dimensional linear programming with violations. In Proc. 43th Annu. IEEE Sympos. Found. Comput. Sci., pages 570-579, 2002.
14. T. M. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 152-159, 2004.
15. 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.
16. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10:377-409, 1993.
17. N. Cristianini and J. Shaw-Taylor. Support Vector Machines. Cambridge University Press, 2000.
18. R. M. Dudley. Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory, 10:227-236, 1974.
19. C. A. Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 121-130, 1997.
20. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
21. H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., 15:341-363, 1986.
22. H. Edelsbrunner and F. P. Preparata. Minimum polygonal separation. Inform. Comput., 77:218-232, 1988.
23. H. Everett, J.-M. Robert, and M. van Kreveld, An optimal algorithm for the (≤k)-levels, with applications to separation and transversal problems. Internat. J. Comput. Geom. Appl., 6:247-261, 1996.
24. S. P. Fekete. On the complexity of min-link red-blue separation. Manuscript, Department of Applied Mathematics, SUNY Stony Brook, NY, 1992.
25. S. Har-Peled and K. Varadarajan. High-dimensional shape fitting in linear time. In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 39-47, 2003.
26. S. Har-Peled and Y. Wang. Shape fitting with outliers. SIAM J. Comput., 33(2):269-285, 2004.
27. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, Berlin, Germany, 2001.
28. F. Hurtado, M. Mora, P. A. Ramos, and C. Seara. Two problems on separability with lines and polygonals. In Proc. 15th European Workshop on Computational Geometry, pages 33-35, 1999.
29. F. Hurtado, M. Noy, P. A. Ramos, and C. Seara. Separating objects in the plane with wedges and strips. Discrete Appl. Math., 109:109-138, 2001.
30. F. Hurtado, C. Seara, and S. Sethia. Red-blue separability problems in 3d. In Proc. 3rd Int. Conf. Comput. Sci. and Its Appl., pages 766-775, 2003.
31. J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.
32. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach., 31:114-127, 1984.
33. J. S. B. Mitchell. Approximation algorithms for geometric separation problems. Technical report, Department of Applied Mathematics, SUNY Stony Brook, NY, July 1993.
34. J. O'Rourke, S. R. Kosaraju, and N. Megiddo. Computing circular separability. Discrete Comput. Geom., 1:105-113, 1986.
35. M. Sharir, S. Smorodinsky, and G. Tardos. An improved bound for k-sets in three dimensions. Discrete Comput. Geom., 26:195-204, 2001.
36. V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, New York, 1996.
37. 1 linear approximation of points. In Proc. 4th Annu. ACM Sympos, Comput. Geom., pages 352-361. ACM Press, 1988.