Computing a double-ray center for a planar point set
A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set S of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n(3)alpha(n) log(2)n).
center planar point set hausdorff distance algorithm optimization