Freeform shape representations for efficient geometry processing

The most important concepts for the handling and storage of freeform shapes in geometry processing applications are parametric representation and volumetric representations. Both have their specific advantages and drawbacks. While the algebraic complexity of volumetric representations S = {(x,y,z) | f(x,y,z) = 0} is independent from the shape complexity, the domain /spl Omega/ of a parametric representation f : /spl Omega/ /spl rarr/ S usually has to have the same structure as the surface S itself (which sometimes makes it necessary to update the domain when the surface is modified. On the other hand, the topology of a parametrically defined surface can be controlled explicitly while in a volumetric representation, the surface topology can change accidentally during deformation. A volumetric representation reduces distance queries or inside/outside tests to mere function evaluations but the geodesic neighborhood relation between surface points is difficult to resolve. As a consequence, it seems promising to combine parametric and volumetric representations to effectively exploit both advantages. A number of applications are presented and discussed where such a combination leads to efficient and numerically stable algorithms for the solution of various geometry processing tasks. These applications include: surface remeshing, mesh fairing, global error control for mesh decimation and smoothing, and topology control for level-set surfaces.

[1]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[2]  Hans-Peter Seidel,et al.  Directed Edges - A Scalable Representation for Triangle Meshes , 1998, J. Graphics, GPU, & Game Tools.

[3]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[4]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[5]  Leif Kobbelt,et al.  A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes , 2001, VMV.

[6]  Ian M. Mitchell,et al.  A hybrid particle level set method for improved interface capturing , 2002 .

[7]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

[8]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[9]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[10]  David E. Breen,et al.  Level set surface editing operators , 2002, ACM Trans. Graph..

[11]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[12]  Mark Meyer,et al.  Interactive geometry remeshing , 2002, SIGGRAPH.

[13]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998 .

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

[15]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[16]  A. Guéziec Surface simplification inside a tolerance volume , 1996 .

[17]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[18]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[19]  Greg Turk,et al.  Robust Creation of Implicit Surfaces from Polygonal Meshes , 2002, IEEE Trans. Vis. Comput. Graph..

[20]  Leif Kobbelt,et al.  Parameterization-free active contour models with topology control , 2003, The Visual Computer.

[21]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[22]  Leif Kobbelt,et al.  Piecewise Linear Approximation of Signed Distance Fields , 2003, VMV.

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

[24]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[25]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[26]  Xiao Han,et al.  A topology preserving deformable model using level sets , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[27]  Mark Meyer,et al.  Intrinsic Parameterizations of Surface Meshes , 2002, Comput. Graph. Forum.

[28]  Leif Kobbelt,et al.  Sub‐Voxel Topology Control for Level‐Set Surfaces , 2003, Comput. Graph. Forum.

[29]  Arie E. Kaufman,et al.  Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes , 1987, SIGGRAPH.

[30]  Michael Garland,et al.  Permission grids: practical, error-bounded simplification , 2002, TOGS.

[31]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[32]  Hujun Bao,et al.  A Novel Volume Constrained Smoothing Method for Meshes , 2002, Graph. Model..

[33]  KaufmanArie Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes , 1987 .

[34]  Ronald Fedkiw,et al.  Animation and rendering of complex water surfaces , 2002, ACM Trans. Graph..

[35]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[36]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods/ J. A. Sethian , 1999 .

[37]  Leif Kobbelt,et al.  Resampling Feature and Blend Regions in Polygonal Meshes for Surface Anti‐Aliasing , 2001, Comput. Graph. Forum.

[38]  Leif Kobbelt,et al.  OpenMesh: A Generic and Efficient Polygon Mesh Data Structure , 2002 .

[39]  Franco P. Preparata,et al.  Sequencing-by-hybridization revisited: the analog-spectrum proposal , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[40]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[41]  Luiz Velho,et al.  Approximate Conversion of Parametric to Implicit Surfaces , 1996, Comput. Graph. Forum.