Mesh Optimization for Polygonized Isosurfaces

In this paper, we propose a method for improvement of isosurface polygonizations. Given an initial polygonization of an isosurface, we introduce a mesh evolution process initialized by the polygonization. The evolving mesh converges quickly to its limit mesh which provides with a high quality approximation of the isosurface even if the isosurface has sharp features, boundary, complex topology. To analyze how close the evolving mesh approaches its destined isosurface, we introduce error estimators measuring the deviations of the mesh vertices from the isosurface and mesh normals from the isosurface normals. A new technique for mesh editing with isosurfaces is also proposed. In particular, it can be used for creating carving effects.

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

[2]  Demetri Terzopoulos,et al.  Topology adaptive deformable surfaces for medical image volume segmentation , 1999, IEEE Transactions on Medical Imaging.

[3]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[4]  Johan Montagnat,et al.  Representation, shape, topology and evolution of deformable surfaces. Application to 3D medical imag , 2000 .

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

[6]  Alexander A. Pasko,et al.  Dynamic meshes for accurate polygonization of implicit surfaces with sharp features , 2001, Proceedings International Conference on Shape Modeling and Applications.

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

[8]  Yutaka Ohtake,et al.  Polyhedral surface smoothing with simultaneous mesh regularization , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

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

[10]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[11]  David Mumford,et al.  Filtering, Segmentation and Depth , 1993, Lecture Notes in Computer Science.

[12]  Gabriel Taubin,et al.  Geometric Signal Processing on Polygonal Meshes , 2000, Eurographics.

[13]  Valery Adzhiev,et al.  HyperFun project: a framework for collaborative multidimensional F-rep modeling , 2000 .

[14]  A. Barr,et al.  Discrete Differential-Geometry Operators in n D , 2000 .

[15]  William Schroeder,et al.  The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .

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

[17]  Martin Rumpf,et al.  Anisotropic geometric diffusion in surface processing , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[18]  David E. Breen,et al.  Semi-regular mesh extraction from volumes , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[19]  Robert M. O'Bara,et al.  Geometrically deformed models: a method for extracting closed geometric models form volume data , 1991, SIGGRAPH.