Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Engineering with Computers
Erschienen in: Engineering with Computers 4/2016

01.10.2016 | Original Article

Parallel generation of meshes with cracks using binary spatial decomposition

verfasst von: Markos O. Freitas, Paul A. Wawrzynek, Joaquim B. Cavalcante-Neto, Creto A. Vidal, Bruce J. Carter, Luiz F. Martha, Anthony R. Ingraffea

Erschienen in: Engineering with Computers | Ausgabe 4/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This work describes a technique to generate tetrahedral meshes with cracks using parallel computers with distributed memory. This technique can be used for models without cracks as well. It employs a binary partitioning structure that uses axis-aligned planes to decompose the domain. Those decomposing planes are determined based on a refined octree that is built to estimate the amount of work necessary to generate the whole mesh, so that the amount of work in each subdomain is approximately the same. A serial advancing front technique is used in each subdomain concurrently, in such a way that the generated tetrahedra do not cross the decomposing planes. After local synchronizations, meshes are generated interfacing the subdomains. The results show that the prediction of the number of elements in each subdomain is accurate, leading to a well-balanced algorithm and to a good speed-up. Also, the meshes generated in parallel have very good quality, similar to the that of a serially generated mesh.
Vorheriger Artikel The optimal design of structures using ACO and EFG
Nächster Artikel Back analysis for rock model surrounding underground roadways in coal mine based on black hole algorithm

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Cavalcante-Neto JB, Wawrzynek PA, de Carvalho MTM, Martha LF, Ingraffea AR (2001) An algorithm for three-dimensional mesh generation for arbitrary regions with cracks. Eng Comput 17(1):75–91CrossRefMATH
2.
de Oliveira Miranda AC, Cavalcante-Neto JB, Martha LF (1999) An algorithm for two-dimensional mesh generation for arbitrary regions with cracks. In: SIBGRAPI ’99: Proceedings of the XIIBrazilian Symposium on Computer Graphics and Image Processing, pp. 29–38, IEEE Computer Society
3.
de Oliveira Miranda AC, Martha LF, Wawrzynek PA, Ingraffea AR (2009) Surface mesh regeneration considering curvatures. Eng Comput 25(2):207–219CrossRef
4.
Wu P, Houstis EN (1996) Parallel adaptive mesh generation and decomposition. Eng Comput 12(3–4):155–167CrossRef
5.
Lämmer L, Burghardt M (2000) Parallel generation of triangular and quadrilateral meshes. Adv Eng Softw 31(12):929–936CrossRefMATH
6.
Larwood BG, Weatherill NP, Hassan O, Morgan K (2003) Domain decomposition approach for parallel unstructured mesh generation. Int J Numer Methods Eng 58:177–188CrossRefMATH
7.
Ivanov EG, Andrä H, Kudryavtsev AN (2006) Domain decomposition approach for automatic parallel generation of tetrahedral grids. Comput Methods Appl Math 6(2):178–193MathSciNetCrossRefMATH
8.
Głut B, Jurczyk T (2008) Domain decomposition techniques for parallel generation of tetrahedral meshes. In: Bubak M, van Albada D, Dongarra J, Sloot P (eds) Proceedings of the International Conference on Computational Science 2008. Lecture Notes in Computer Science, vol 5101, pp 641–650, Springer, Berlin, Heidelberg
9.
Yılmaz Y, Özturan C, Tosun O, Özer AH, Soner S (2010) Parallel mesh generation, migration and partitioning for the Elmer application. Tech. Rep., PREMA-Partnership for Advanced Computing in Europe
10.
Chen J, Zhao D, Huang Z, Zheng Y, Wang D (2012) Improvements in the reliability and element quality of parallel tetrahedral mesh generation. Int J Numer Methods Eng 92(8):671–693MathSciNetCrossRef
11.
Zagaris G, Pirzadeh SZ, Chrisochoides NP (2009) A framework for parallel unstructured grid generation for practical aerodynamic simulations. In: Proceedings of the 47th AIAA Aerospace Sciences Meeting, AIAA-American Institute of Aeronautics and Astronautics
12.
Wu H, Guan X, Gong J (2011) ParaStream: a parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures. Comput Geosci 37(9):1355–1363CrossRef
13.
Topping BHV, Khan AI (1996) Subdomain generation for non-convex parallel finite element domains. Adv Eng Softw 25(2–3):253–266CrossRef
14.
Karypis G, Kumar V (1998) METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 4.0. University of Minnesota, September
15.
Karypis G, Schloegel K, Kumar V (2011) ParMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library, Version 3.2. University of Minnesota, April
16.
Chrisochoides NP, Nave D (2000) Simultaneous mesh generation and partitioning for Delaunay meshes. Math Comput Simul 54(4–5):321–339MathSciNetCrossRefMATH
17.
Linardakis L, Chrisochoides NP (2006) Delaunay decoupling method for parallel guaranteed quality planar mesh refinement. SIAM J Sci Comput 27(4):1394–1423MathSciNetCrossRefMATH
18.
Rivara M-C, Calderon C, Fedorov A, Chrisochoides NP (2006) Parallel decoupled terminal-edge bisection method for 3D mesh generation. Eng Comput 22:111–119CrossRef
19.
Ito Y, Shih AM, Erukala AK, Soni BK, Chernikov AN, Chrisochoides NP, Nakahashi K (2007) Parallel unstructured mesh generation by an advancing front method. Math Comput Simul 75(5–6):200–209MathSciNetCrossRefMATH
20.
Panitanarak T, Shontz SM (2011) MDEC: MeTiS-based domain decomposition for parallel 2D mesh generation. Proc Comput Sci 4(0):302–311. Proceedings of the International Conference on Computational Science 2011
21.
Löhner R (2014) Recent advances in parallel advancing front grid generation. Arch Comput Methods Eng 21(2):127–140MathSciNetCrossRef
22.
Hodgson DC, Jimack PK (1996) Efficient parallel generation of partitioned, unstructured meshes. Adv Eng Softw 27(1–2):59–70CrossRef
23.
Khan AI, Topping BHV (1991) Parallel adaptive mesh generation. Comput Syst Eng 2(1):75–101CrossRef
24.
Wilson JK, Topping BHV (1998) Parallel adaptive tetrahedral mesh generation by the advancing front technique. Comput Struct 68(1–3):57–78CrossRefMATH
25.
Topping BHV, Cheng B (1999) Parallel and distributed adaptive quadrilateral mesh generation. Comput Struct 73(1–5):519–536CrossRefMATH
26.
Chrisochoides NP (2005) A survey of parallel mesh generation methods. Tech. Rep. SC-2005-09, Brown University
27.
Okusanya T, Peraire J (1996) Parallel unstructured mesh generation. In: Proceedings of the 5th International Conference on Numerical Grid Generation in Computational Fluid Dynamics and Related Fields, pp. 719–729, Mississippi State University
28.
Chernikov AN, Chrisochoides NP (2006) Parallel guaranteed quality Delaunay uniform mesh refinement. SIAM J Sci Comput 28(5):1907–1926MathSciNetCrossRefMATH
29.
Lo SH (2012) Parallel Delaunay triangulation—Application to two dimensions. Finite Elem Anal Des 62:37–48MathSciNetCrossRef
30.
31.
Chernikov AN, Chrisochoides NP (2005) Parallel 2D graded guaranteed quality Delaunay mesh refinement. In: Proceedings of the 14thInternational Meshing Roundtable, (San Diego, United States), Sandia National Laboratory
32.
De Cougny HL, Shephard MS (1999) Parallel volume meshing using face removals and hierarchical repartitioning. Comput Methods Appl Mech Eng 174(3–4):275–298CrossRefMATH
33.
Löhner R (2001) A parallel advancing front grid generation scheme. Int J Numer Methods Eng 51(6):663–678CrossRefMATH
34.
Freitas MO, Wawrzynek PA, Cavalcante-Neto JB, Vidal CA, Martha LF, Ingraffea AR (2013) A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains. Adv Eng Softw 59:38–52CrossRef
35.
Batista VHF, Millman DL, Pion S, Singler J (2010) Parallel geometric algorithms for multi-core computers. Comput Geom Theory Appl 43(8):663–677MathSciNetCrossRefMATH
36.
Kohout J, Kolingerová I, Žára J (2005) Parallel Delaunay triangulation in E\(^2\) and E\(^3\) for computers with shared memory. Parallel Comput 31(5):491–522MathSciNetCrossRef
37.
Angel E (2008) Interactive computer graphics–a top-down approach using OpenGL, 5th edn. Addison Wesley, Boston
Metadaten
Titel
Parallel generation of meshes with cracks using binary spatial decomposition
verfasst von
Markos O. Freitas
Paul A. Wawrzynek
Joaquim B. Cavalcante-Neto
Creto A. Vidal
Bruce J. Carter
Luiz F. Martha
Anthony R. Ingraffea
Publikationsdatum
01.10.2016
Verlag
Springer London
Erschienen in
Engineering with Computers / Ausgabe 4/2016
Print ISSN: 0177-0667
Elektronische ISSN: 1435-5663
DOI
https://doi.org/10.1007/s00366-016-0444-3

Weitere Artikel der Ausgabe 4/2016

Engineering with Computers 4/2016 Zur Ausgabe

Original Article

The optimal design of structures using ACO and EFG

Original Article

Back analysis for rock model surrounding underground roadways in coal mine based on black hole algorithm

Original Article

Feasibility of PSO-ANN model for predicting surface settlement caused by tunneling

Original Article

Prediction-based proactive load balancing approach through VM migration

Original Article

A new hybrid ANFIS–PSO model for prediction of peak particle velocity due to bench blasting

Original Article

Modification and prediction of blast-induced ground vibrations based on both empirical and computational techniques

Neuer Inhalt

    Bildnachweise