Variational tetrahedral mesh generation from discrete volume data - Archive ouverte HAL Access content directly
Journal Articles The Visual Computer Year : 2009

Variational tetrahedral mesh generation from discrete volume data

(1, 2) , (1) , (2) , (2) , (1, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
DVSNP09TVC.pdf (5.83 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00537029 , version 1 (17-11-2010)

Identifiers

  • HAL Id : hal-00537029 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More