carrier image

An Adaptive Grid-Based All Hexahedral Meshing Algorithm Based on 2-Refinement

Jared Edgel, Steven E. Benzley, and Steven J. Owen

Research Notes, 19th International Meshing Roundtable, Springer-Verlag, pp.Research Note, October 3-6 2010

IMR
PROCEEDINGS

19th International Meshing Roundtable
Chattanooga, Tennessee, USA.
October 3-6, 2010

Brigham Young University, Provo, Utah, U.S.A.
Email: jaredgel54@hotmail.com
Brigham Young University, Provo, Utah, U.S.A.
Email: seb@byu.edu
Sandia National Laboratoriesy, Albuquerque, NM, U.S.A.
Email: sjowen@sandia.gov

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.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article