z-logo
Premium
A new scheme for efficient and direct shape optimization of complex structures represented by polygonal meshes
Author(s) -
Shen Jie,
Yoon David
Publication year - 2003
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.859
Subject(s) - polygon mesh , mathematical optimization , volume mesh , shape optimization , scheme (mathematics) , computer science , boundary (topology) , variable (mathematics) , optimization problem , mathematics , algorithm , mesh generation , topology (electrical circuits) , geometry , finite element method , structural engineering , engineering , mathematical analysis , combinatorics
In this paper, a new shape optimization approach is proposed to provide an efficient optimization solution of complex structures represented by polygonal meshes. Our approach consists of three main steps: (1) surface partitioning of polygonal meshes; (2) generation of shape design variables on the basis of partitioned surface patches; and (3) gradient‐based shape optimization of the structures by reducing a weighted compliance among all load cases. The main contributions of this paper include (i) that our approach can be directly applied on polygonal meshes with the reduction of design variables or decision variables by 10 to 1000 times, compared to the conventional design variable scheme of using each mesh node; (ii) our perturbation scheme is mathematically proven with respect to maintaining the smoothness of each surface patch, except on its boundary; and (iii) overall, our approach can be used to automate time‐consuming shape optimization of polygonal meshes to a greater extent. Numerical experiments have been conducted and the results indicate the effectiveness of the approach. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here