In this paper, we first present a novel hierarchical clustering algorithm named Pairwise
Linkage (P-Linkage), which can be used for clustering any dimensional data, and then
effectively apply it on 3D unstructured point cloud segmentation. The P-Linkage clustering
algorithm first calculates a feature value for each data point, for example, the density for 2D
data points and the flatness for 3D point clouds. Then for each data point a pairwise linkage
is created between itself and its closest neighboring point with a greater feature value than …

中国开放科研知识云: PAIRWISE LINKAGE FOR POINT CLOUD SEGMENTATION …
PAIRWISE LINKAGE FOR POINT CLOUD SEGMENTATION … PAIRWISE LINKAGE FOR
POINT CLOUD SEGMENTATION[C]. 见:. …