Abstract
We discuss an innovative, simple and effective Lepp terminal-star algorithm for improving tetrahedral meshes. For each bad quality tetrahedron, one branch of the longest edge propagating path (Lepp) is followed to find an associated terminal star, which is a set of tetrahedra that share a common longest edge (terminal edge). Three alternative improvement mesh operations are considered: simple insertion of the centroid Q of the terminal star, or swapping of the terminal edge, or longest edge bisection. The operation that most improves the mesh is performed whenever significant improvement is achieved. Empirical study shows that, using the dihedral angle quality measure, this simple procedure reduces the bad quality tetrahedra by at least a tenth, with low time cost.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
C. Bedregal, M.C. Rivara, Longest-edge algorithms for size-optimal refinement of triangulations. Comput. Aided Des. 46, 246–251 (2014)
J. Castaños, J. Savage, PARED: a framework for the adaptive solution of PDEs, in High Performance Distributed Computing, 1999. Proceedings of the Eighth International Symposium on IEEE, 1999, pp. 133–140
L. Chen, M. Holst, Efficient mesh optimization schemes based on optimal Delaunay triangulations. Comput. Methods Appl. Mech. Eng. 200, 967–984 (2011)
F. Dassi, L. Kamenski, H. Si, Tetrahedral mesh improvement using moving mesh smoothing and lazy searching flips, in 25th International Meshing Roundtable. Procedia Engineering, vol. 163, 2016, pp. 302–314
H. Edelsbrunner, D. Guoy, An experimental study of sliver exudation. Eng. Comput. 18, 229–240 (2002)
L.A. Freitag, C. Ollivier-Gooch, Tetrahedral mesh improvement using swapping and smoothing. Int. J. Numer. Methods Eng. 40, 3979–4002 (1997)
M. Jones, P. Plassmann, Adaptive refinement of unstructured finite-element meshes. Finite Elem. Anal. Des. 25, 41–60 (1997)
B.M. Klingner, J.R. Shewchuk, Aggressive tetrahedral mesh improvement, in Proceedings 16th International Meshing Roundtable (Springer, Berlin, 2008), pp. 3–23
M.K. Misztal, J.A. Bærentzen, F. Anton, K. Erleben, Tetrahedral mesh improvement using multi-face retriangulation, in Proceedings of the 18th International Meshing Roundtable, ed. by B.W. Clark (Springer, Berlin, 2009), pp. 539–V555
M.C. Rivara, Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. Int. J. Numer. Methods Eng. 20, 745–756 (1984)
M.C. Rivara, New longest-edge algorithms for the refinement and/or improvement of un-structured triangulations. Int. J. Numer. Methods Eng. 40, 3313–3324 (1997)
M.C. Rivara, Lepp-bisection algorithms, applications and mathematical properties. Appl. Numer. Math. 59, 2218–2235 (2009)
M.C. Rivara, C. Levin, A 3-D refinement algorithm suitable for adaptive and multi-grid techniques. Commun. Appl. Numer. Methods 8, 281–290 (1992)
M.C. Rivara, M. Palma, New LEPP algorithms for quality polygon and volume triangulation: implementation issues and practical behavior, in Trends in Unstructured Mesh Generation, AMD-Vol. 220, ed. by S.A. Canann, S. Saigal (ASME, New York, 1997), pp. 1–9
M.C. Rivara, P.A. Rodriguez-Moreno, Tuned terminal triangles centroid Delaunay algorithm for quality triangulation, in Proceedings of the 27th International Meshing Roundtable, Al-buquerque (2018)
M.C. Rivara, C. Calderon, A. Fedorov, N. Chrisochoides, Parallel decoupled terminal-edge bisection method for 3D mesh generation. Eng. Comput. 22, 111–119 (2009)
P. Rodriguez-Moreno, Parallel Lepp-based algorithms for the generation and refinement of 2D and 3D triangulations, PhD thesis, Department of Computer Science, University of Chile, 160 pages, 2015
R. Williams, Adaptive parallel meshes with complex geometry, in Numerical Grid Generation in Computational Fluid Dynamics and related Fields (Elsevier, Amsterdam, 1991), pp. 201–213
Acknowledgements
Work partially supported by Departamento de Ciencias de la Computación, Universidad de Chile, and research Project DIUBB 172115 4/R, Universidad del Bío Bío. We are grateful to the referees who contributed to the improvement of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Balboa, F., Rodriguez-Moreno, P., Rivara, MC. (2019). Terminal Star Operations Algorithm for Tetrahedral Mesh Improvement. In: Roca, X., Loseille, A. (eds) 27th International Meshing Roundtable. IMR 2018. Lecture Notes in Computational Science and Engineering, vol 127. Springer, Cham. https://doi.org/10.1007/978-3-030-13992-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-13992-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13991-9
Online ISBN: 978-3-030-13992-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)