In: 7th world congress on structural and multidisciplinary optimization, Seoul, South Korea, 21– Langelaar M (2007) The use of convex uniform honeycomb tessellations in structural topology optimization. Ju L, Gunzburger M, Zhao W (2006) Adaptive finite element methods for elliptic PDEs based on conforming centroidal Voronoi-Delaunay triangulations. Huang Y, Qin H, Wang D (2008) Centroidal Voronoi tessellation-based finite element superconvergence. Siam J Sci Comput 24(5):1488–1506ĭu Q, Emelianenko M, Ju LL (2006) Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations. Siam Rev 41(4):637–676ĭu Q, Gunzburger M, Ju L (2003) Constrained centroidal Voronoi tessellations for surfaces. Comput Math Appl 49(9–10):1355–1373ĭu Q, Faber V, Gunzburger M (1999) Centroidal Voronoi tessellations: applications and algorithms. doi: 10.1016/S0096-3003(01)00260-0ĭu Q, Wang DS (2005) The optimal centroidal Voronoi tessellations and the Gersho’s conjecture in the three-dimensional space. doi: 10.1145/800195.805928ĭu Q, Gunzburger M (2002) Grid generation and optimization based on centroidal Voronoi tessellations. In: Proceedings of the 24th national conference. doi: 10.1007/s0015-0Ĭuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. ACM Comput Surv 23(3):345–405īolander JE, Saito S (1998) Fracture analyses using spring networks with random geometry. doi: 10.1007/s0015-7Īurenhammer F (1991) Voronoi diagrams-a survey of a fundamental geometric data structure. doi: 10.1007/s0015-yĪndreassen E, Clausen A, Schevenels M, Lazarov B, Sigmund O (2011) Efficient topology optimization in MATLAB using 88 lines of code. Examples are provided to illustrate the capabilities of the code, which is compact and has fewer than 135 lines.Īllaire G, Jouve F (2005) A level-set method for vibration and multiple loads structural optimization. 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. The main ingredients of the present mesh generator are the implicit description of the domain and the centroidal Voronoi diagrams used for its discretization. Also, the use of polygonal elements makes possible meshing of complicated geometries with a self-contained Matlab code. 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. The mesh generator can provide, among other things, the input needed for finite element and optimization codes that use linear convex polygons. We present a simple and robust Matlab code for polygonal mesh generation that relies on an implicit description of the domain geometry.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |