Lazy Solid Texture Synthesis

Abstract

Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restrict synthesis to a subset of the voxels, while enforcing spatial determinism. This is especially useful when texturing objects, since only a thick layer around the surface needs to be synthesized. A major difficulty lies in reducing the dependency chain of neighborhood matching, so that each voxel only depends on a small number of other voxels.
Our key idea is to synthesize a volume from a set of pre-computed 3D candidates, each being a triple of interleaved 2D neighborhoods. We present an efficient algorithm to carefully select in a pre-process only those candidates forming consistent triples. This significantly reduces the search space during subsequent synthesis. The result is a new parallel, spatially deterministic solid texture synthesis algorithm which runs efficiently on the GPU.
Our approach generates high resolution solid textures on surfaces within seconds. Memory usage and synthesis time only depend on the output textured surface area. The GPU implementation of our method rapidly synthesizes new textures for the surfaces appearing when interactively breaking or cutting objects.

Files

BibTex reference

@InProceedings\{DLTD08,
  author    = "Dong, Yue and Lefebvre, Sylvain and Tong, Xin and Drettakis, George",
  title     = "Lazy Solid Texture Synthesis ",
  booktitle = "Computer Graphics Forum (Proceedings of the Eurographics Symposium on Rendering)",
  year      = "2008",
}

Acknowledgments

We would like to thank Baining Guo, Li-Yi Wei, and the anonymous reviewers for their help in improving the paper, as well as Su Wang for 3D modeling. This work is partly supported by the NSFC (National Natural Science Foundation of China), grant 10547002.