We present an automatic method to produce a Catmull-Clark subdivision surface that fits a given input mesh. Its control mesh is coarse and adaptive, and it is obtained by simplifying an initial mesh at high resolution. Simplification occurs progressively via local operators and addresses both quality of surface and faithfulness to the input shape throughout the whole process. The method is robust and performs well on rather complex shapes. Displacement mapping or normal mapping can be applied to approximate the input shape arbitrarily well
In Geometry Processing, and more specifically in surface approximation, one of the most important is...
Subdivision is a method to create a smooth surface from a coarse mesh by subdividing the entire mesh...
In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision m...
We present an automatic method to produce a Catmull-Clark subdivision surface that fits a given inpu...
We present an automatic method to produce a Catmull-Clark subdivision surface that fits a given inpu...
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces...
International audienceIn this paper we present a new framework for subdivision surface fitting of ar...
International audienceIn this paper we present a new framework for subdivision surface approximation...
We present an improved algorithm for the progressive simplification of quad meshes, which adapts the...
Subdivision provides a powerful scheme for building smooth and complex surfaces. But the number of f...
International audienceThis paper presents an algorithm for approximating arbitrary polygonal meshes ...
We present a simple and computationally efficient algorithm for approximating Catmull-Clark subdivis...
uniformly refined at level 2 by using the standard Catmull Clark subdivision scheme (c). We present ...
We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refi...
One problem in subdivision surfaces is the number of facets grows exponentially with the level of su...
In Geometry Processing, and more specifically in surface approximation, one of the most important is...
Subdivision is a method to create a smooth surface from a coarse mesh by subdividing the entire mesh...
In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision m...
We present an automatic method to produce a Catmull-Clark subdivision surface that fits a given inpu...
We present an automatic method to produce a Catmull-Clark subdivision surface that fits a given inpu...
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces...
International audienceIn this paper we present a new framework for subdivision surface fitting of ar...
International audienceIn this paper we present a new framework for subdivision surface approximation...
We present an improved algorithm for the progressive simplification of quad meshes, which adapts the...
Subdivision provides a powerful scheme for building smooth and complex surfaces. But the number of f...
International audienceThis paper presents an algorithm for approximating arbitrary polygonal meshes ...
We present a simple and computationally efficient algorithm for approximating Catmull-Clark subdivis...
uniformly refined at level 2 by using the standard Catmull Clark subdivision scheme (c). We present ...
We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refi...
One problem in subdivision surfaces is the number of facets grows exponentially with the level of su...
In Geometry Processing, and more specifically in surface approximation, one of the most important is...
Subdivision is a method to create a smooth surface from a coarse mesh by subdividing the entire mesh...
In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision m...