Escaping Tree-Support (ET-Sup): minimizing contact points for tree-like support structures in additive manufacturing
Bibliographic record
Abstract
Purpose Support structures are often needed in additive manufacturing (AM) to print overhangs. However, they are the extra materials that must be removed afterwards. When the supports have many contacts to the model or are even enclosed inside some concavities, removing them is very challenging and has a risk of damaging the part. Therefore, the purpose of this paper is to develop a new type of tree-support, named Escaping Tree-Support (ET-Sup), which tries to build all the supports onto the build plate to minimize the number of contact points. Design/methodology/approach The methodology is to first classify the support points into three categories: clear, obstructed and enclosed. A clear point has nothing between it and the build plate; an obstructed point is not clear, but there exists a path for it to reach the build plate; and an enclosed point has no way to reach the build plate. With this classification, the path for the obstructed points to come clear can be found through linking them to the clear points. All the operations are performed efficiently with the help of a ray representation. Findings The method is tested on different overhang features, including a lattice ball and a mushroom shape with a concave cap. All the supports generated for the examples can find their way to the build plate, which looks like they are escaping from the model. The computation time is around one second for these cases. Originality/value This is the first time truly realizing this “escaping” property in the generation of tree-like support structures. With this ET-Sup, it is expected that the AM industries can reduce the manufacturing lead time and save much labor work in post-processing.
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.000 | 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.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".