Range-Clustering Queries

Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2

In a geometric $k$-clustering problem the goal is to partition a set of points in ${\mathbb{R}}^d$ into $k$ subsets such that a certain cost function of the clustering is minimized.…