Lapped textures

By Emil Praun, Adam Finkelstein, Hugues Hoppe. International Conference on Computer Graphics and Interactive Techniques, 2000

455 citations recorded by the source corpus.

We present for creating texture over an surface mesh using an example 2D texture. The approach is to identify interesting regions (texture patches) in the 2D example, and to repeatedly paste them onto the surface until it is completely covered. We call such a collection of overlapping patches a lapped texture. It is rendered using compositing operations, either into a traditional global texture map during a preprocess, or directly with the surface at runtime. The runtime compositing approach avoids resampling artifacts and drastically reduces texture memory requirements. Through a simple interface, the user specifies a tangential vector field over the surface, providing local control over the texture scale, and for anisotropic textures, the orientation. To paste a texture patch onto the surface, a surface patch is grown and parametrized over texture space. Specifically, we optimize the parametrization of each surface patch such that the tangential vector field aligns everywhere with the standard frame of the texture patch. We show that this optimization is solved efficiently as a sparse linear system.

Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design

View Paper: https://www.semanticscholar.org/paper/060e1d10b0b00c7ae819531e353544cea10fa501

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

In Computer Graphics and Computer-Aided Design

Citations in the corpus

Texture synthesis over arbitrary manifold surfaces (2001, methodology): “Since it is an extention of [25], it only works for texture images; therefore it is not as general as [20] which can paste any image onto a mesh model.”
Parallel controllable texture synthesis (2005, methodology): “Texture is created by iteratively overlapping irregular patches of the exemplar [Praun et al 2000] to minimize overlap error [Liang et al 2001].”
Interactive procedural street modeling (2008, background): “Note that there are other ways of creating a directional field from user constraints, such as relaxation [Turk 2001; Wei and Levoy 2001; Fisher et al. 2007] and propagation [Praun et al. 2000].”
Synthesis of bidirectional texture functions on arbitrary surfaces (2002, methodology): “This technique works well for many textures [16], but for the , blending can introduce inconsistent mesostructures, as Fig.”
Real-time texture synthesis by patch-based sampling (2001, methodology): “With patch-based sampling, we can eliminate a number of problems with existing techniques, for example, the need for manual texture patch creation and feature mismatches across patch boundaries [Praun et al. 2000].”
Texture Mapping Using Surface Flattening via Multidimensional Scaling (2002, methodology): “A solution to a similar problem was introduced by Praun, Finkelstein and Hoppe in [22].”
PolyCube-Maps (2004, result): “The result would be similar to lapped textures [Praun et al. 2000] but without the need to use a resampled texture atlas or to render triangles multiple times with alpha blending.”
Least squares conformal maps for automatic texture atlas generation (2002, unknown): “To decorate polygonal models with regular patterns, thelapped texturesapproach [26] can be applied: local overlapping parameterizations are used to repeatedly map a small texture swatch onto a model.”
Texture synthesis on surfaces (2001, methodology): “Several methods have been presented that interpolate vectors over a surface, including [19, 9].”
Periodic global parameterization (2006, methodology): “In the context of texture synthesis, the lapped textures approach [Praun et al. 2000] covers an object with overlapping tiles.”
Image quilting for texture synthesis and transfer (2001, methodology): “The result shown on Figure 2(a) already looks somewhat reasonable and for some textures will perform no worse than many previous complicated algorithms as demonstrated by [21, 18].”