Spherical parametrization and remeshing

Recently, Gu et al. [2002] introduced geometry images, in which geometry is resampled into a completely regular 2D grid. The process involves cutting the surface into a disk using a network of cut paths, and then mapping the boundary of this disk to a square. Both geometry and other signals are stored as 2D grids, with grid samples in implicit correspondence, obviating the need to store a parametrization. Also, the boundary parametrization makes both geometry and textures seamless. The traditional approach for parametrizing a surface involves cutting it into charts and mapping these piecewise onto a planar domain. We introduce a robust technique for directly parametrizing a genus-zero surface onto a spherical domain. A key ingredient for making such a parametrization practical is the minimization of a stretch-based measure, to reduce scaledistortion and thereby prevent undersampling. Our second contribution is a scheme for sampling the spherical domain using uniformly subdivided polyhedral domains, namely the tetrahedron, octahedron, and cube. We show that these particular semiregular samplings can be conveniently represented as completely regular 2D grids, i.e. geometry images. Moreover, these images have simple boundary extension rules that aid many processing operations. Applications include geometry remeshing, level-ofdetail, morphing, compression, and smooth surface subdivision. In all three approaches, the surface is first cut into one or more disk-like charts using a network of cut paths, and a parametrization is formed piecewise on each chart. The a priori construction of the chart boundaries or cut paths is heuristic, and constrains the quality of the attainable parametrization. In texture atlases, both the number of charts and their surface extents are selected heuristically to minimize parametric distortion onto planar polygons, while also maintaining good packing efficiency. In semi-regular remeshing, surface charts are selected to have low-distortion maps onto regular domain faces, and to have approximately the same size. Finally, in geometry images, the surface is heuristically cut into a disk that hopefully maps well onto a square.

[1]  Ned Greene,et al.  Environment Mapping and Other Applications of World Projections , 1986, IEEE Computer Graphics and Applications.

[2]  Greg Turk,et al.  Generating random points in triangles , 1990 .

[3]  Wayne E. Carlson,et al.  Shape transformation for polyhedral objects , 1992, SIGGRAPH.

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

[5]  James Arvo,et al.  Stratified sampling of spherical triangles , 1995, SIGGRAPH.

[6]  Peter Schröder,et al.  Spherical wavelets: efficiently representing functions on the sphere , 1995, SIGGRAPH.

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

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

[9]  Dinesh Manocha,et al.  Appearance-preserving simplification of polygonal models , 1998 .

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

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

[12]  Ayellet Tal,et al.  Polyhedron realization for shape transformation , 1998, The Visual Computer.

[13]  R. Staunton Hexagonal Sampling in Image Processing , 1999 .

[14]  Hans-Peter Seidel,et al.  A Shrink Wrapping Approach to Remeshing Polygonal Surfaces , 1999, Comput. Graph. Forum.

[15]  Marc Alexa,et al.  Merging polyhedral shapes with scattered features , 1999, Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications.

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

[17]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[18]  Hujun Bao,et al.  Interactive texture mapping for polygonal models , 2000, Comput. Geom..

[19]  Guillermo Sapiro,et al.  Conformal Surface Parameterization for Texture Mapping , 1999 .

[20]  Zoë J. Wood,et al.  Semi-regular mesh extraction from volumes , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[21]  Gábor Székely,et al.  Parameterization of closed surfaces for parametric surface description , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[22]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[23]  Craig Gotsman,et al.  Texture Mapping with Hard Constraints , 2001, Comput. Graph. Forum.

[24]  Samuel R. Buss,et al.  Spherical averages and applications to spherical splines and interpolation , 2001, TOGS.

[25]  Dani Lischinski,et al.  Bounded-distortion piecewise mesh parameterization , 2002, IEEE Visualization, 2002. VIS 2002..

[26]  Bruno Lévy,et al.  Least squares conformal maps for automatic texture atlas generation , 2002, ACM Trans. Graph..

[27]  Marc Alexa,et al.  Recent Advances in Mesh Morphing , 2002, Comput. Graph. Forum.

[28]  Cindy Grimm Simple Manifolds for Surface Modeling and Parameterization , 2002, Shape Modeling International.

[29]  Pedro V. Sander,et al.  Signal-Specialized Parametrization , 2002, Rendering Techniques.

[30]  John C. Hart,et al.  Seamster: inconspicuous low-distortion texture seam layout , 2002, IEEE Visualization, 2002. VIS 2002..

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

[32]  Cindy Grimm Simple Manifolds for Surface Modeling and Parameterization (figures 3 and 6) , 2002, Shape Modeling International.

[33]  Jung-Hong Chuang Consistent Mesh Parametrizations and Remeshing Consistent Mesh Parametrizations and Remeshing , 2003 .

[34]  Alla Sheffer,et al.  Fundamentals of spherical parameterization for 3D meshes , 2003, ACM Trans. Graph..

[35]  Nira Dyn,et al.  Robust Spherical Parameterization of Triangular Meshes , 2004, Computing.