Fast algorithm for finding the size of each connected component in a graph of 2D points
You can do it in $O(n \log n)$ time by forming an Euclidean minimum spanning tree, and then dropping any edge with length greater than $t$.