Mesh segmentation based on curvatures using the GPU
This paper proposes an efficient algorithm for decomposition of a 3D arbitrary triangular mesh into surface patches. Our method is based on the discrete curvatures for an accurate partitioning criterion and presents a fast clustering scheme of vertices using quick shift algorithm. It was implemented on the GPU (Graphics Processing Unit) because it is common for object geometry to exist in graphic memory so that more computational work is done directly on the graphic device. The proposed method results in fast estimation of curvatures and high quality of mesh segmentation. Also we applied it to NPR drawing of 3D meshes.
mesh segmentation discrete curvatures quick shift gp-gpu programming cuda