I have a load of point data in 3D, and I wish to cluster them like so:
- Each cluster contains points all of which are at most distance $d$ from another point in the cluster.
- All points in two distinct clusters are at least distance $d$ from each other.
The distances used are Euclidean distances.
Is this a well known clustering algorithm? If so, what is is called? Thanks.