Abstract
Finite Element (FE) analysis is a well-established method to solve engineering problems, some of them require fine grained precision and, by consequence, huge meshes. A common bottle-neck in FE calculations is domain meshing. In this paper we discuss our implementation of a parallel-meshing tool. Firstly, we create a rough mesh with a serial procedure based on a Constrained Delaunay Triangulation; secondly, such a mesh is divided into N parts via spectral-bisection, where N is the number of available threads; and finally, the N parts are refined simultaneously by independent threads using Delaunay-refinement. Other proposals that use a thread to refine each part, need a user-defined subdivision. This approach calculates such a subdivision automatically while reducing the thread-communication overhead. Some researchers propose similar schemes using orthogonal-trees to create regular meshes in parallel, without any guaranty about element quality, while the Delaunay techniques have nice quality properties already proven [1–3]. Although this implementation uses a shared-memory scheme, it could be adapted in a distributed-memory strategy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ruppert, J.: A delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18, 548–585 (1995)
Miller, G.L., Pav, S.E., Walkington, N.J.: When and why ruppert’s algorithm works. In: IMR, pp. 91–102 (2003)
Shewchuk, J.R.: Reprint of: Delaunay refinement algorithms for triangular mesh generations. Comput. Geom. 47, 741–778 (2014)
Remacle, J.F., Lambrechts, J., Seny, B., Marchandise, E., Johnen, A., Geuzaine, C.: Blossom-quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm. Int. J. Numer. Methods Eng. 89, 1102–1119 (2012)
Mitchell, S.A., Vavasis, S.A.: Quality mesh generation in three dimensions. In: Proceedings of the Eight Annual Symposium on Computational Geometry, pp. 212–221 (1992)
Cignoni, P., Montani, C., Scopigno, R.: Dewall: A fast divide and conquer Delaunay triangulation algorithm in \(e^d\). Comput. Aided Des. 30, 333–341 (1998)
Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4, 97–108 (1989)
Chew, L.P.: Guaranteed-quality mesh generation for curved surfaces. In: Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, pp. 274–280 (1993)
Bowyer, A.: Computing Dirichlet tessellations. Comput. J. 24, 384–409 (1981)
Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for map** parallel computations. J. Sci. Comput. 16, 452–469 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Cardoso, V.E., Botello, S. (2016). Parallel Meshing for Finite Element Analysis. In: Gitler, I., Klapp, J. (eds) High Performance Computer Applications. ISUM 2015. Communications in Computer and Information Science, vol 595. Springer, Cham. https://doi.org/10.1007/978-3-319-32243-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-32243-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32242-1
Online ISBN: 978-3-319-32243-8
eBook Packages: Computer ScienceComputer Science (R0)