Given a set of points in the plane and a number r, computes where a disc with radius r should be placed in order to maximize the number of input points covered by the disc.
Live demo: https://stefantic.tk/facility-location/
Given a set of points in the plane and a number r, computes where a disc with radius r should be placed in order to maximize the number of input points covered by the disc.
Upper bounds: O(n^2 logn) time and O(n) space, where n is the number of points.
Given a set of points in the plane and a number r, computes where a disc with radius r should be placed in order to maximize the number of input points covered by the disc.