A template-based approach for parallel hexahedral two-refinement

Owen, Steven J.; Shih, Ryan M.; Ernst, Corey D.

doi:10.1016/j.cad.2016.09.005

Title: A template-based approach for parallel hexahedral two-refinement

Full Record
Other Related Research

Abstract

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.

Authors:

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

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

Publication Date:: Mon Oct 17 00:00:00 EDT 2016

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1339291

Alternate Identifier(s):: OSTI ID: 1411846

Report Number(s):: SAND-2016-1857J
Journal ID: ISSN 0010-4485; PII: S0010448516301117

Grant/Contract Number:: AC04-94AL85000

Resource Type:: Accepted Manuscript

Journal Name:: Computer Aided Design

Additional Journal Information:: Journal Name: Computer Aided Design; Journal ID: ISSN 0010-4485

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; hexahedron; mesh refinement; 2-refinement; adaptivity; parallel

Citation Formats


                    Owen, Steven J., Shih, Ryan M., and Ernst, Corey D. A template-based approach for parallel hexahedral two-refinement.  United States: N. p., 2016. 
Web.  doi:10.1016/j.cad.2016.09.005.

Copy to clipboard


                    Owen, Steven J., Shih, Ryan M., & Ernst, Corey D. A template-based approach for parallel hexahedral two-refinement.  United States.  https://doi.org/10.1016/j.cad.2016.09.005

Copy to clipboard


                    Owen, Steven J., Shih, Ryan M., and Ernst, Corey D. Mon .  
"A template-based approach for parallel hexahedral two-refinement".  United States.  https://doi.org/10.1016/j.cad.2016.09.005.  https://www.osti.gov/servlets/purl/1339291.

Copy to clipboard


                    
@article{osti_1339291,

  title        = {A template-based approach for parallel hexahedral two-refinement},

  author       = {Owen, Steven J. and Shih, Ryan M. and Ernst, Corey D.},

  abstractNote = {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.},

  doi          = {10.1016/j.cad.2016.09.005},

  journal      = {Computer Aided Design},

  number       = ,

  volume       = ,

  place        = {United States},

  year         = {Mon Oct 17 00:00:00 EDT 2016},

  month        = {Mon Oct 17 00:00:00 EDT 2016}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1016/j.cad.2016.09.005

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 7 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Conformal refinement of all-hexahedral element meshes based on multiple twist plane insertion.

Conference Harris, Nathan J ; Benzley, Steven E ; Owen, Steven James

This paper presents an automated tool for local, conformal refinement of all-hexahedral meshes based on the insertion of multi-directional twist planes into the spatial twist continuum. The refinement process is divided into independent refinement steps. In each step, an inserted twist plane modifies a single sheet or two parallel hex sheets. Six basic templates, chosen and oriented based on the number of nodes selected for refinement, replace original mesh elements. The contributions of this work are (1) the localized refinement of mesh regions defined by individual or groups of nodes, element edges, element faces or whole elements within an all-hexahedralmore »« less
An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Conference Edgel, Jared ; Benzley, Steven E ; Owen, Steven James

Most adaptive mesh generation algorithms employ a 3-refinement method. This method, although easy to employ, provides a mesh that is often too coarse in some areas and over refined in other areas. Because this method generates 27 new hexes in place of a single hex, there is little control on mesh density. This paper presents an adaptive all-hexahedral grid-based meshing algorithm that employs a 2-refinement method. 2-refinement is based on dividing the hex to be refined into eight new hexes. This method allows a greater control on mesh density when compared to a 3-refinement procedure. This adaptive all-hexahedral meshing algorithmmore »« less
Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.

Technical Report Staten, Matthew L ; Owen, Steven James

Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining amore »« less
https://doi.org/10.2172/1008123

Full Text Available
Local topological modification of hexahedral meshes using dual-based operations : progress and application.

Conference Tautges, Timothy James

Local topological modification is widely used to improve mesh quality after automatic generation of tetrahedral and quadrilateral meshes. These same techniques are also used to support adaptive refinement of these meshes. In contrast, few methods are known for locally modifying the topology of hexahedral meshes. Most efforts to do this have been based on fixed transition templates or global refinement. In contrast, a dual-based 'pillowing' method has been used which, while local, is still quite restricted in its application, and is typically applied in a template-based fashion. In this presentation, I will describe the generalization of a dual-based approach tomore »« less
Adaptive mesh refinement for steady flows in Nek5000

Journal Article Offermans, N. ; Peplinski, A. ; Marin, O. ; ... - Computers and Fluids

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based onmore »« less
Cited by 10
https://doi.org/10.1016/j.compfluid.2019.104352

Full Text Available

Similar Records