2d point clustering

Question

Given: Given a set of N points in the 2D plane (x and y coordinates), and a set of N radii corresponding to each point. We will refer to a point\'s disc as the

Answer 1

k-means clustering based on a combination of local search and Lloyd's algorithm

http://www.cs.umd.edu/~mount/Projects/KMeans/
(Program is distributed under conditions of the GNU General Public License.)

k-means, k-medians, k-medoids, treecluster, self-organizing maps, clustercentroids, clusterdistance http://bonsai.hgc.jp/~mdehoon/software/cluster/cluster.pdf