More Web Proxy on the site http://driver.im/

article

Untangling polygonal and polyhedral meshes via mesh optimization

Authors:

Jaeyong ChungAuthors Info & Claims

Engineering with Computers, Volume 31, Issue 3

Pages 617 - 629

https://doi.org/10.1007/s00366-014-0379-5

Published: 01 July 2015 Publication History

Abstract

We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh. The second method uses a hybrid quality metric, which untangles inverted elements by simultaneously averaging element size and improving element shape. The last method using a variant of the hybrid quality metric gives a high penalty for inverted elements and employs an adaptive sigmoid function for handling various mesh sizes. Numerical experiments are presented to show the effectiveness of the proposed untangling strategies for various 2D polygonal and 3D polyhedral meshes.

References

[1]

Peric M (2004) Flow simulation using control volumes of arbitrary polyhedral shape. ERCOFTAC Bulletin (62)

[2]

Aurenhammer F (1991) Voronoi diagrams--a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345---405

Digital Library

[3]

Batdorf M, Freitag LA, Ollivier-Gooch C (1997) Computational study of the effect of unstructured mesh quality on solution efficiency,13th Annual AIAA Computational Fluid Dynamics Conference, AIAA

[4]

Garimella R, Kim J, Berndt M (2013) Polyhedral mesh generation and optimization for non-manifold domains, $22nd International Meshing Roundtable, Sandia National Laboratories, pp 239---250

[5]

Spiegel M, et al. (2009) Tetrahedral and polyhedral mesh evaluation for cerebral hemodynamic simulation--a comparison, 31st Annual International Conference of the IEEE EMBS, Sandia National Laboratories, pp 2787---2790

[6]

Escobar JM et al (2003) Simultaneous untangling and smoothing of tetrahedral meshes. Comput Methods Appl Mech Eng 192(25):2775---2787

[7]

Franks JW, Knupp PM (2010) A new strategy for untangling 2D meshes via node-movement, CSRI Summer Proceedings, Sandia National Laboratories, pp 152---165

[8]

Knupp PM (2001) Hexahedral and tetrahedral mesh untangling. Eng Comput 17(3):261---268

[9]

Dyadechko V, Garimella RV, Shashkov MJ (2004) Reference Jacobian re-zoning strategy for arbitrary Lagrangian---Eulerian methods on polyhedral grids, 13th International Meshing Roundtable, Sandia National Laboratories, pp 459---470

[10]

Sastry SP, Shontz SM, Vavasis SA (2011) A log-barrier method for mesh quality improvement, 20th International Meshing Roundtable, Sandia National Laboratories, pp 329---346

[11]

Knupp PM (2007) Updating meshes on deforming domains: an application of the target-matrix paradigm. Commun Num Meth Engr 24:467---476

[12]

Benitez D, Rodriguez E, Escobar JM, Montenegro R (2013) Performance evaluation of a parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes, 22nd International Meshing Roundtable, Sandia National Laboratories, pp 579---598

[13]

Kim J, Panitanarak T, Shontz SM (2013) A multiobjective mesh optimization framework for mesh quality improvement and mesh untangling. Int J Numer Methods Eng 94(1):20---42

[14]

Kim J, Garimella R, Berndt M (2013) A practical approach for solving mesh optimization problems using Newton's method, 22nd International Meshing Roundtable, Sandia National Laboratories

[15]

Bhowmick S, Shontz SM (2010) Towards high-quality, untangled meshes via a force-directed graph embedding approach. Proc Int Conf Comput Sci 1(1):357---366

[16]

Danczyk J, Suresh K (2012) Finite element analysis over tangled meshes, Proceeding of the ASME 2012 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Chicago, IL

[17]

Yan DM, Wenping W, Levy B (2010) Efficient computation of 3D clipped Voronoi diagram, advances in geometric modeling and processing, pp 269---282

[18]

Nocedal J, Wright S (2006) Numerical optimization. Springer, Berlin

[19]

Knupp P (2000) Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part II: A framework for volume mesh optimization. Int J Numer Methods Engrg 48:1165---1185

[20]

Danczyk J, Suresh K (2013) Finite element analysis over tangled simplicial meshes: theory and implementation. Finite Elem Anal Des 70---71:57---67

[21]

Park J, Shontz SM, Drapaca CS (2013) A combined level set/mesh warping algorithm for tracking brain and cerebrospinal fluid evolution in hydrocephalic patients. Image-based geometric modeling and mesh generation, lecture notes in computational vision and biomechanics, Springer 3:107---141

[22]

Ebeida M, Mitchell S (2011) Uniform random Voronoi meshes, 20th International Meshing Roundtable, Sandia National Laboratories

Cited By

Antonietti PBertoluzza SPrada DVerani M(2020)The virtual element method for a minimal surface problemCalcolo: a quarterly on numerical analysis and theory of computation10.1007/s10092-020-00388-057:4Online publication date: 3-Nov-2020
https://dl.acm.org/doi/10.1007/s10092-020-00388-0

Untangling polygonal and polyhedral meshes via mesh optimization
1. Computing methodologies
  1. Computer graphics
2. Theory of computation

Recommendations

A macro BDM H-div mixed finite element on polygonal and polyhedral meshes
Abstract
A BDM type of H ( div ) mixed finite element is constructed on polygonal and polyhedral meshes. The flux space is the H ( div ) subspace of the n-product Π i P k ( T i ) d space such that the divergence is a one-piece P k − 1 polynomial on the ...
Untangling of 2D meshes in ALE simulations

A procedure is presented to untangle unstructured 2D meshes containing inverted elements by node repositioning. The inverted elements may result from node movement in Arbitrary Lagrangian Eulerian (ALE) simulations of continuum mechanics problems with ...
Strategies for optimization of hexahedral meshes and their comparative study

In this work, we study several strategies based on different objective functions for optimization of hexahedral meshes. We consider two approaches to construct objective functions. The first one is based on the decomposition of a hexahedron into ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Engineering with Computers

Engineering with Computers Volume 31, Issue 3

July 2015

262 pages

ISSN:0177-0667

EISSN:1435-5663

Issue’s Table of Contents

Copyright © Copyright © 2015 Springer-Verlag London.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 2015

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Antonietti PBertoluzza SPrada DVerani M(2020)The virtual element method for a minimal surface problemCalcolo: a quarterly on numerical analysis and theory of computation10.1007/s10092-020-00388-057:4Online publication date: 3-Nov-2020
https://dl.acm.org/doi/10.1007/s10092-020-00388-0

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents