2010•Unpublished venueRequires access

Research on adaptive subdivision algorithm based on the triangle mesh segmentation

Zhenyu Yang, Yuhua Zhou, Weiyong Wu

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Subdivision, Polygon mesh, Initialization, Segmentation, Computer science, Vertex (graph theory), Algorithm, Image segmentation

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on adaptive subdivision algorithm based on the triangle mesh segmentation — Research Paper | ScholarLens