ACM Home Page
Please provide us with feedback. Feedback
Constrained texture mapping for polygonal meshes
Full text PdfPdf (11.25 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 28th annual conference on Computer graphics and interactive techniques table of contents
Pages: 417 - 424  
Year of Publication: 2001
ISBN:1-58113-374-X
Author
Bruno Lévy  ISA (Inria Lorraine and CNRS), France
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 104,   Citation Count: 27
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/383259.383308
What is a DOI?

ABSTRACT

Recently, time and effort have been devoted to automatic texture mapping. It is possible to study the parameterization function and to describe the texture mapping process in terms of a functional optimization problem. Several methods of this type have been proposed to minimize deformations. However, these existing methods suffer from several limitations. For instance, it is difficult to put details of the texture in correspondence with features of the model, since most of the existing methods can only constrain iso-parametric curves.

We introduce in this paper a new optimization-based method for parameterizing polygonal meshes with minimum deformations, while enabling the user to interactively define and edit a set of constraints. Each user-defined constraint consists of a relation linking a 3D point picked on the surface and a 2D point of the texture. Moreover, the non-deformation criterion introduced here can act as an extrapolator, thus making it unnecessary to constrain the border of the surface, in contrast with classic methods. To minimize the criterion, a conjugate gradient algorithm is combined with a compressed representation of sparse matrices, making it possible to achieve a fast convergence.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
E. Bier and K. Sloan. Two-part texture mapping. IEEE Computer Graphics and Applications, pages 40-53, September 1986.
 
4
5
 
6
J. Eells and J.H. Sampson. Harmonic mapping of riemannian manifolds. Amer. J. Math., 86:109-160, 1964.
 
7
 
8
P.E. Gill, W. Murray, and M.H. Wright. Practical Optimization. Academic Press, 1981. ISBN 0-12-283950-1.
 
9
J.P. Gratier, B. Guillier, and A. Delorme. Restoration and balance of a folded and faulted surface by best-fitting of finite elements: principles and applications. Journal of Structural Geology, 13(1):111-1115, 1991.
10
 
11
 
12
K. Hormann and G. Greiner. Mips: An efficient global parameterization method. In Curve and surface design: saint-malo 1999, pages 153-162. Vanderbilt university press, 2000.
 
13
K. Hormann, G. Greiner, and S. Campagna. Hierarchical parameterisation of triangulated surfaces. In Vision, Modeling and Visualization '99, pages 219-226. infix, 1999.
14
15
16
 
17
S.D. Ma and H. Lin. Optimal texture mapping. In EUROGRAPHICS88, pages 421-428, September 1988.
18
19
 
20
 
21
22
23
 
24
Samek, Marcel, C. Slean, and H. Weghorst. Texture mapping and distortions in digital graphics. The Visual Computer, 2(5):313-320, September 1986.
 
25
W.T. Tutte. Convex representation of graphs. In Proc. London Math. Soc., volume 10, 1960.

CITED BY  27