In this paper, we present a novel and fast algorithm for 3D meshes segmentation based on the geometric information of boundary. Firstly, according to the topological relationship of original mesh faces, we construct the dual graph, and set the weight of vertex and edge on the basis of geometric information of mesh faces. Using the k-way multilevel cutting method, we segment the dual graph quickly to obtain the pre-segmentation and initial boundary for each patch. Then we define the boundary strength function and the feature boundary of each patch, to construct a deformation contour on the patch’s boundary. By minimizing the energy of the deformation contour, the initial boundary is driven to approach the feature boundary. Finally, the original mesh is segmented into several meaningful patches in accordance with the minimal rule. The experiment results suggest that our algorithm is efficient and effective, and is applicable to a variety of triangular mesh models with prominent shape features.