Title
Texture mapping progressive meshes
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.
Year
DOI
Venue
2001
10.1145/383259.383307
SIGGRAPH
Keywords
Field
DocType
surface parametrization,pm sequence share,common texture parametrization,resulting stretch,accurate textured mesh approximation,texture atlas,surface flattening,minimizes texture deviation,texture stretch,arbitrary mesh,progressive mesh,small texture distance,mesh simplification,texture mapping
Texture mapping,Polygon mesh,Mesh parameterization,Parametrization,Computer science,Progressive meshes,Artificial intelligence,Geometry,Computer vision,Normal mapping,Algorithm,Texture atlas,Texture filtering
Conference
ISSN
ISBN
Citations 
0097-8930
1-58113-374-X
312
PageRank 
References 
Authors
15.11
24
4
Search Limit
100312
Name
Order
Citations
PageRank
Pedro V. Sander1111163.92
John Snyder22579172.17
Steven J. Gortler34205366.17
Hugues Hoppe49563754.57