Aggressive Tetrahedral Mesh Improvement

  • Bryan Matthew Klingner
  • Jonathan Richard Shewchuk

Summary

We present a tetrahedral mesh improvement schedule that usually creates meshes whose worst tetrahedra have a level of quality substantially better than those produced by any previous method for tetrahedral mesh generation or “mesh clean-up.” Our goal is to aggressively optimize the worst tetrahedra, with speed a secondary consideration. Mesh optimization methods often get stuck in bad local optima (poor-quality meshes) because their repertoire of mesh transformations is weak. We employ a broader palette of operations than any previous mesh improvement software. Alongside the best traditional topological and smoothing operations, we introduce a topological transformation that inserts a new vertex (sometimes deleting others at the same time). We describe a schedule for applying and composing these operations that rarely gets stuck in a bad optimum. We demonstrate that all three techniques—smoothing, vertex insertion, and traditional transformations—are substantially more effective than any two alone. Our implementation usually improves meshes so that all dihedral angles are between 31° and 149°, or (with a different objective function) between 23° and 136°

References

  1. 1.
    Pierre Alliez, David Cohen-Steiner, Mariette Yvinec, and Mathieu Desbrun. Variational Tetrahedral Meshing. ACM Transactions on Graphics 24:617–625, 2005. Special issue on Proceedings of SIGGRAPH 2005.CrossRefGoogle Scholar
  2. 2.
    Randolph E. Bank and L. Ridgway Scott. On the Conditioning of Finite Element Equations with Highly Refined Meshes. SIAM Journal on Numerical Analysis 26(6):1383–1394, December 1989.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    E. Brière de l’Isle and Paul-Louis George. Optimization of Tetrahedral Meshes. Modeling, Mesh Generation, and Adaptive Numerical Methods for Partial Differential Equations, IMA Volumes in Mathematics and its Applications, volume 75, pages 97–128. 1995.Google Scholar
  4. 4.
    Scott A. Canann, Michael Stephenson, and Ted Blacker. Optismoothing: An Optimization-Driven Approach to Mesh Smoothing. Finite Elements in Analysis and Design 13:185–190, 1993.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    James C. Cavendish, David A. Field, and William H. Frey. An Approach to Automatic Three-Dimensional Finite Element Mesh Generation. International Journal for Numerical Methods in Engineering 21(2):329–347, February 1985.CrossRefGoogle Scholar
  6. 6.
    Siu-Wing Cheng, Tamal Krishna Dey, Herbert Edelsbrunner, Michael A. Facello, and Shang-Hua Teng. Sliver Exudation. Journal of the ACM 47(5):883–904, September 2000.CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hugues L. de Cougny and Mark S. Shephard. Refinement, Derefinement, and Optimization of Tetrahedral Geometric Triangulations in Three Dimensions. Unpublished manuscript, 1995.Google Scholar
  8. 8.
    Herbert Edelsbrunner and Damrong Guoy. An Experimental Study of Sliver Exudation. Tenth International Meshing Roundtable (Newport Beach, California), pages 307–316, October 2001.Google Scholar
  9. 9.
    David A. Field. Qualitative Measures for Initial Meshes. International Journal for Numerical Methods in Engineering 47:887–906, 2000.MATHCrossRefGoogle Scholar
  10. 10.
    Lori A. Freitag, Mark Jones, and Paul Plassman. An Efficient Parallel Algorithm for Mesh Smoothing. Fourth International Meshing Roundtable (Albuquerque, New Mexico), pages 47–58, October 1995.Google Scholar
  11. 11.
    Lori A. Freitag and Carl Ollivier-Gooch. Tetrahedral Mesh Improvement Using Swapping and Smoothing. International Journal for Numerical Methods in Engineering 40(21):3979–4002, November 1997.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    William H. Frey. Selective Refinement: A New Strategy for Automatic Node Placement in Graded Triangular Meshes. International Journal for Numerical Methods in Engineering 24(11):2183–2200, November 1987.MATHCrossRefGoogle Scholar
  13. 13.
    L. R. Hermann. Laplacian-Isoparametric Grid Generation Scheme. Journal of the Engineering Mechanics Division of the American Society of Civil Engineers 102:749–756, October 1976.Google Scholar
  14. 14.
    P. Jamet. Estimations d’Erreur pour des Élements Finis Droits Presque Dégénérés. RAIRO Analyse Numérique 10:43–61, 1976.MathSciNetGoogle Scholar
  15. 15.
    Barry Joe. Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations. SIAM Journal on Scientific Computing 16(6):1292–1307, November 1995.MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    G. T. Klincsek. Minimal Triangulations of Polygonal Domains. Annals of Discrete Mathematics 9:121–123, 1980.MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Michal Křížek. On the Maximum Angle Condition for Linear Tetrahedral Elements. SIAM Journal on Numerical Analysis 29(2):513–520, April 1992.MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    François Labelle and Jonathan Richard Shewchuk. Isosurface Stuffing: Fast Tetrahedral Meshes with Good Dihedral Angles. ACM Transactions on Graphics 26(3), August 2007. Special issue on Proceedings of SIGGRAPH 2007.Google Scholar
  19. 19.
    V. N. Parthasarathy, C. M. Graichen, and A. F. Hathaway. A Comparison of Tetrahedron Quality Measures. Finite Elements in Analysis and Design 15(3):255–261, January 1994.CrossRefGoogle Scholar
  20. 20.
    V. N. Parthasarathy and Srinivas Kodiyalam. A Constrained Optimization Approach to Finite Element Mesh Smoothing. Finite Elements in Analysis and Design 9:309–320, 1991.MATHCrossRefGoogle Scholar
  21. 21.
    Joachim Schöberl. NETGEN: An Advancing Front 2D/3D-Mesh Generator Based on Abstract Rules. Computing and Visualization in Science 1(1):41–52, July 2007.Google Scholar
  22. 22.
    Jonathan Richard Shewchuk. Tetrahedral Mesh Generation by Delaunay Refinement. Proceedings of the Fourteenth Annual Symposium on Computational Geometry (Minneapolis, Minnesota), pages 86–95, June 1998.Google Scholar
  23. 23.
    Jonathan Richard Shewchuk Two Discrete Optimization Algorithms for the Topological Improvement of Tetrahedral Meshes. Unpublished manuscript at http://www.cs.cmu.edu/∼jrs/jrspapers.html, 2002.Google Scholar
  24. 24.
    Jonathan Richard Shewchuk What Is a Good Linear Element? Interpolation, Conditioning, and Quality Measures. Eleventh International Meshing Roundtable (Ithaca, New York), pages 115–126, September 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Bryan Matthew Klingner
    • 1
  • Jonathan Richard Shewchuk
    • 1
  1. 1.University of CaliforniaBerkeley

Personalised recommendations