A consistent octree hanging node elimination algorithm for hexahedral mesh generation

Ahmed H. Elsheikh*, Mustafa Elsheikh

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


A new algorithm for hanging node elimination in octree structures is developed. The proposed algorithm utilizes hanging node elimination by refinement templates and a new mesh conditioning technique based on decoupling templates. Refinement templates insert transition elements to eliminate hanging nodes. Decoupling templates insert circular loops in the dual mesh without introducing or removing hanging nodes. Decoupling templates are introduced to avoid full refinement in the cases that do not match any of the available refinement templates. The proposed algorithm eliminates hanging nodes for concavely refined regions without excessive refinement. Another advantage of the proposed algorithm lies in eliminating narrow gaps of coarse meshes between refined regions. This step has a positive effect on the mesh quality as it avoids introducing non-regular templates with a limited penalty of uniform refinement. The presented algorithm produces good quality meshes and provides a consistent and complete method for producing conformally refined octree structures.

Original languageEnglish
Pages (from-to)86-100
Number of pages15
JournalAdvances in Engineering Software
Publication statusPublished - Sept 2014


  • Conformal refinement
  • Decoupling templates
  • Hanging node elimination
  • Hexahedral mesh generation
  • Octree
  • Refinement templates

ASJC Scopus subject areas

  • Software
  • Engineering(all)


Dive into the research topics of 'A consistent octree hanging node elimination algorithm for hexahedral mesh generation'. Together they form a unique fingerprint.

Cite this