?Ultimate? robustness in meshing an arbitrary polyhedron
From MaRDI portal
Publication:4446818
DOI10.1002/nme.808zbMath1035.65019MaRDI 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
algorithm; triangulation; numerical examples; Delaunay triangulation; facet partitioning; mesh of a polyhedron; robust mesh generation
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator, Generation of Delaunay meshes in implicit domains with edge sharpening, On pixel-exact rendering for high-order mesh and solution, 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, Nitsche-XFEM for the coupling of an incompressible fluid with immersed thin-walled structures, Generation of finite element mesh with variable size over an unbounded 2D domain, Recent progress in robust and quality Delaunay mesh generation, Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation, Automatic merging of tetrahedral meshes, 3D boundary recovery by constrained Delaunay tetrahedralization
Cites Work
