A Template-Based Approach for Parallel Hexahedral Two-Refinement

In this work we provide a template-based approach for generating locally refined all-hex meshes. We focus specifically on refinement of initially structured grids utilizing a 2-refinement approach where uniformly refined hexes are subdivided into eight child elements. The refinement algorithm consis...

Full description

Saved in:
Bibliographic Details
Main Authors: Owen, Steven J., Shih, Ryan M.
Format: Conference Proceeding
Language:English
Subjects:
2-refinement
adaptivity
hexahedron
mesh refinement
parallel
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we provide a template-based approach for generating locally refined all-hex meshes. We focus specifically on refinement of initially structured grids utilizing a 2-refinement approach where uniformly refined hexes are subdivided into eight child elements. The refinement algorithm consists of identifying marked nodes that are used as the basis for a set of four simple refinement templates. The target application for 2-refinement is a parallel grid-based all-hex meshing tool for high performance computing in a distributed environment. The result is a parallel consistent locally refined mesh requiring minimal communication and where minimum mesh quality is greater than scaled Jacobian 0.4 prior to smoothing.
ISSN:1877-7058
1877-7058
DOI:10.1016/j.proeng.2015.10.120