Towards Manufacturing-Friendly Shapes in Discrete Topology Optimization
Vojtech Neuman, Miloslav Capek, Lukas Jelinek
TL;DR
This work addresses manufacturing irregularities in discrete topology optimization for antennas by introducing a graph-based regularity framework. It represents the design domain as a graph and defines triangle- and basis-function–level shape parameters (e.g., $r_{area}$, $r_{point}$, $r_{hom}$, $r_{slot}$) to quantify islands, point connections, and rapid material changes, incorporating them into the optimization objective. The approach yields Pareto-frontier descriptions of trade-offs between electromagnetic performance, embodied by $Q/Q_{lb}$, and manufacturability metrics, and demonstrates applicability to discrete memetic algorithms with potential extension to 3D. The findings offer a practical, computationally inexpensive way to generate more manufacturable antenna designs while preserving general applicability to other discrete optimization schemes.
Abstract
This paper deals with shape irregularity issues in discrete topology optimization algorithms whereby the design is created using the automated distribution of material in the design region. Graph theory is employed to derive appropriate regularity measures for any discrete optimization algorithm. Shape regularity is quantified by scalar figures ready to evaluate design choices in the form of Pareto-frontiers. Developed metrics deal with information concerning material usage, problematic distribution, and features that complicate manufacturing. The theory is verified by several examples demonstrating the treatment of isolated islands of materials, point connections between material segments, or homogeneity.
