Robust structure simplification for hex Re-meshing

Xifeng Gao, Daniele Panozzo, Wenping Wang, Zhigang Deng, Guoning Chen

Research output: Contribution to journalConference articlepeer-review


We introduce a robust and automatic algorithm to simplify the structure and reduce the singularities of a hexahedral mesh. Our algorithm interleaves simplification operations to collapse sheets and chords of the base complex of the input mesh with a geometric optimization, which improves the elements quality. All our operations are guaranteed not to introduce elements with negative Jacobians, ensuring that our algorithm always produces valid hex-meshes, and not to increase the Hausdorff distance from the original shape more than a user-defined threshold, ensuring a faithful approximation of the input geometry. Our algorithm can improve meshes produced with any existing hexahedral meshing algorithm - we demonstrate its effectiveness by processing a dataset of 194 hex-meshes created with octree-based, polycube-based, and field-aligned methods.

Original languageEnglish (US)
Article numbera185
JournalACM Transactions on Graphics
Issue number6
StatePublished - Nov 20 2017
EventACM SIGGRAPH Asia Conference, SA 2017 - Bangkok, Thailand
Duration: Nov 27 2017Nov 30 2017


  • Hexahedral meshing
  • Inversion-free.
  • Simplification
  • Singularity structure

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Robust structure simplification for hex Re-meshing'. Together they form a unique fingerprint.

Cite this