Skip to Main content Skip to Navigation

Meshing Volumes Bounded by Smooth Surfaces

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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:19:32 PM
Last modification on : Friday, January 21, 2022 - 3:09:35 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:04:50 PM


  • HAL Id : inria-00070382, version 1



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



Les métriques sont temporairement indisponibles