Let P be a set of n points in the plane and let e be a segment of fixed length. The segment-center problem is to find a placement of e (allowing translation and rotation) which minimizes the maximum euclidean distance from e to the points of P. We present an algorithm that solves the problem in time O(n1+ε), for any ε > 0, improving the previous solution of Agarwal et al.  by nearly a factor of O(n).
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics