Robust structure simplification for hex Re-meshing

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

doi:10.1145/3130800.3130848

Robust structure simplification for hex Re-meshing

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

Computer Science

Research output: Contribution to journal › Conference article › peer-review

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 language	English (US)
Article number	a185
Journal	ACM Transactions on Graphics
Volume	36
Issue number	6
DOIs	https://doi.org/10.1145/3130800.3130848
State	Published - Nov 20 2017
Event	ACM SIGGRAPH Asia Conference, SA 2017 - Bangkok, Thailand Duration: Nov 27 2017 → Nov 30 2017

Keywords

Hexahedral meshing
Inversion-free.
Simplification
Singularity structure

ASJC Scopus subject areas

Computer Graphics and Computer-Aided Design

Access to Document

10.1145/3130800.3130848

Cite this

@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",

note = "Funding Information: We thank anonymous reviewers for the insightful comments. The fertility and rocker-arm models are part of the AIM@SHAPE Shape Repository. The bunny model is courtesy of Standford graphics lab. This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Funding Information: This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). We thank anonymous reviewers for the insightful comments. The fertility and rocker-arm models are part of the AIM@SHAPE Shape Repository. The bunny model is courtesy of Standford graphics lab. This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Funding Information: This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. {\textcopyright} 2017 ACM. 0730-0301/2017/11-ART185 $15.00 DOI: 10.1145/3130800.3130848; ACM SIGGRAPH Asia Conference, SA 2017 ; Conference date: 27-11-2017 Through 30-11-2017",

year = "2017",

month = nov,

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

N1 - Funding Information: We thank anonymous reviewers for the insightful comments. The fertility and rocker-arm models are part of the AIM@SHAPE Shape Repository. The bunny model is courtesy of Standford graphics lab. This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Funding Information: This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). We thank anonymous reviewers for the insightful comments. The fertility and rocker-arm models are part of the AIM@SHAPE Shape Repository. The bunny model is courtesy of Standford graphics lab. This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Funding Information: This work was supported in part by the NSF CAREER award 1652515, NSF IIS-(1524782 and 1553329), NSFC-(61272019 and 61572292), and SZ-fund (SIRI0404201431). Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. © 2017 ACM. 0730-0301/2017/11-ART185 $15.00 DOI: 10.1145/3130800.3130848

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 - Conference article

AN - SCOPUS:85038949029

SN - 0730-0301

VL - 36

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

IS - 6

M1 - a185

T2 - ACM SIGGRAPH Asia Conference, SA 2017

Y2 - 27 November 2017 through 30 November 2017

ER -

Robust structure simplification for hex Re-meshing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this