Given a set of points in two dimensional space, and a radius r, what is the algorithm to find a disk of radius r that covers the maximum number of points?
Maximizing the number of points covered by a circular disk of fixed radius.
4
$\begingroup$
geometry
algorithms
optimization
computational-geometry
-
0How effective/how exact a solution are you looking for? – 2012-06-17
-
2Ref: http://www.cs.princeton.edu/~chazelle/pubs/CirclePlacement.pdf – 2012-06-17