Intersection-free tetrahedral meshing from volumetric images

High-fidelity meshes are essential in many visualisation and simulation applications. In this study, we develop an automatic approach to generate intersection-free meshes from volumetric images. Due to the properties of octree-based dual contouring, the generated elements may intersect with each other. We need a robust method to generate quality intersection-free tetrahedral meshes with no topology ambiguity. In our algorithm, we first analyse each sign-change edge or interior edge to define an envelope, and then check whether self-intersections will appear. In the end, we choose appropriate meshing technique to create intersection-free meshes. Our main contribution lies in intersection-free tetrahedral meshing for single-material and multiple-material domains, with topology ambiguities resolved by handling hybrid grids. We have applied our method to two biomedical and one microstructure data-sets and obtained good results based on our quality metrics.

[1]  Guoliang Xu,et al.  A Novel Geometric Flow-Driven Approach for Quality Improvement of Segmented Tetrahedral Meshes , 2011, IMR.

[2]  Yongjie Zhang,et al.  Resolving topology ambiguity for multiple-material domains , 2012 .

[3]  J. M. González-Yuste,et al.  Simultaneous untangling and smoothing of tetrahedral meshes , 2003 .

[4]  Siddiq M. Qidwai,et al.  Strategies for integration of 3-D experimental data with modeling and simulation , 2011 .

[5]  Michael Garland,et al.  A multiphase approach to efficient surface simplification , 2002, IEEE Visualization, 2002. VIS 2002..

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

[7]  Patrick M. Knupp,et al.  Matrix Norms & The Condition Number: A General Framework to Improve Mesh Quality Via Node-Movement , 1999, IMR.

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

[9]  Tao Ju,et al.  Manifold Dual Contouring , 2007, IEEE Transactions on Visualization and Computer Graphics.

[10]  Yongjie Zhang,et al.  3D Finite Element Meshing from Imaging Data. , 2005, Computer methods in applied mechanics and engineering.

[11]  Patrick M. Knupp,et al.  Hexahedral and Tetrahedral Mesh Untangling , 2001, Engineering with Computers.

[12]  Charlie C. L. Wang,et al.  Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes , 2011, IEEE Transactions on Automation Science and Engineering.

[13]  Chandrajit L. Bajaj,et al.  Surface Smoothing and Quality Improvement of Quadrilateral/Hexahedral Meshes with Geometric Flow , 2005, IMR.

[14]  Wei Hong,et al.  Dual contouring with topology-preserving simplification using enhanced cell representation , 2004, IEEE Visualization 2004.

[15]  Gregory M. Nielson,et al.  Dual marching cubes , 2004, IEEE Visualization 2004.

[16]  Michael Garland,et al.  Simplifying surfaces with color and texture using quadric error metrics , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[17]  Nick Chirkov Fast 3D Line Segment–Triangle Intersection Test , 2005, J. Graph. Tools.

[18]  B. Joe,et al.  Relationship between tetrahedron shape measures , 1994 .

[19]  Scott Schaefer,et al.  Dual marching cubes: primal contouring of dual grids , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..