Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...