Meshing Volumes Bounded by Smooth Surfaces

Abstract : This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher, 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 :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00097841
Contributor : Mariette Yvinec <>
Submitted on : Friday, September 22, 2006 - 3:06:21 PM
Last modification on : Tuesday, April 24, 2018 - 5:20:10 PM
Long-term archiving on: Monday, April 5, 2010 - 11:26:52 PM

Identifiers

  • HAL Id : inria-00097841, version 1

Collections

Citation

Steve Oudot, Laurent Rineau, Mariette Yvinec. Meshing Volumes Bounded by Smooth Surfaces. International Meshing Roundtable, 2005, San Diego, Californie, USA. ⟨inria-00097841⟩

Share

Metrics

Record views

338

Files downloads

231