skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Abstract

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 algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher meshmore » densities smooth. Templates were introduced to allow both convex and concave refinement.« less

Authors:
 [1];  [1];
  1. Brigham Young University, Provo, UT
Publication Date:
Research Org.:
Sandia National Laboratories
Sponsoring Org.:
USDOE
OSTI Identifier:
1022219
Report Number(s):
SAND2010-5273C
TRN: US201117%%690
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the 19th International Meshing Roundtable held October 3-6, 2010 in Chatanooga, TN.
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; MESH GENERATION; SANDIA NATIONAL LABORATORIES

Citation Formats

Edgel, Jared, Benzley, Steven E, and Owen, Steven James. An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.. United States: N. p., 2010. Web.
Edgel, Jared, Benzley, Steven E, & Owen, Steven James. An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.. United States.
Edgel, Jared, Benzley, Steven E, and Owen, Steven James. Sun . "An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.". United States.
@article{osti_1022219,
title = {An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.},
author = {Edgel, Jared and Benzley, Steven E and Owen, Steven James},
abstractNote = {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 algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher mesh densities smooth. Templates were introduced to allow both convex and concave refinement.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2010},
month = {8}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: