A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
From MaRDI portal
(Redirected from Publication:502522)
Recommendations
- Octree-based reasonable-quality hexahedral mesh generation using a new set of refinement templates
- OCTREE-BASED HEXAHEDRAL MESH GENERATION
- All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
- Tetrahedron-based octree encoding for automatic mesh generation
- Hexagon-based all-quadrilateral mesh generation with guaranteed angle bounds
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
Cited in
(11)- Integrating CAD with Abaqus: a practical isogeometric analysis software platform for industrial applications
- Intercode hexahedral meshing from Eulerian to Lagrangian simulations
- HexDom: polycube-based hexahedral-dominant mesh generation
- Centroidal Voronoi tessellation based polycube construction for adaptive all-hexahedral mesh generation
- A computationally efficient isoparametric tangled finite element method for handling inverted quadrilateral and hexahedral elements
- Octree-based reasonable-quality hexahedral mesh generation using a new set of refinement templates
- OCTREE-BASED HEXAHEDRAL MESH GENERATION
- An efficient Cartesian mesh generation strategy for complex geometries
- MAT-parameterization: volumetric multi-patch parameterizations of complex domains for isogeometric analysis using mat-based decomposition
- Element-saving hexahedral 3-refinement templates
- A digraph-based hexahedral meshing method for coupled quasi-polycubes
This page was built for publication: A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502522)