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

It sounds like the obvious O(n^2) algorithm would be to create a graph with the points as vertices, and then connect two points if the conditions you give are met. And then you read off the connected components of the graph, discarding singletons. Also, the condition you gave for clustering sounds symmetric to me. Am I missing something?