2
$\begingroup$

Suppose I have $N$ points in two dimensional space. I want to know which $K$ of them ($K \lt N$) are located most densely (so that area of Convex Hull of points or sum of squares within cluster is least). How can I find them?

I know K-means-algorithm but it will yield groups that will have number of points different than $K$.

I don't know what should be tags for this question. If someone can tag them appropriately it will be great.

  • 0
    Are you looking for a theoretically optimal solution or are you trying to implement the algorithm?2012-01-28

0 Answers 0