Robust structure simplification for hex Re-meshing

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

Research output: Contribution to journalArticle

Abstract

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
Volume36
Issue number6
DOIs
StatePublished - Nov 20 2017

Fingerprint

Geometry
Processing

Keywords

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

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Robust structure simplification for hex Re-meshing. / Gao, Xifeng; Panozzo, Daniele; Wang, Wenping; Deng, Zhigang; Chen, Guoning.

In: ACM Transactions on Graphics, Vol. 36, No. 6, a185, 20.11.2017.

Research output: Contribution to journalArticle

Gao, Xifeng ; Panozzo, Daniele ; Wang, Wenping ; Deng, Zhigang ; Chen, Guoning. / Robust structure simplification for hex Re-meshing. In: ACM Transactions on Graphics. 2017 ; Vol. 36, No. 6.
@article{595d8dea555e4b469828993001838886,
title = "Robust structure simplification for hex Re-meshing",
abstract = "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.",
keywords = "Hexahedral meshing, Inversion-free., Simplification, Singularity structure",
author = "Xifeng Gao and Daniele Panozzo and Wenping Wang and Zhigang Deng and Guoning Chen",
year = "2017",
month = "11",
day = "20",
doi = "10.1145/3130800.3130848",
language = "English (US)",
volume = "36",
journal = "ACM Transactions on Graphics",
issn = "0730-0301",
publisher = "Association for Computing Machinery (ACM)",
number = "6",

}

TY - JOUR

T1 - Robust structure simplification for hex Re-meshing

AU - Gao, Xifeng

AU - Panozzo, Daniele

AU - Wang, Wenping

AU - Deng, Zhigang

AU - Chen, Guoning

PY - 2017/11/20

Y1 - 2017/11/20

N2 - 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.

AB - 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.

KW - Hexahedral meshing

KW - Inversion-free.

KW - Simplification

KW - Singularity structure

UR - http://www.scopus.com/inward/record.url?scp=85038949029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85038949029&partnerID=8YFLogxK

U2 - 10.1145/3130800.3130848

DO - 10.1145/3130800.3130848

M3 - Article

VL - 36

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

SN - 0730-0301

IS - 6

M1 - a185

ER -