Texture mapping progressive meshes

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.

[1]  Victor J. Milenkovic,et al.  Rotational polygon containment and minimum enclosure , 1998, SCG '98.

[2]  Paolo Cignoni,et al.  A general method for preserving attribute values on simplified meshes , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[3]  Pedro V. Sander,et al.  Silhouette clipping , 2000, SIGGRAPH.

[4]  Takeo Igarashi,et al.  Adaptive unwrapping for interactive texture painting , 2001, I3D '01.

[5]  Charles D. Hansen,et al.  Geometric optimization , 1993, Proceedings Visualization '93.

[6]  Richard Szeliski,et al.  The lumigraph , 1996, SIGGRAPH.

[7]  Russell H. Taylor,et al.  Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.

[8]  Bruno Lévy,et al.  Non-distorted texture mapping for sheared triangulated meshes , 1998, SIGGRAPH.

[9]  Marc Rioux,et al.  A texture-mapping approach for the compression of colored 3D triangulations , 1996, The Visual Computer.

[10]  Paolo Cignoni,et al.  A general method for preserving attribute values on simplified meshes , 1998 .

[11]  Jonathan D. Cohen,et al.  Uniform frequency images: adding geometry to images to produce space-efficient textures , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[12]  Peter-Pike J. Sloan,et al.  Importance Driven Texture Coordinate Optimization , 1998, Comput. Graph. Forum.

[13]  Peter Lindstrom,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[14]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[15]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[16]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[17]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

[18]  Yoji Kajitani,et al.  Rectangle-packing-based module placement , 1995, ICCAD.

[19]  Anne Verroust-Blondet,et al.  Interactive texture mapping , 1993, SIGGRAPH.

[20]  Jonathan B Weitzman Fingers and toes , 2002, Genome Biology.

[21]  Peter Schröder,et al.  Normal meshes , 2000, SIGGRAPH.

[22]  K. Hormann,et al.  Hierarchical Parametrization of Triangulated Surfaces , 2002 .

[23]  Hans-Peter Seidel,et al.  A General Framework for Mesh Decimation , 1998, Graphics Interface.

[24]  Dinesh Manocha,et al.  Appearance-preserving simplification , 1998, SIGGRAPH.

[25]  K. Hormann,et al.  MIPS: An Efficient Global Parametrization Method , 2000 .

[26]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[27]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

[28]  佐伯 博道,et al.  5 5,6-アチリジノ糖および抗生物貭ノジリマイシンの合成 , 1968 .

[29]  Makoto Maruya Generating a Texture Map from Object‐Surface Texture Data , 1995, Comput. Graph. Forum.