Add to ORKGIn this paper, we solve the problem of mesh partition using intrinsic computations on the 3D surface. The key concept is the notion of centroidal tesselation that is widely used in an eucidan settings. Using the Fast Marching algorithm, we are able to recast this powerful tool in the language of mesh processing. This method naturally fits into a framework for 3D geometry modelling and processing that uses only fast geodesic computations. With the use of classical geodesic-based building blocks, we are able to take into account any available information or requirement such as a 2D texture or the curvature of the surface.ou
In this paper, a new metric advancing front surface mesh generation scheme is suggested. This new s...
We present an effective framework for segmenting 3D shapes into meaningful components using the curv...
Abstract. In this paper, we propose fast and accurate algorithms to remesh and flatten a genus-0 tri...
We present an algorithm computing geodesic curves partitioning an open mesh into segments which can ...
In this paper, we propose a complete framework for 3D geometry modeling and processing that uses onl...
International audienceThis paper provides a curvature-based algorithm to compute locally shortest ge...
La version de travail s'intitule " Minimal Paths and Surface Segmentation"In this paper we consider ...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
This paper describes a method for partitioning 3D surface meshes into useful segments. The proposed ...
International audienceWe present a new and efficient algorithm for surface decomposition of arbitrar...
This paper proposes a new automatic mesh generation algorithm for 3D surface mesh generation. The al...
Laser range-scanners are used in fields as diverse as product design, reverse engineering, and rapid...
This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm...
Abstract—Anew parameter-free graph-morphology-based segmentation algorithm is proposed to address th...
We present a new method for segmenting closed curves or surfaces from a single point. Our work build...
In this paper, a new metric advancing front surface mesh generation scheme is suggested. This new s...
We present an effective framework for segmenting 3D shapes into meaningful components using the curv...
Abstract. In this paper, we propose fast and accurate algorithms to remesh and flatten a genus-0 tri...
We present an algorithm computing geodesic curves partitioning an open mesh into segments which can ...
In this paper, we propose a complete framework for 3D geometry modeling and processing that uses onl...
International audienceThis paper provides a curvature-based algorithm to compute locally shortest ge...
La version de travail s'intitule " Minimal Paths and Surface Segmentation"In this paper we consider ...
International audienceThis paper presents a new and efficient algorithm for the decomposition of 3D ...
This paper describes a method for partitioning 3D surface meshes into useful segments. The proposed ...
International audienceWe present a new and efficient algorithm for surface decomposition of arbitrar...
This paper proposes a new automatic mesh generation algorithm for 3D surface mesh generation. The al...
Laser range-scanners are used in fields as diverse as product design, reverse engineering, and rapid...
This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm...
Abstract—Anew parameter-free graph-morphology-based segmentation algorithm is proposed to address th...
We present a new method for segmenting closed curves or surfaces from a single point. Our work build...
In this paper, a new metric advancing front surface mesh generation scheme is suggested. This new s...
We present an effective framework for segmenting 3D shapes into meaningful components using the curv...
Abstract. In this paper, we propose fast and accurate algorithms to remesh and flatten a genus-0 tri...