Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a set of edges (a seam), one can map an arbitrary topology surface mesh to a single chart. Unfortunately, high distortion occurs when protrusions of the surface (such as fingers of a hand and horses’ legs) are flattened into a plane. This paper presents a novel skeleton-based algorithm for computing a seam on a triangulated surface. The seam produced is a full component Steiner tree in a graph constructed from the original mesh. By generating the seam so that all extremal vertices are leaves of the seam, we can obtain good parametrization with low distortion
In the proposed thesis, we address two challenges related to skeletons. The first is to formulate no...
165 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.We develop an algorithm and s...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a ...
Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a ...
International audience<p>We present a new curve skeleton model designed for surface modeling and pro...
We present a new curve skeleton model designed for surface modeling and processing. This skeleton is...
This paper presents a novel technique for simplifying a triangulated surface at different levels of...
We present a technique for recovering structural information from triangular meshes that can then be...
International audienceThis paper describes a unified and fully automatic algorithm for Reeb graph co...
Abstract This paper describes a unified and fully automatic algorithm for Reeb graph construction an...
Assume a 2D manifold surface topologically equivalent to a sphere with handles we propose a novel 3D...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
We present a technique for recovering structural information from triangular meshes that can then be...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
In the proposed thesis, we address two challenges related to skeletons. The first is to formulate no...
165 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.We develop an algorithm and s...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a ...
Mesh parameterization is a key problem in digital geometry processing. By cutting a surface along a ...
International audience<p>We present a new curve skeleton model designed for surface modeling and pro...
We present a new curve skeleton model designed for surface modeling and processing. This skeleton is...
This paper presents a novel technique for simplifying a triangulated surface at different levels of...
We present a technique for recovering structural information from triangular meshes that can then be...
International audienceThis paper describes a unified and fully automatic algorithm for Reeb graph co...
Abstract This paper describes a unified and fully automatic algorithm for Reeb graph construction an...
Assume a 2D manifold surface topologically equivalent to a sphere with handles we propose a novel 3D...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
We present a technique for recovering structural information from triangular meshes that can then be...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
In the proposed thesis, we address two challenges related to skeletons. The first is to formulate no...
165 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.We develop an algorithm and s...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...