Volume 14, Issue 2 (2-2024)
2024, 14(2): 163-172 |
Back to browse issues page
Abstract: (5290 Views)
During the process of continuum topology optimization some pattern discontinuities may arise. It is an important challenge to overcome such irregularities in order to achieve or interpret the true optimal layout. The present work offers an efficient algorithm based on graph theoretical approach regarding density priorities. The developed method can recognize and handle solid continuous regions in a pre-optimized media. An illustrative example shows how the proposed priority guided trees can successfully distinguish the most crucial parts of the continuum during topology optimization.
Keywords: Continuum topology optimization, graph theory, natural associated graph, priority guided tree.
Type of Study: Research |
Subject:
Applications
Received: 2024/02/9 | Accepted: 2024/02/21 | Published: 2024/02/21
Received: 2024/02/9 | Accepted: 2024/02/21 | Published: 2024/02/21
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |