In this paper, we address the problem of how to seamlessly and without repetition artifacts or visible projective distortion cover the surface of a polygonally-defined model with a texture pattern derived from an acquired 2D image such that the dominant orientation of the pattern will everywhere follow the surface shape in an aesthetically pleasing way. Specifically, we propose an efficient, automatic method for synthesizing, from a small sample swatch, patches of perceptually similar texture in which the pattern orientation may locally follow a specified vector field, such as the principal directions of curvature, at a per-pixel level, and in which the continuity of large and small scale features of the pattern is generally preserved acros...
Given an arbitrary mesh, we present a method to construct a progressive mesh (PM) such that all mesh...
Algorithms exist for synthesizing a wide variety of textures over rectangular domains. However, it r...
Texture mapping algorithms use mesh parameterization meth-ods to find an optimal map for the vertice...
AbstractPolygonal models have been widely applied in the community of CAD and computer graphics. Sin...
International audienceThis paper presents a method for texturing any surface using texture samples w...
We propose a technique, called TextureMontage, to seamlessly map a patchwork of texture images onto ...
We present an approach for decorating surfaces with progressively-variant textures. Unlike a homogen...
Existing texture synthesis-from-example strategies for polygon meshes typically make use of three co...
[[abstract]]Texture mapping is a common technique in computer graphics to render realistic images. O...
The essence of a 3D shape can often be well captured by its salient feature curves. In this paper, w...
In this paper we propose a new continuous Shape from Texture (SfT) model for piecewise planar surfac...
We present a texturing method that correctly maps homogeneous non-periodic textures to arbitrary sur...
[[abstract]]Texture mapping is a common technique in computer graphics used to render realistic imag...
We propose a technique, called TextureMontage, to seamlessly map a patchwork of texture images onto ...
to appearInternational audienceWe present a multi-scale algorithm for mapping a texture defined by a...
Given an arbitrary mesh, we present a method to construct a progressive mesh (PM) such that all mesh...
Algorithms exist for synthesizing a wide variety of textures over rectangular domains. However, it r...
Texture mapping algorithms use mesh parameterization meth-ods to find an optimal map for the vertice...
AbstractPolygonal models have been widely applied in the community of CAD and computer graphics. Sin...
International audienceThis paper presents a method for texturing any surface using texture samples w...
We propose a technique, called TextureMontage, to seamlessly map a patchwork of texture images onto ...
We present an approach for decorating surfaces with progressively-variant textures. Unlike a homogen...
Existing texture synthesis-from-example strategies for polygon meshes typically make use of three co...
[[abstract]]Texture mapping is a common technique in computer graphics to render realistic images. O...
The essence of a 3D shape can often be well captured by its salient feature curves. In this paper, w...
In this paper we propose a new continuous Shape from Texture (SfT) model for piecewise planar surfac...
We present a texturing method that correctly maps homogeneous non-periodic textures to arbitrary sur...
[[abstract]]Texture mapping is a common technique in computer graphics used to render realistic imag...
We propose a technique, called TextureMontage, to seamlessly map a patchwork of texture images onto ...
to appearInternational audienceWe present a multi-scale algorithm for mapping a texture defined by a...
Given an arbitrary mesh, we present a method to construct a progressive mesh (PM) such that all mesh...
Algorithms exist for synthesizing a wide variety of textures over rectangular domains. However, it r...
Texture mapping algorithms use mesh parameterization meth-ods to find an optimal map for the vertice...