论文信息 - Hexahedral and Tetrahedral Mesh Untangling

Hexahedral and Tetrahedral Mesh Untangling

Abstract.We investigate a well-motivated mesh untangling objective function whose optimization automatically produces non-inverted elements when possible. Examples show the procedure is highly effective on tetrahedral meshes and on many hexahedral meshes constructed via mapping or sweeping algorithms.

Patrick M. Knupp | P. Knupp

[1] Stephen J. Wright,et al. Numerical Optimization , 2018, Fundamental Statistical Inference.

[2] Andrew C. Scott,et al. Integration of Mesh Optimization with 3D All-Hex Mesh Generation , 1999 .

[3] Cecil Armstrong,et al. Smoothing by optimisation for a quadrilateral mesh with invalid elements , 2000 .

[4] P. M. Knupp. On the ivertability of the isoparametric map , 1990 .

[5] Patrick M. Knupp. Next-Generation Sweep Tool: A Method for Generating All-Hex Meshes on Two-and-One-Half Dimensional Geometries , 1998, IMR.

[6] Scott A. Mitchell,et al. Reliable Whisker Weaving via Curve Contraction , 1999, Engineering with Computers.

[7] David Eppstein,et al. Optimal point placement for mesh smoothing , 1997, SODA '97.

[8] P. Knupp. Achieving finite element mesh quality via optimization of the jacobian matrix norm and associated qu , 2000 .

[9] S. Owen,et al. H-Morph: an indirect approach to advancing front hex meshing , 1999 .

[10] L. Freitag,et al. Local optimization-based simplicial mesh untangling and improvement. , 2000 .

[11] Patrick M. Knupp,et al. Hexahedral Mesh Untangling & Algebraic Mesh Quality Metrics , 2000, IMR.

[12] Patrick M. Knupp,et al. Tetrahedral Element Shape Optimization via the Jacobian Determinant and Condition Number , 1999, IMR.

[13] Thierry Coupez. Grandes transformations et remaillage automatique , 1991 .