Triangulation of arbitrary polyhedra to support automatic mesh generators

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0207(20000910/20)49:1/2<167::AID-NME928>3.0.CO;2-L" /><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

zbMATH Keywords

algorithmsDelaunay triangulationunstructured mesh generation

Mathematics Subject Classification ID

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 (7)

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

• Unnamed Item

This page was built for publication: Triangulation of arbitrary polyhedra to support automatic mesh generators