Algorithms for optimal outlier removal

Aggarwal, 1991, Finding k points with minimum diameter and related problems, Journal of Algorithms, 12, 38, 10.1016/0196-6774(91)90022-Q R. Atanassov, P. Morin, S. Wuhrer, Removing outliers to minimize area and perimeter, in: Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006) 2006 M. Ben-Or, Lower bounds for algebraic computation trees (preliminary report), in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC'83), 1983, pp. 80–86 Chan, 2005, Low-dimensional linear programming with violations, SIAM Journal on Computing, 32, 879, 10.1137/S0097539703439404 Chazelle, 1985, On the convex layers of a planar set, IEEE Transactions on Information Theory, 31, 509, 10.1109/TIT.1985.1057060 Chen, 2001, Vertex cover: Further observations and further improvements, Journal of Algorithms, 41, 280, 10.1006/jagm.2001.1186 K.L. Clarkson, P.W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, in: Proceedings of the Fourth Annual ACM Symposium on Computational Geometry (SoCG'88), 1988, pp. 12–17 Dobkin, 1983, Finding smallest polygons, Computational Geometry: Theory and Applications, 1, 181 Downey, 1999 Eckhoff, 1993, Helly, Radon, and Carathéodory type theorems, 389 D. Eppstein, New algorithms for minimum area k-gons, in: Proceedings of the Third ACM–SIAM Symposium on Discrete Algorithms (SODA 1992), 1992 Eppstein, 1994, Iterated nearest neighbors and finding minimal polytopes, Discrete & Computational Geometry, 11, 321, 10.1007/BF02574012 Eppstein, 1992, Finding minimum area k-gons, Discrete & Computational Geometry, 7, 45, 10.1007/BF02187823 Graham, 1994 Hershberger, 1992, Applications of a semi-dynamic convex hull algorithm, BIT, 32, 249, 10.1007/BF01994880 Matoušek, 1995, On geometric optimization with few violated constraints, Discrete & Computational Geometry, 14, 365, 10.1007/BF02570713 Preparata, 1985 Ramos, 2001, An optimal deterministic algorithm for computing the diameter of a three-dimensional point set, Discrete & Computational Geometry, 26, 233, 10.1007/s00454-001-0029-8 Segal, 1998, Enclosing k points in the smallest axis parallel rectangle, Information Processing Letters, 65, 95, 10.1016/S0020-0190(97)00212-3 M.I. Shamos, Computational geometry, PhD thesis, Yale University, 1978 Solomon, 1980, A note on enumerating binary trees, Journal of the ACM, 27, 3, 10.1145/322169.322171