Algorithms for optimal outlier removal

Authors:
Rossen Atanassov;Prosenjit Bose;Mathieu Couture;Anil Maheshwari;Pat Morin;Michel Paquette;Michiel Smid;Stefanie Wuhrer
Affiliations:
School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6
Venue:
Journal of Discrete Algorithms
Year:
2009

Citing 15
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Finding k points with minimum diameter and related problems

Journal of Algorithms
New algorithms for minimum area k-gons

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding minimum area k-gons

Discrete & Computational Geometry
Applications of a semi-dynamic convex hull algorithm

BIT
Enclosing k points in the smallest axis parallel rectangle

Information Processing Letters
A Note on Enumerating Binary Trees

Journal of the ACM (JACM)
Vertex cover: further observations and further improvements

Journal of Algorithms
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational geometry.

Computational geometry.
Low-Dimensional Linear Programming with Violations

SIAM Journal on Computing
On the convex layers of a planar set

IEEE Transactions on Information Theory
Parameterized Complexity

Parameterized Complexity

Fitting a Step Function to a Point Set

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Square and Rectangle Covering with Outliers

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Covering points by disjoint boxes with outliers

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c, all our algorithms run in O(nlogn) time.