Variational Delaunay approach to the generation of tetrahedral finite element meshes

DOI10.1002/nme.91zbMath1011.74073OpenAlexW2164328793MaRDI QIDQ2709680

Petr Krysl, Michael Ortiz

Publication date: 2 June 2003

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.91

zbMATH Keywords

linear programming problemboundary constraintstetrahedral decompositionedge flipDelaunay empty-sphere propertyedge splittriangular facetsunconstrained Delaunay triangulationvariational Delaynay method

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Boundary element methods applied to problems in fluid mechanics (76M15) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Related Items

An algorithm of combining of advancing front and delaunay triangulation to 3-D domain tesselation ⋮ A novel energy-based approach for merging finite elements ⋮ 2D and 3D finite element meshing and remeshing

Uses Software

• DeWall
• Qhull

Cites Work

• Reliability of automatic 3D mesh generation
• A new algorithm for three-dimensional Voronoi tessellation
• Automatic mesh generator with specified boundary
• Approximating constrained tetrahedrizations
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Surface reconstruction by Voronoi filtering
• The reconstruction of boundary contours and surfaces in arbitrary unstructured triangular and tetrahedral grids
• Automatic three-dimensional mesh generation by the modified-octree technique
• Triangulation automatique d’un polyèdre en dimension $N$
• Automatic three‐dimensional mesh generation by the finite octree technique
• Volume discretization into tetrahedra—I. Verification and orientation of boundary surfaces
• Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
• Two Dimensional Interpolation from Random Data
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints