This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property. Thus, each region can be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the proposed algorithm is performed efficiently. 1
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
Abstract—Anew parameter-free graph-morphology-based segmentation algorithm is proposed to address th...
We present a technique for recovering structural information from triangular meshes that can then be...
This manuscript reports a geometrical and a topological methods to segment a closed triangular 2-man...
International audienceWe present a new and efficient algorithm for surface decomposition of arbitrar...
A number of quite successful SFM solutions proposed focus on producing a sparse or dense set of feat...
International audienceDuring the last decades, the three-dimensional objects have begun to compete w...
In order to achieve a smooth surface while rendering a triangle-based mesh, we need to eliminate the...
A wide range of cheap and simple to use 3D scanning devices has recently been introduced in the mark...
In this paper, we present a new method of mesh segmentation based on the local geometric properties ...
Most computer contour mapping of irregularly spaced data points is performed using an intermediate r...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
Abstract—Anew parameter-free graph-morphology-based segmentation algorithm is proposed to address th...
We present a technique for recovering structural information from triangular meshes that can then be...
This manuscript reports a geometrical and a topological methods to segment a closed triangular 2-man...
International audienceWe present a new and efficient algorithm for surface decomposition of arbitrar...
A number of quite successful SFM solutions proposed focus on producing a sparse or dense set of feat...
International audienceDuring the last decades, the three-dimensional objects have begun to compete w...
In order to achieve a smooth surface while rendering a triangle-based mesh, we need to eliminate the...
A wide range of cheap and simple to use 3D scanning devices has recently been introduced in the mark...
In this paper, we present a new method of mesh segmentation based on the local geometric properties ...
Most computer contour mapping of irregularly spaced data points is performed using an intermediate r...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...
Curve skeletons are well known for their ability to support part-based segmentation of 3D shapes. In...