FreeTO - Freeform 3D topology optimization using a structured mesh with smooth boundaries in Matlab
Bibliographic record
Abstract
• FreeTO is an open-source code for 3D topology optimization and post-processing in Matlab. • FreeTO is compatible with several popular Matlab codes for topology optimization. • FreeTO employs SEMDOT and SIMP and performs better with the MMA optimizer. • Optimized structures have smooth boundaries, eliminating post-process smoothening. • FreeTO also allows exporting the optimized structure as an STL file. Topology optimization has revolutionized the design of structures for various applications, particularly with the advancement of additive manufacturing. However, existing open-source codes for topology optimization have limitations, such as restricted domain initialization and lack of a CAD output after optimization. A novel open-source Matlab code, FreeTO, is presented, and it addresses these limitations by enabling the initialization of 3D arbitrary geometries and providing an STL file post-optimization. FreeTO utilizes a structured mesh and a smooth-edge (boundary) algorithm to generate smooth topological boundaries. The code is demonstrated through six practical design cases, showcasing its effectiveness in compliance minimization, compliant mechanisms, and self-supporting problems. FreeTO offers a user-friendly, all-in-one topology optimization package, making it an invaluable tool for educators, researchers, and practitioners. Future developments will focus on eliminating a few geometrical deviations in the optimized topologies, incorporating speedups, and extending the code to apply to more applications.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.063 | 0.013 |
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".