?Ultimate? robustness in meshing an arbitrary polyhedron
From MaRDI portal
Publication:4446818
DOI10.1002/nme.808zbMath1035.65019OpenAlexW2053053787MaRDI QIDQ4446818
Houman Borouchaki, Paul-Louis George, Eric Saltel
Publication date: 3 February 2004
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.808
algorithmtriangulationnumerical examplesDelaunay triangulationfacet partitioningmesh of a polyhedronrobust mesh generation
Related Items (13)
On pixel-exact rendering for high-order mesh and solution ⋮ Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation ⋮ Nitsche-XFEM for the coupling of an incompressible fluid with immersed thin-walled structures ⋮ Automatic merging of tetrahedral meshes ⋮ A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ Generation of Delaunay meshes in implicit domains with edge sharpening ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Recent progress in robust and quality Delaunay mesh generation ⋮ Improved boundary constrained tetrahedral mesh generation by shell transformation ⋮ Automatic polyhedral mesh generation and scaled boundary finite element analysis of STL models ⋮ Entropy solution at concave corners and ridges, and volume boundary layer tangential adaptivity ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Cites Work
This page was built for publication: ?Ultimate? robustness in meshing an arbitrary polyhedron
