COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
Alex Glozman, Klara Kedem, Gregory Shpitalnik · International Journal of Computational Geometry & Applications · 1999
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 configuaration. 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(n3α(n) log 2n).