ACM Home Page
Please provide us with feedback. Feedback
Texture mapping progressive meshes
Full text PdfPdf (5.18 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: 409 - 416  
Year of Publication: 2001
ISBN:1-58113-374-X
Authors
Pedro V. Sander  Harvard University
John Snyder  Microsoft Research
Steven J. Gortler  Harvard University
Hugues Hoppe  Microsoft Research
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 162,   Citation Count: 113
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.383307
What is a DOI?

ABSTRACT

Given an arbitrary mesh, we present a method to construct a progressive mesh (PM) such that all meshes in the PM sequence share a common texture parametrization. Our method considers two important goals simultaneously. It minimizes texture stretch (small texture distances mapped onto large surface distances) to balance sampling rates over all locations and directions on the surface. It also minimizes texture deviation (“slippage” error based on parametric correspondence) to obtain accurate textured mesh approximations. The method begins by partitioning the mesh into charts using planarity and compactness heuristics. It creates a stretch-minimizing parametrization within each chart, and resizes the charts based on the resulting stretch. Next, it simplifies the mesh while respecting the chart boundaries. The parametrization is re-optimized to reduce both stretch and deviation over the whole PM sequence. Finally, the charts are packed into a texture atlas. We demonstrate using such atlases to sample color and normal maps over several models.


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
4
 
5
6
7
 
8
 
9
10
 
11
HORMANN,K.,AND GREINER,G.MIPS - an efficient global parametrization method.Technical Report 27/1998, Universitat Erlangen-Nurnberg.
 
12
HORMANN,K.,GREINER,G.,AND CAMPAGNA,S.Hierarchical parametrization of triangulated surfaces.Vision, Modeling, and Visualization 1999 pp.219-226.
 
13
14
 
15
KALVIN,A.,AND TAYLOR,R.SuperFaces:Polyhedral approximation with bounded error.SPIE Proceedings 2164 pp.2-13,1994.
 
16
KOBBELT,L.,CAMPAGNA,S.,AND SEIDEL,H.-P.A general framework for mesh decimation.Proceedings of Graphics Interface '98 pp.43-50.
17
18
19
 
20
21
 
22
MARUYA,M.Generating texture map from object-surface texture data.Computer Graphics Forum (Proceedings of Eurographics '95) 14(3),pp.397-405.
23
 
24
 
25
 
26
SLOAN,P.-P.,WEINSTEIN,D.,AND BREDERSON,J.Importance driven texture coordinate optimization.Computer Graphics Forum (Proceedings of Eurographics '98) 17(3),pp.97-104.
 
27
SOUCY,M.,GODIN,G.,AND RIOUX,M.A texture-mapping approach for the compression of colored 3D triangulations.The Visual Computer 12,pp.503-514,1986.

CITED BY  113

Collaborative Colleagues:
Pedro V. Sander: colleagues
John Snyder: colleagues
Steven J. Gortler: colleagues
Hugues Hoppe: colleagues