The value of \(\mathop {dis}(p,q)\)  in Eq. (REF ) describes the matching distance between two feature points. We first set a threshold for the matching distance to select correspondence candidates and then use a mean shift clustering algorithm[1]} to determine the final correspondences. By matching the feature points between each two general section profiles \((l_1,l_2)\) , \((l_2,l_3)\)  and \((l_3,l_1)\) , the initial corresponding point set \(S^{0}=S^{0}_{(l_1,l_2)}\cup S^{0}_{(l_2,l_3)}\cup S^{0}_{(l_3,l_1)}\)  can be obtained.
