Triangulation of arbitrary polyhedra to support automatic mesh generators
From MaRDI portal
Publication:4508071
DOI<167::AID-NME928>3.0.CO;2-L 10.1002/1097-0207(20000910/20)49:1/2<167::AID-NME928>3.0.CO;2-LzbMath0981.65024OpenAlexW2073036849MaRDI QIDQ4508071
B. K. Karamete, Mark S. Shephard, Mark W. Beall
Publication date: 21 March 2002
Full work available at URL: https://doi.org/10.1002/1097-0207(20000910/20)49:1/2<167::aid-nme928>3.0.co;2-l
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Untangling of 2D meshes in ALE simulations ⋮ A new finite element approach for solving three-dimensional problems using trimmed hexahedral elements ⋮ Variational surface reconstruction based on Delaunay triangulation and graph cut ⋮ Boundary recovery for three dimensional conforming Delaunay triangulation ⋮ 2D and 3D finite element meshing and remeshing ⋮ Recent progress in robust and quality Delaunay mesh generation ⋮ A new polyhedral element for the analysis of hexahedral-dominant finite element models and its application to nonlinear solid mechanics problems
Cites Work
