Publication: Texture mapping progressive meshes
Open/View Files
Date
2001
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Sander, Pedro V., John Snyder, Steven J. Gortler, and Hugues Hoppe. 2001. Texture mapping progressive meshes. SIGGRAPH 2001, Los Angeles, Calif. In In Proceedings of the 28th annual conference on computer graphics and interactive techniques (SIGGRAPH 2001), August 12-17, 2001, Los Angeles, Calif., ed. SIGGRAPH and Eugene L. Fiume, 409-416. New York, N.Y.: Association for Computing Machinery.
Research Data
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.
Description
Other Available Sources
Keywords
mesh simplification, texture stretch, surface parameterization, surface flattening
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service