A patch‐growing approach to 3D model segmentation using a shortest‐path labeling technique
Shyi‐Chyi Cheng, Chen-Tsung Kuo, W. K. Lai · Journal of the Chinese Institute of Engineers · 2007
This paper presents a new segmentation algorithm for 3D models based on a series of patch growing and merging processes using a shortest‐path labeling technique. This algorithm starts with the patch growing process, which groups triangles into homogeneous surfaces by shortest‐path labeling. Each resulting small patch is then merged to the patch that is the nearest to it in terms of geometric similarity and spatial proximity. Finally, 3D models are separated into sets of polygonal patches, each of them consisting of a set of similar triangles in terms of normal differences. One problem with patch growing is its inherent dependency on the selection of starting triangles, which can be fine tuned iteratively. Experimental results demonstrate the good performance of the new method in terms of better segmentation and less sensitivity to noise, as well as in terms of computational efficiency.