Research on Adaptive Subdivision Algorithm Based on the Triangle Mesh Segmentation

摘要

One problem existing in the triangle mesh subdivision is the number of facets growing exponentially with every subdivision step, and the number of the subdivision surface facets is usually huge and the scheme is difficult to manipulate in post processing. To solve this problem, this paper puts forward an adaptive subdivision algorithm based on triangle mesh segmentation. This algorithm puts forward a new segmentation method for initialization based on meshes region growing, and divides control meshes into several areas connected. Algorithm is mainly divided into four stages, namely analyzing facets, initializing segmentation, computing segmentation center, and vertex segmentation. Experimental results show the algorithm, not only holds ideal smooth surface with fewer facets, but also overcomes the shortcoming of uniform meshes.