Skip to Main content Skip to Navigation
Journal articles

Variational tetrahedral mesh generation from discrete volume data

Abstract : In this paper, we propose a novel tetrahedral mesh generation algorithm, which takes volumic data (voxels) as an input. Our algorithm performs a clustering of the original voxels within a variational framework. A vertex replaces each cluster and the set of created vertices is triangulated in order to obtain a tetrahedral mesh, taking into account both the accuracy of the representation and the elements quality. The resulting meshes exhibit good elements quality with respect to minimal dihedral angle and tetrahedra form factor. Experimental results show that the generated meshes are well suited for Finite Element Simulations.
Document type :
Journal articles
Complete list of metadata
Contributor : Sébastien Valette Connect in order to contact the contributor
Submitted on : Wednesday, November 17, 2010 - 3:12:18 PM
Last modification on : Monday, September 13, 2021 - 2:44:02 PM
Long-term archiving on: : Friday, February 18, 2011 - 3:01:14 AM


Files produced by the author(s)


  • HAL Id : hal-00537029, version 1


Julien Dardenne, Sébastien Valette, Nicolas Siauve, Noël Burais, Rémy Prost. Variational tetrahedral mesh generation from discrete volume data. The Visual Computer, Springer Verlag, 2009, 25 (5), pp.401-410. ⟨hal-00537029⟩



Record views


Files downloads