Premium
H‐Morph: an indirect approach to advancing front hex meshing
Author(s) -
Owen Steven J.,
Saigal Sunil
Publication year - 2000
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/1097-0207(20000910/20)49:1/2<289::aid-nme934>3.0.co;2-l
Subject(s) - hexahedron , tetrahedron , quadrilateral , mesh generation , geometry , finite element method , volume mesh , boundary (topology) , mathematics , delaunay triangulation , computer science , computational science , topology (electrical circuits) , algorithm , engineering , structural engineering , mathematical analysis , combinatorics
H‐Morph is a new automatic algorithm for the generation of a hexahedral‐dominant finite element mesh for arbitrary volumes. The H‐Morph method starts with an initial tetrahedral mesh and systematically transforms and combines tetrahedra into hexahedra. It uses an advancing front technique where the initial front consists of a set of prescribed quadrilateral surface facets. Fronts are individually processed by recovering each of the six quadrilateral faces of a hexahedron from the tetrahedral mesh. Recovery techniques similar to those used in boundary constrained Delaunay mesh generation are used. Tetrahedra internal to the six hexahedral faces are then removed and a hexahedron is formed. At any time during the H‐Morph procedure a valid mixed hexahedral–tetrahedral mesh is in existence within the volume. The procedure continues until no tetrahedra remain within the volume, or tetrahedra remain which cannot be transformed or combined into valid hexahedral elements. Any remaining tetrahedra are typically towards the interior of the volume, generally a less critical region for analysis. Transition from tetrahedra to hexahedra in the final mesh is accomplished through pyramid‐shaped elements. Advantages of the proposed method include its ability to conform to an existing quadrilateral surface mesh, its ability to mesh without the need to decompose or recognize special classes of geometry, and its characteristic well‐aligned layers of elements parallel to the boundary. Example test cases are presented on a variety of models. Copyright © 2000 John Wiley & Sons, Ltd.