arrow
Return

Robust Structure Simplification for Hex Re-meshing

delete2017-11-20
delete32
PRE
AI
X
Xifeng Gao *
D
Daniele Panozzo
W
Wenping Wang
Z
Zhigang Deng
陈国宁 (Guoning Chen)
DOI:10.1145/3130800.3130848delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 hexmeshes, 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
singularity structure
simplification
inversion-free
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

ACM Transactions on Graphics cover
ACM Transactions on Graphics
IF:
9.5
Papers:
4.7K
Citations:
3.6W

Organization

N
New York University
Scholars:
4.4W
Papers: 3.9W
Citations: 5.8W
U
university of houston system
Scholars:
1.4W
Papers: 1.4W
Citations: 16
U
university of houston
Scholars:
9.7K
Papers: 7.9K
Citations: 11
researcher View more organizations