Skip to main content
Erschienen in: Structural and Multidisciplinary Optimization 3/2012

01.03.2012 | Educational Article

PolyMesher: a general-purpose mesh generator for polygonal elements written in Matlab

verfasst von: Cameron Talischi, Glaucio H. Paulino, Anderson Pereira, Ivan F. M. Menezes

Erschienen in: Structural and Multidisciplinary Optimization | Ausgabe 3/2012

Einloggen

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

search-config
loading …

Abstract

We present a simple and robust Matlab code for polygonal mesh generation that relies on an implicit description of the domain geometry. The mesh generator can provide, among other things, the input needed for finite element and optimization codes that use linear convex polygons. In topology optimization, polygonal discretizations have been shown not to be susceptible to numerical instabilities such as checkerboard patterns in contrast to lower order triangular and quadrilaterial meshes. Also, the use of polygonal elements makes possible meshing of complicated geometries with a self-contained Matlab code. The main ingredients of the present mesh generator are the implicit description of the domain and the centroidal Voronoi diagrams used for its discretization. The signed distance function provides all the essential information about the domain geometry and offers great flexibility to construct a large class of domains via algebraic expressions. Examples are provided to illustrate the capabilities of the code, which is compact and has fewer than 135 lines.

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

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!

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!

Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
For example, consider \(\Omega_{1}=\left\{ \left(x_{1},x_{2}\right)\in\mathbb{R}^{2}:x_{1}<0\right\} \) and \(\Omega_{2}=\left\{ \left(x_{1},x_{2}\right)\in\mathbb{R}^{2}:x_{2}<0\right\} \). The formula \(d_{\Omega_{1}\cup\Omega_{2}}(\mathbf{x})=\min\left(d_{\Omega_{1}}(\mathbf{x}),d_{\Omega_{2}}(\mathbf{x})\right)\) has incorrect distance “value” in the third quadrant, i.e., for x 1 < 0, x 2 < 0. In this region, the closest boundary point is the new corner x = (0, 0) formed by the union operation.
 
2
A tessellation or tiling of Δ is a collection of open sets S i such that \(\cup_{i}\overline{S}_{i}=\overline{\Delta}\) and S i  ∩ S j  = ∅ if i ≠ j.
 
3
The cell structure allows for storing vectors of different size and is therefore suitable for connectivity of polygonal elements with different number of nodes.
 
4
This small overhead can be removed after a few iterations once a good estimate value is obtained.
 
5
Since the gradation in mesh is often dictated by the geometry of the domain, it is natural that both μ and h be defined based on the distance function d Ω.
 
Literatur
Zurück zum Zitat Andreassen E, Clausen A, Schevenels M, Lazarov B, Sigmund O (2011) Efficient topology optimization in MATLAB using 88 lines of code. Struct Multidisc Optim 43(1):1–16. doi:10.1007/s00158-010-0594-7 Andreassen E, Clausen A, Schevenels M, Lazarov B, Sigmund O (2011) Efficient topology optimization in MATLAB using 88 lines of code. Struct Multidisc Optim 43(1):1–16. doi:10.​1007/​s00158-010-0594-7
Zurück zum Zitat Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405CrossRef Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405CrossRef
Zurück zum Zitat Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th national conference. ACM Press, New York, NY, pp 157–172. doi:10.1145/800195.805928 CrossRef Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th national conference. ACM Press, New York, NY, pp 157–172. doi:10.​1145/​800195.​805928 CrossRef
Zurück zum Zitat Du Q, Wang DS (2005) The optimal centroidal Voronoi tessellations and the Gersho’s conjecture in the three-dimensional space. Comput Math Appl 49(9–10):1355–1373MathSciNetMATHCrossRef Du Q, Wang DS (2005) The optimal centroidal Voronoi tessellations and the Gersho’s conjecture in the three-dimensional space. Comput Math Appl 49(9–10):1355–1373MathSciNetMATHCrossRef
Zurück zum Zitat Du Q, Gunzburger M, Ju L (2003) Constrained centroidal Voronoi tessellations for surfaces. Siam J Sci Comput 24(5):1488–1506MathSciNetMATHCrossRef Du Q, Gunzburger M, Ju L (2003) Constrained centroidal Voronoi tessellations for surfaces. Siam J Sci Comput 24(5):1488–1506MathSciNetMATHCrossRef
Zurück zum Zitat Ju L, Gunzburger M, Zhao W (2006) Adaptive finite element methods for elliptic PDEs based on conforming centroidal Voronoi-Delaunay triangulations. Siam J Sci Comput 28(6):2023–2053MathSciNetMATHCrossRef Ju L, Gunzburger M, Zhao W (2006) Adaptive finite element methods for elliptic PDEs based on conforming centroidal Voronoi-Delaunay triangulations. Siam J Sci Comput 28(6):2023–2053MathSciNetMATHCrossRef
Zurück zum Zitat Langelaar M (2007) The use of convex uniform honeycomb tessellations in structural topology optimization. In: 7th world congress on structural and multidisciplinary optimization, Seoul, South Korea, 21–25 May 2007 Langelaar M (2007) The use of convex uniform honeycomb tessellations in structural topology optimization. In: 7th world congress on structural and multidisciplinary optimization, Seoul, South Korea, 21–25 May 2007
Zurück zum Zitat Liu Y, Wang W, Levy B, Sun F, Yan D, Lu L, Yang C (2009) On centroidal Voronoi tesselleations–energy smoothness and fast computation. ACM Trans Graph 28(4):101:1–17 Liu Y, Wang W, Levy B, Sun F, Yan D, Lu L, Yang C (2009) On centroidal Voronoi tesselleations–energy smoothness and fast computation. ACM Trans Graph 28(4):101:1–17
Zurück zum Zitat Liu Z, Korvink JG, Huang R (2005) Structure topology optimization: fully coupled level set method via FEMLAB. Struct Multidisc Optim 29:407–417MathSciNetCrossRef Liu Z, Korvink JG, Huang R (2005) Structure topology optimization: fully coupled level set method via FEMLAB. Struct Multidisc Optim 29:407–417MathSciNetCrossRef
Zurück zum Zitat Osher S, Fedkiw R (2003) Level set methods and dynamic implicit surfaces. Applied mathematical sciences, vol 153. Springer-Verlag, New YorkMATH Osher S, Fedkiw R (2003) Level set methods and dynamic implicit surfaces. Applied mathematical sciences, vol 153. Springer-Verlag, New YorkMATH
Zurück zum Zitat Paulino GH, Menezes IFM, Gattass M, Mukherjee S (1994a) Node and element resequencing using the laplacian of a finite element graph: part I—general concepts and algorithm. Int J Numer Methods Eng 37(9):1511–1530. doi:10.1002/nme.1620370907 MATHCrossRef Paulino GH, Menezes IFM, Gattass M, Mukherjee S (1994a) Node and element resequencing using the laplacian of a finite element graph: part I—general concepts and algorithm. Int J Numer Methods Eng 37(9):1511–1530. doi:10.​1002/​nme.​1620370907 MATHCrossRef
Zurück zum Zitat Paulino GH, Menezes IFM, Gattass M, Mukherjee S (1994b) Node and element resequencing using the laplacian of a finite element graph: part II—implementation and numerical results. Int J Numer Methods Eng 37(9):1531–1555. doi:10.1002/nme.1620370908 CrossRef Paulino GH, Menezes IFM, Gattass M, Mukherjee S (1994b) Node and element resequencing using the laplacian of a finite element graph: part II—implementation and numerical results. Int J Numer Methods Eng 37(9):1531–1555. doi:10.​1002/​nme.​1620370908 CrossRef
Zurück zum Zitat Persson P (2006) Mesh size functions for implicit geometries and PDE-based gradient limiting. Eng Comput 22(2):95–109CrossRef Persson P (2006) Mesh size functions for implicit geometries and PDE-based gradient limiting. Eng Comput 22(2):95–109CrossRef
Zurück zum Zitat Raghavan P, Li S, Ghosh S (2004) Two scale response and damage modeling of composite materials. Finite Elem Anal Des 40(12):1619–1640CrossRef Raghavan P, Li S, Ghosh S (2004) Two scale response and damage modeling of composite materials. Finite Elem Anal Des 40(12):1619–1640CrossRef
Zurück zum Zitat Ricci A (1973) A constructive geometry for computer graphics. Comput J 16(2):157–160MATHCrossRef Ricci A (1973) A constructive geometry for computer graphics. Comput J 16(2):157–160MATHCrossRef
Zurück zum Zitat Saxena A (2008) A material-mask overlay strategy for continuum topology optimization of compliant mechanisms using honeycomb discretization. J Mech Des 130(8):082304. doi:10.1115/1.2936891 CrossRef Saxena A (2008) A material-mask overlay strategy for continuum topology optimization of compliant mechanisms using honeycomb discretization. J Mech Des 130(8):082304. doi:10.​1115/​1.​2936891 CrossRef
Zurück zum Zitat Sieger D, Alliez P, Botsch M (2010) Optimizing Voronoi diagrams for polygonal finite element computations. In: Proceedings of the 19th international meshing roundtable Sieger D, Alliez P, Botsch M (2010) Optimizing Voronoi diagrams for polygonal finite element computations. In: Proceedings of the 19th international meshing roundtable
Zurück zum Zitat Sigmund O (2001) A 99 line topology optimization code written in Matlab. Struct Multidisc Optim 21(2):120–127CrossRef Sigmund O (2001) A 99 line topology optimization code written in Matlab. Struct Multidisc Optim 21(2):120–127CrossRef
Zurück zum Zitat Sukumar N, Malsch EA (2006) Recent advances in the construction of polygonal finite element interpolants. Arch Comput Methods Eng 13(1):129–163MathSciNetMATHCrossRef Sukumar N, Malsch EA (2006) Recent advances in the construction of polygonal finite element interpolants. Arch Comput Methods Eng 13(1):129–163MathSciNetMATHCrossRef
Zurück zum Zitat Sussman M, Fatemi E, Smereka P, Osher S (1998) An improved level set method for incompressible two-phase flows. Comput Fluids 27(5–6):663–680MATHCrossRef Sussman M, Fatemi E, Smereka P, Osher S (1998) An improved level set method for incompressible two-phase flows. Comput Fluids 27(5–6):663–680MATHCrossRef
Zurück zum Zitat Talischi C, Paulino GH, Pereira A, Menezes IFM (2010) Polygonal finite elements for topology optimization: a unifying paradigm. Int J Numer Methods Eng 82(6):671–698. doi:10.1002/nme.2763 MATH Talischi C, Paulino GH, Pereira A, Menezes IFM (2010) Polygonal finite elements for topology optimization: a unifying paradigm. Int J Numer Methods Eng 82(6):671–698. doi:10.​1002/​nme.​2763 MATH
Zurück zum Zitat Talischi C, Paulino GH, Pereira A, Menezes IFM (2011) PolyTop: a Matlab implementation of a general topology optimization framework using unstructured polygonal finite element meshes. doi:10.1007/s00158-011-0696-x Talischi C, Paulino GH, Pereira A, Menezes IFM (2011) PolyTop: a Matlab implementation of a general topology optimization framework using unstructured polygonal finite element meshes. doi:10.​1007/​s00158-011-0696-x
Zurück zum Zitat Zhao H (2004) A fast sweeping method for Eikonal equations. Math Comput 74(250):603–627CrossRef Zhao H (2004) A fast sweeping method for Eikonal equations. Math Comput 74(250):603–627CrossRef
Metadaten
Titel
PolyMesher: a general-purpose mesh generator for polygonal elements written in Matlab
verfasst von
Cameron Talischi
Glaucio H. Paulino
Anderson Pereira
Ivan F. M. Menezes
Publikationsdatum
01.03.2012
Verlag
Springer-Verlag
Erschienen in
Structural and Multidisciplinary Optimization / Ausgabe 3/2012
Print ISSN: 1615-147X
Elektronische ISSN: 1615-1488
DOI
https://doi.org/10.1007/s00158-011-0706-z

Weitere Artikel der Ausgabe 3/2012

Structural and Multidisciplinary Optimization 3/2012 Zur Ausgabe

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.