2002
DOI: 10.1145/566654.566649
|View full text |Cite
|
Sign up to set email alerts
|

Painting and rendering textures on unparameterized models

Abstract: This paper presents a solution for texture mapping unparameterized models. The quality of a texture on a model is often limited by the model's parameterization into a 2D texture space. For models with complex topologies or complex distributions of structural detail, finding this parameterization can be very difficult and usually must be performed manually through a slow iterative process between the modeler and texture painter. This is especially true of models which carry no natural parameterizations, such as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(18 citation statements)
references
References 22 publications
0
18
0
Order By: Relevance
“…While being extremely simple to compute, this projection can handle successfully non trivial cases, including a full sphere. It also handles correctly two-sided thin surfaces, as illustrated Figure 4 -a difficult case with previous volume approaches [Benson and Davis 2002;DeBry et al 2002]. In fact, it can even texture the back and front sides of a triangle differently.…”
Section: Projectionmentioning
confidence: 97%
See 1 more Smart Citation
“…While being extremely simple to compute, this projection can handle successfully non trivial cases, including a full sphere. It also handles correctly two-sided thin surfaces, as illustrated Figure 4 -a difficult case with previous volume approaches [Benson and Davis 2002;DeBry et al 2002]. In fact, it can even texture the back and front sides of a triangle differently.…”
Section: Projectionmentioning
confidence: 97%
“…To enable texturing of implicit surfaces and avoid explicit parameterization altogether, Benson et al [Benson and Davis 2002] and DeBry et al [DeBry et al 2002] proposed to encode texture data in an octree surrounding the surface. This provides low distortion and adaptive texturing, at the expense of a space and time overhead: The tree contains many unused entries in its nodes, and accessing the data requires a long chain of indirections.…”
Section: Previous Workmentioning
confidence: 99%
“…Instead, uniform resolution is forced at those locations requiring interpolation [3,10,36]. To prevent large accuracy jumps caused by large resolution differences, trees are often constrained by 2-to-1 balancing that allows only one level difference between adjacent cells [16,31].…”
Section: Previous Workmentioning
confidence: 99%
“…Some works try to solve the seam problem by boundary color duplication [Purnomo et al 2004], [Carr and Hart 2002] and [Piponi and Borshukov 2000]. Another group of approaches use an octree structure [Benson and Davis 2002], [Debry et al 2002] and [Lefebvre and Dachsbacher 2007] to store the data instead of mapping the surface into a planar domain. An alternative way to texture mapping was presented in [Yuksel et al 2010], where the color sample positions are defined directly on the 3D surface.…”
Section: Related Workmentioning
confidence: 99%