This paper considers the problem of finding \$k\$ points among
\$n\$ given points whose diameter or variance is minimized.
Algorithms running in polynomial time in both \$n\$ and \$k\$ are given,
which make use of the higher Voronoi diagram in a smart way.