From Triangulation to Simplex Mesh and Vice-versa - A Simple and Efficient Conversion

In the field of 3D images, relevant information can be difficult to interpret without further computer-aided processing. Generally, and this is particularly true in medical imaging, a segmentation process is run and coupled with a visualization of the delineated structures. Amongst all techniques based on deformable models, simplex meshes, in particular, present good propensities to handle a large variety of shape alterations altogether with a fine resolution and stability. However, they may not be well suited to cope satisfyingly with other related tasks, such as rendering, mechanical simulation or reconstruction from iso-surfaces. As a consequence, triangle meshes are often preferred. Thus, we propose an accurate method to shift from a model to another, and conversely. For this, we are taking advantage of the fact that they are topologically duals, turning it into a natural swap between these two models. Unfortunately, they are not geometrically equivalents, leading to loss of information and to geometry deterioration when performing the conversion. Therefore, optimal positions of the vertices in the dual mesh have to be found while avoiding shape degradation. An accurate and effective transformation technique is described in this paper, where we present a direct method to perform an appropriate interpolation of a simplex mesh to obtain its dual, and/or vice-versa. This original method is based on the distance minimization between the local tangent planes of the mesh and vertices of each face. Finally, probing resulting mesh conversions in both directions are commented.

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

[2]  Marcel Breeuwer,et al.  Computational Mesh Generation for Vascular Structures with Deformable Surfaces , 2006, International Journal of Computer Assisted Radiology and Surgery.

[3]  Michael Garland,et al.  Optimal triangulation and quadric-based surface simplification , 1999, Comput. Geom..

[4]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[5]  Hervé Delingette,et al.  General Object Reconstruction Based on Simplex Meshes , 1999, International Journal of Computer Vision.

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

[7]  Marco Attene,et al.  Recent Advances in Remeshing of Surfaces , 2008, Shape Analysis and Structuring.

[8]  Xunnian Yang,et al.  Surface interpolation of meshes by geometric subdivision , 2005, Comput. Aided Des..

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

[10]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.

[11]  Andrew H. Gee,et al.  Regularised marching tetrahedra: improved iso-surface extraction , 1999, Comput. Graph..

[12]  Jerry L. Prince,et al.  Reconstruction of the human cerebral cortex from magnetic resonance images , 1999, IEEE Transactions on Medical Imaging.

[13]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.