A template-based approach for parallel hexahedral two-refinement

Journal Article · Mon Oct 17 00:00:00 EDT 2016 · Computer Aided Design

DOI:https://doi.org/10.1016/j.cad.2016.09.005· OSTI ID:1339291

Owen, Steven J. ^[1]; Shih, Ryan M. ^[2]; Ernst, Corey D. ^[3]

---

1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2. Univ. of California, Berkeley, CA (United States)
3. Elemental Technologies, American Fork, UT (United States)

Here, 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.3 prior to smoothing.

• Research Organization: Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• Grant/Contract Number: AC04-94AL85000
• OSTI ID: 1339291
• Alternate ID(s): OSTI ID: 1411846
• Report Number(s): SAND--2016-1857J; PII: S0010448516301117
• Journal Information: Computer Aided Design, Journal Name: Computer Aided Design; ISSN 0010-4485
• Publisher: Elsevier
• Country of Publication: United States
• Language: English

Related Subjects

2-refinement
97 MATHEMATICS AND COMPUTING
adaptivity
hexahedron
mesh refinement
parallel