Let U = {P1, P2, ..., Pn} denote a set of n points on a plane. A k-clustering of U is a partition of U into k nonempty sets U1, U2, ..., Uk. We define the spacing of a k-clustering to be the minimum distance between any pair of points lying in different clusters. Design an efficient algorithm to find the k-clustering with the maximum spacing