A Novel Mesh Quad-segmentation Algorithm

Great efforts have been devoted to seamless quadrangulation of triangular mesh for its practical application in constructing surface patches. This type of algorithm sets up a parameterization on the triangular mesh and a re-meshing is carried out then to the quadrangulate mesh. The paper proposes a novel algorithm to quad-segment the triangular mesh. Our algorithm combines the techniques of parameterization with re-triangulation and clustering which segment the triangular mesh instead of re-meshing based on the parameterization results. Thus the algorithm avoids the process of solving linear systems of equations and local parameterization for adjusments. Also, the robustness of the algorithms is enhanced because ofthe possible ill-conditioned status of linear systems of equations arises in the previous algorithms.