A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
From MaRDI portal
Publication:502522
DOI10.1016/j.cma.2012.12.020zbMath1352.65621OpenAlexW2040704680MaRDI QIDQ502522
Xinghua Liang, Guo-liang Xu, Yongjie Jessica Zhang
Publication date: 5 January 2017
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2012.12.020
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (max. 100)
Integrating CAD with Abaqus: a practical isogeometric analysis software platform for industrial applications ⋮ An efficient Cartesian mesh generation strategy for complex geometries ⋮ A computationally efficient isoparametric tangled finite element method for handling inverted quadrilateral and hexahedral elements ⋮ A digraph-based hexahedral meshing method for coupled quasi-polycubes ⋮ Intercode hexahedral meshing from Eulerian to Lagrangian simulations ⋮ HexDom: polycube-based hexahedral-dominant mesh generation
This page was built for publication: A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
