A MATLAB code of node-based topology optimization in 3D arbitrary domain for additive manufacturing
- Authors
- Kim, Dongjin; Ji, Yonghwa; Lee, Jaewook; Yoo, Jeonghoon; Min, Seungjae; Jang, In Gwun
- Issue Date
- Nov-2022
- Publisher
- SPRINGER
- Keywords
- Topology optimization; Additive manufacturing; 3D arbitrary design domain; Education
- Citation
- STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, v.65, no.11, pp.1 - 17
- Indexed
- SCIE
SCOPUS
- Journal Title
- STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
- Volume
- 65
- Number
- 11
- Start Page
- 1
- End Page
- 17
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172914
- DOI
- 10.1007/s00158-022-03339-1
- ISSN
- 1615-147X
- Abstract
- This paper presents a MATLAB code for node-based topology optimization that can handle a design problem with a three-dimensional (3D) arbitrary-shaped domain. For the meshing of arbitrary geometry, an open-source 3D mesh generator, GMSH, is utilized in this work. Here, a linear four-noded tetrahedral element is utilized due to its advantage in mesh generation. A MATLAB program is composed of three procedures. The pre-processing aims to import mesh and input files into MATLAB workspace. In the main processing, node-based topology optimization is carried out with the well-established three-field projection scheme. The post-processing aims to generate a Computer-Aided Design (CAD) file in an STL format. For this, the zero-level set of filtered density field is utilized to define the boundary of a topology optimization result. From the STL format CAD file, a design result is fabricated using additive manufacturing machines. The effectiveness of the MATLAB code is examined through three design examples including a simply supported beam, bridge, and airplane bearing bracket.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 미래자동차공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172914)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.