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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00537029
Contributor : Sébastien Valette <>
Submitted on : Wednesday, November 17, 2010 - 3:12:18 PM
Last modification on : Friday, May 3, 2019 - 10:38:12 AM
Long-term archiving on : Friday, February 18, 2011 - 3:01:14 AM

File

DVSNP09TVC.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00537029, version 1

Citation

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

Share

Metrics

Record views

565

Files downloads

705