Guaranteed quality tetrahedral Delaunay meshing for medical images

In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. Given that the surface of the represented object is a smooth 2-manifold without boundary, we prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less than 3+2(~1.93), (b) all the boundary facets have planar angles larger than 30 degrees, (c) the symmetric (2-sided) Hausdorff distance between the object surface and mesh boundary is bounded from above by a user-specified parameter, and (d) the mesh boundary is ambient isotopic to the object surface. The first two guarantees assure that our algorithm produces elements of bounded radius-edge ratio. The last two guarantees assure that the mesh boundary is a good geometric and topological approximation of the object surface. Our method also offers control over the size of tetrahedra in the final mesh. Experimental evaluation of our algorithm on synthetic and real medical data illustrates the theory and shows the effectiveness of our method.

[1]  Hervé Delingette,et al.  Robust nonrigid registration to capture brain shift from intraoperative MRI , 2005, IEEE Transactions on Medical Imaging.

[2]  Gary L. Miller,et al.  A Delaunay based numerical method for three dimensions: generation, formulation, and partition , 1995, STOC '95.

[3]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[4]  Mariette Yvinec,et al.  Mesh Generation from 3D Multi-material Images , 2009, MICCAI.

[5]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[6]  O. Burgert,et al.  A topologically faithful, tissue-guided, spatially varying meshing strategy for computing patient-specific head models for endoscopic pituitary surgery simulation , 2006, Studies in health technology and informatics.

[7]  A. Liu,et al.  On the shape of tetrahedra from bisection , 1994 .

[8]  M. Yvinec,et al.  Variational tetrahedral meshing , 2005, SIGGRAPH 2005.

[9]  Nikos Chrisochoides,et al.  An Evaluation of Tetrahedral Mesh Generation for Nonrigid Registration of Brain MRI , 2011 .

[10]  Steve Oudot,et al.  Provably good sampling and meshing of surfaces , 2005, Graph. Model..

[11]  Benjamin B. Kimia,et al.  A formal classification of 3D medial axis points and their local geometry , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.

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

[14]  Tamal K. Dey,et al.  Approximate medial axis as a voronoi subcomplex , 2002, SMA '02.

[15]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[16]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[18]  Laurent Rineau,et al.  High-Quality Consistent Meshing of Multi-label Datasets , 2007, IPMI.

[19]  M. Yvinec,et al.  Meshing Volumes Bounded by Smooth Surfaces , 2005, IMR.

[20]  F. Chazal,et al.  Stability and homotopy of a subset of the medial axis , 2004, SM '04.

[21]  H. Si.  Constrained Delaunay tetrahedral mesh generation and refinement , 2010 .

[22]  Laurent Rineau,et al.  Meshing 3D Domains Bounded by Piecewise Smooth Surfaces* , 2007, IMR.

[23]  Xiang-Yang Li,et al.  Generating well-shaped Delaunay meshed in 3D , 2001, SODA '01.

[24]  Gary L. Miller,et al.  Data Generation for Geometric Algorithms on Non-Uniform Distributions , 1999, Int. J. Comput. Geom. Appl..

[25]  David Coeurjolly,et al.  Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Andrey N. Chernikov,et al.  Three-dimensional Semi-generalized Point Placement Method for Delaunay Mesh Refinement , 2007, IMR.

[27]  Ronald Fedkiw,et al.  A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra , 2003, IMR.

[28]  Paul-Louis George,et al.  Delaunay triangulation and meshing : application to finite elements , 1998 .

[29]  Herbert Edelsbrunner,et al.  Sliver exudation , 2000, J. ACM.

[30]  Herbert Edelsbrunner,et al.  An Experimental Study of Sliver Exudation , 2002, Engineering with Computers.

[31]  J. Shewchuk,et al.  Isosurface stuffing: fast tetrahedral meshes with good dihedral angles , 2007, SIGGRAPH 2007.

[32]  Jonathan Richard Shewchuk,et al.  Aggressive Tetrahedral Mesh Improvement , 2007, IMR.

[33]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..

[34]  Andrey N. Chernikov,et al.  Tetrahedral image-to-mesh conversion for biomedical applications , 2011, BCB '11.

[35]  Utkarsh Ayachit,et al.  The ParaView Guide: A Parallel Visualization Application , 2015 .

[36]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[37]  Scott A. Mitchell,et al.  Cardinality Bounds for Triangulations with Bounded Minimum Angle , 1994, CCCG.

[38]  Carl Ollivier-Gooch,et al.  Tetrahedral mesh improvement using swapping and smoothing , 1997 .

[39]  Pierre Alliez,et al.  Perturbing Slivers in 3D Delaunay Meshes , 2009, IMR.

[40]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.