Add to ORKGWe 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(n log n) time
Robust linear regression is one of the most popular problems in the robust statistics community. It ...
We address the problem of partitioning a set of n points into clusters, so as to minimize the sum, o...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
We consider the problem of removing c points from a set S of n points so that the remaining point se...
We consider the problem of removing c points from a set S of n points so that the remaining point se...
AbstractWe consider the problem of removing c points from a set S of n points so that the remaining ...
Abstract. We consider the problem of removing c points from a set S of n points so that the resultin...
AbstractWe study the problem of finding an outlier-free subset of a set of points (or a probability ...
This paper proposes a novel adversarial optimization approach to efficient outlier removal in comput...
Determining the best shape to fit a set of points is a fundamental problem in many areas of computer...
We develop exact and approximate algorithms for computing optimal separators and measuring the exten...
The maximum consensus problem is fundamentally important to robust geometric fitting in computer vis...
The thesis studies three planar shape fitting problems in computational geometry, the unit square/di...
Recently, a concave optimization approach has been pro-posed to solve the robust point matching (RPM...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Robust linear regression is one of the most popular problems in the robust statistics community. It ...
We address the problem of partitioning a set of n points into clusters, so as to minimize the sum, o...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
We consider the problem of removing c points from a set S of n points so that the remaining point se...
We consider the problem of removing c points from a set S of n points so that the remaining point se...
AbstractWe consider the problem of removing c points from a set S of n points so that the remaining ...
Abstract. We consider the problem of removing c points from a set S of n points so that the resultin...
AbstractWe study the problem of finding an outlier-free subset of a set of points (or a probability ...
This paper proposes a novel adversarial optimization approach to efficient outlier removal in comput...
Determining the best shape to fit a set of points is a fundamental problem in many areas of computer...
We develop exact and approximate algorithms for computing optimal separators and measuring the exten...
The maximum consensus problem is fundamentally important to robust geometric fitting in computer vis...
The thesis studies three planar shape fitting problems in computational geometry, the unit square/di...
Recently, a concave optimization approach has been pro-posed to solve the robust point matching (RPM...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Robust linear regression is one of the most popular problems in the robust statistics community. It ...
We address the problem of partitioning a set of n points into clusters, so as to minimize the sum, o...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...