Meshing Volumes Bounded by Smooth Surfaces - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2006

Meshing Volumes Bounded by Smooth Surfaces

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

Abstract

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The method combines a surface mesher with a volume mesher, both based on Delaunay refinement, to get a greedy algorithm that samples the interior and the boundary of the domain at once. The algorithm constructs provably-good meshes, it gives control on the size of the mesh elements through a user-defined sizing field, and it guarantees the accuracy of the approximation of the domain boundary. A noticeable feature is that the domain boundary has to be known only through an oracle that can tell whether a given point lies inside the object and whether a given line segment intersects the boundary. This makes the algorithm generic enough to be applied to a wide variety of objects, ranging from domains defined by implicit surfaces to domains defined by level-sets in 3D grey-scaled images or by point-set surfaces.
Fichier principal
Vignette du fichier
RR-5626.pdf (513.24 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070382 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070382 , version 1

Cite

Steve Oudot, Laurent Rineau, Mariette Yvinec. Meshing Volumes Bounded by Smooth Surfaces. [Research Report] RR-5626, INRIA. 2006, pp.21. ⟨inria-00070382⟩
139 View
266 Download

Share

Gmail Facebook Twitter LinkedIn More