Single-linkage clustering ($d(C,D)={\min }_{x\in C,y\in D}d(x,y)$)

The nearest cross-pair distance determines the next merge. At a threshold, clusters are connected components of the graph joining pairs below that threshold. This handles nonconvex shapes but can join otherwise separate groups through a chain of intermediate observations.