Use d3-quadtree to find the point in a group farthest away from its nearest neighbor without an extra knn implementation (biased towards the corners and edges since they can’t have neighbors on all sides).