Feature-based surface parameterization and texture mapping

被引:207
作者
Zhang, E
Mischaikow, K
Turk, G
机构
[1] Georgia Inst Technol, Ctr Dynam Syst & Nonlinear Studies, Sch Math, Atlanta, GA 30332 USA
[2] Georgia Inst Technol, Coll Comp, GVU Ctr, Atlanta, GA 30332 USA
来源
ACM TRANSACTIONS ON GRAPHICS | 2005年 / 24卷 / 01期
关键词
algorithms; surface parameterization; segmentation; texture mapping; topology;
D O I
10.1145/1037957.1037958
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Surface parameterization is necessary for many graphics tasks: texture-preserving simplification, remeshing, surface painting, and precomputation of solid textures. The stretch caused by a given parameterization determines the sampling rate on the surface. In this article, we present an automatic parameterization method for segmenting a surface into patches that are then flattened with little stretch. Many objects consist of regions of relatively simple shapes, each of which has a natural parameterization. Based on this observation, we describe a three-stage feature-based patch creation method for manifold surfaces. The first two stages, genus reduction and feature identification, are performed with the help of distance-based surface functions. In the last stage, we create one or two patches for each feature region based on a covariance matrix of the feature's surface points. To reduce stretch during patch unfolding, we notice that stretch is a 2 x 2 tensor, which in ideal situations is the identity. Therefore, we use the Green-Lagrange tensor to measure and to guide the optimization process. Furthermore, we allow the boundary vertices of a patch to be optimized by adding scaffold triangles. We demonstrate our feature-based patch creation and patch unfolding methods for several textured models. Finally, to evaluate the quality of a given parameterization, we describe an image-based error measure that takes into account stretch, seams, smoothness, packing efficiency, and surface visibility.
引用
收藏
页码:1 / 27
页数:27
相关论文
共 49 条
[21]   Hierarchical mesh decomposition using fuzzy clustering and cuts [J].
Katz, S ;
Tal, A .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :954-961
[22]   Globally smooth parameterizations with low distortion [J].
Khodakovsky, A ;
Litke, N ;
Schröder, P .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :350-357
[23]   Computing geodesic paths on manifolds [J].
Kimmel, R ;
Sethian, JA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1998, 95 (15) :8431-8435
[24]  
Kindlmann G., 1999, Proceedings Visualization '99 (Cat. No.99CB37067), P183, DOI 10.1109/VISUAL.1999.809886
[25]  
LAZARUS F, 2001, 17 ACM S COMP GEOM, P80
[26]  
Lee A. W. F., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P95, DOI 10.1145/280814.280828
[27]   Mesh parameterization with a virtual boundary [J].
Lee, Y ;
Kim, HS ;
Lee, S .
COMPUTERS & GRAPHICS-UK, 2002, 26 (05) :677-686
[28]  
Lévy B, 2002, ACM T GRAPHIC, V21, P362, DOI 10.1145/566570.566590
[29]  
LEVY B, 2003, LEAST SQUARES CONFOR
[30]   Image-driven simplification [J].
Lindstrom, P ;
Turk, G .
ACM TRANSACTIONS ON GRAPHICS, 2000, 19 (03) :204-241