.png){kind=icon}
Return
A new algorithm for topology optimization using a level-set method
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2005.12.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The level-set method has been recently introduced in the field of shape optimization, enabling a smooth representation of the boundaries on a fixed mesh and therefore leading to fast numerical algorithms. However, most of these algorithms use a Hamilton-Jacobi equation to connect the evolution of the level-set function with the deformation of the contours, and consequently they call hardly create new holes in the domain (at least in 2D). In this work, we propose all evolution equation for the level-set function based oil a generalization of the concept of topological gradient. This results ill a new algorithm allowing for all kinds of topology changes. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
shape optimization
topology optimization
topological sensitivity
level-set
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
A spectrum of mutations in the polycystic kidney disease-2 (PKD2) gene from eight Canadian kindreds.
OAAI
OAAIShareSaveShareSaveShareSaveShareSave
View more