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

Clustering is an NP-Hard problem even if you are given the number of clusters a priori, so you can probably give up on getting a polynomial run time. There are many many techniques to do this and the literature is mainly found in the machine learning community, k-means is probably the easiest algorithm to understand and implement.