title: Clustering algorithm for 3D points?
body: <p>Let's say you are given N points in R^3, that all lay in the unit cube (ie X,Y and Z are all in [0.0,1.0]), and you want to group them tightly into M clusters of N/M points each.</p>
  <p>Let's define the width of a cluster as the diameter of the smallest sphere that encloses the cluster, and the goal is to minimize the largest cluster width.</p>
  <p>Any ideas?</p>