Prevention of enclosed voids in topology optimization using a cumulative sum flood fill algorithm

Journal Article (2023)
Author(s)

J.M. van der Zwet (TU Delft - Computational Design and Mechanics)

A.A.T.M. Delissen (TU Delft - Computational Design and Mechanics)

Matthijs Langelaar (TU Delft - Computational Design and Mechanics)

Research Group
Computational Design and Mechanics
Copyright
© 2023 J.M. van der Zwet, A.A.T.M. Delissen, Matthijs Langelaar
DOI related publication
https://doi.org/10.1016/j.advengsoft.2023.103530
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 J.M. van der Zwet, A.A.T.M. Delissen, Matthijs Langelaar
Research Group
Computational Design and Mechanics
Volume number
186
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Topology optimization has seen increased interest with the rise of additive manufacturing (AM) as a fabrication method, because of its ability to exploit the geometric complexity that AM offers. However, AM still imposes some geometric restrictions on the design, most notably on minimum feature size, overhang angles, and enclosed voids. Enclosed voids are problematic because for many AM methods it is impossible to remove supports, unmelted powder or uncured liquid from them. This paper introduces a filter based on a cumulative sum flood fill algorithm to alleviate this issue in a flexible manner. This filter produces a density field where every enclosed void element is rendered solid. It successfully eliminates enclosed voids in both 2D and 3D problems, with low computational cost due to its geometric nature. In addition we demonstrate direct control over the location, amount, and size of powder removal features by varying boundary conditions for the filter, running additional flood fills, and adding morphology operators, respectively.