Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data
- 1 March 2012
- journal article
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 52 (3) , 427-447
Abstract
A method is proposed for the generation of three-dimensional tetrahedral meshes from incomplete, weakly structured, and inconsistent data describing a geometric model. The method is based on the construction of a piecewise smooth scalar function defining the body so that its boundary is the zero isosurface of the function. Such implicit description of three-dimensional domains can be defined analytically or can be constructed from a cloud of points, a set of cross sections, or a “soup” of individual vertices, edges, and faces. By applying Boolean operations over domains, simple primitives can be combined with reconstruction results to produce complex geometric models without resorting to specialized software. Sharp edges and conical vertices on the domain boundary are reproduced automatically without using special algorithms. Refs. 42. Figs. 25.Keywords
This publication has 29 references indexed in Scilit:
- Unstructured tetrahedral mesh generation technologyComputational Mathematics and Mathematical Physics, 2010
- Grid Generation Methods2010
- ‘Ultimate’ robustness in meshing an arbitrary polyhedronInternational Journal for Numerical Methods in Engineering, 2003
- Geometry and Topology for Mesh Generation2001
- UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVESInternational Journal of Computational Geometry & Applications, 2000
- A simple algorithm for homeomorphic surface reconstruction2000
- The digital Michelangelo project2000
- Surface Reconstruction by Voronoi FilteringDiscrete & Computational Geometry, 1999
- Unstructured grid generation using iterative point insertion and local reconnectionAIAA Journal, 1995
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987