Using 3D Density-Gradient Vectors in Evolutionary Topology Optimization to Find the Build Direction for Additive Manufacturing
Bibliographic record
Abstract
Given its layer-based nature, additive manufacturing is known as a family of highly capable processes for fabricating complex 3D geometries designed by means of evolutionary topology optimization. However, the required support structures for the overhanging features of these complex geometries can be concerningly wasteful. This article presents an approach for studying the manufacturability of the topology-optimized complex 3D parts required for additive manufacturing and finding the optimum corresponding build direction for the fabrication process. The developed methodology uses the density gradient of the design matrix created during the evolutionary topology optimization of the 3D domains to determine the optimal build orientation for additive manufacturing with the objective of minimizing the need for support structures. Highly satisfactory results are obtained by implementing the developed methodology in analytical and experimental studies, which demonstrate potential additive manufacturing mass savings of 170% of the structure’s weight. The developed methodology can be readily used in a variety of evolutionary topology optimization algorithms to design complex 3D geometries for additive manufacturing technologies with a minimized level of waste due to reducing the need for support structures.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".