Complete-linkage clustering

Merge planar points using complete-linkage distance and inspect cluster membership at your chosen cluster count.

The example value has been entered. Check it immediately or change the value.

Input is processed in the browser. Refreshing returns a sample value.

Result

Instructions and example

D(A,B)=max{‖a−b‖₂:a∈A,b∈B}; argmin D(A,B)

For 0,0 / 0,1 / 10,10 / 10,11, 2 clusters contain rows 1,2 and 3,4; merge distances are 1,1.

At most 60 points with 2 coordinates; no normalization. Distance ties follow input order. Cluster count is not recommended and clusters are not ground-truth labels. Floating-point results display at most 12 significant digits.

Frequently asked questions

Is complete linkage a centroid distance?

No. It uses the farthest pair across the two clusters, unlike centroid-based k-means.

Can clustering include repeated coordinates?

Yes. Each row remains a separate observation and repeated coordinates have distance 0. Duplicates are not removed.

Calculation criteria and reference materials

Verification of calculation criteria: · Calculation·verification principles · Report errors