A template-based approach for parallel hexahedral two-refinement

Citations of this article
Mendeley users who have this article in their library.


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.




Owen, S. J., & Shih, R. M. (2015). A template-based approach for parallel hexahedral two-refinement. In Procedia Engineering (Vol. 124, pp. 31–43). Elsevier Ltd. https://doi.org/10.1016/j.proeng.2015.10.120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free