# On minimum length scale control in density based topology optimization

- 552 Downloads

## Abstract

The archetypical topology optimization problem concerns designing the layout of material within a given region of space so that some performance measure is extremized. To improve manufacturability and reduce manufacturing costs, restrictions on the possible layouts may be imposed. Among such restrictions, constraining the minimum length scales of different regions of the design has a significant place. Within the density filter based topology optimization framework the most commonly used definition is that *a region has a minimum length scale not less than D if any point within that region lies within a sphere with diameter* *D* > 0 *that is completely contained in the region*. In this paper, we propose a variant of this minimum length scale definition for subsets of a convex (possibly bounded) domain. We show that sets with positive minimum length scale are characterized as being morphologically open. As a corollary, we find that sets where both the interior and the exterior have positive minimum length scales are characterized as being simultaneously morphologically open and (essentially) morphologically closed. For binary designs in the discretized setting, the latter translates to that the opening of the design should equal the closing of the design. To demonstrate the capability of the developed theory, we devise a method that heuristically promotes designs that are binary and have positive minimum length scales (possibly measured in different norms) on both phases for minimum compliance problems. The obtained designs are almost binary and possess minimum length scales on both phases.

## Keywords

Topology optimization Nonlinear filters Size control Mathematical morphology## 1 Introduction

Given a region of space \({\Omega }\subset \mathbb {R}^{d}\), topology optimization aims at determining the layout of material that extremizes a given performance measure. In a typical topology optimization problem there are two phases of material, for convenience referred to as material and void, to be distributed within the design domain. Hence, the objective is to find a region *M* ⊂Ω such that *M* is occupied by material and \(V = {\Omega }\setminus \overline {M}\) is occupied by void. There are several reasons to restrict the set of feasible designs—some of mathematical nature related to the well-posedness of the topology optimization problem, and some of more practical nature related to manufacturing. Constraints on the minimum feature size can be used to ensure manufacturability and help controlling the manufacturing cost. Moreover, as pointed out by Allaire et al. (2016), imposing a minimum feature size constraint can compensate for simplified physical modeling or be introduced for aesthetical reasons.

In density based topology optimization, *M* ⊂Ω is represented by its characteristic function 1_{M}: Ω →{0,1}—often referred to as the material indicator function. To utilize gradient based optimization algorithms, which are suitable for handling the large-scale problem obtained after discretization, the range of the material indicator function is relaxed to [0,1]. The relaxed material indicator function *ρ*: Ω → [0,1] is referred to as the density. By introducing a penalty on densities in (0,1), binary designs are promoted. To guarantee existence of solutions, the density based topology optimization problem needs in general to be suitably regularized. Borrvall (2001) presents a systematic overview of several regularization schemes. Regularization by density filtering, where the density is restricted to the range of a regularizing filter operator, is frequently used (see, for instance, the works by Bruns and Tortorelli2001; Bourdin2001; Guest *et al*. 2004; Sigmund2007; Lazarov and Sigmund2011; Svanberg and Svärd 2013). We have previously introduced the class of generalized *f**W*-mean filters that provide a common framework for the vast majority of density filters used in topology optimization (Wadbro and Hägg 2015). In a recent paper we extended Bourdin’s (2001) result on existence of solutions to the linearly filtered minimum compliance problem to cascades of generalized *f**W*-mean filters (Hägg and Wadbro 2017).

## 2 Overview on minimum length scale control in density based topology optimization

This section presents an overview of different methods that aim at imposing minimum length scale in topology optimization, with emphasis on the various definitions of minimum length scales involved. A comprehensive review on different techniques based on density filtering has recently been given by Lazarov et al. (2016).

Early attempts to gain control over the minimum length scales in density based topology optimization, such as slope constraints (Petersson and Sigmund 1998) and linear density filtering (Bruns and Tortorelli 2001; Bourdin 2001), focused on limiting the spatial variation of the density field. The linear filter replaces the density in one point with a weighted linear average over some neighborhood. The typical choice has been to use *d*-dimensional spherical neighborhoods with a given diameter *D* > 0. Necessarily, both methods (the addition of slope constraints and linear density filtering) lead to blurred transitions between material and void regions. If the slope constraint reads ∥∇*ρ*(*x*)∥≤ *D*^{− 1} or if the filter neighborhood is a *d*-dimensional sphere with diameter *D* > 0, then the transitional region is at least of size *D*. As indicated before (Sigmund 2007) and as will be emphasized in this paper, other neighborhood shapes can be employed. However to fix ideas, we will stick to *d*-dimensional spherical neighborhoods with diameter *D* in this section. Concentrating the weights used in the linear filter around the center of each neighborhood, allows for sharper transitions between material and void regions. Ultimately, when the weights far from the center of the neighborhood become negligible in comparison to those close to the center, we are effectively using a smaller neighborhood—In finite precision arithmetic, this is certainly the case. Nonlinear density filters (Guest et al. 2004; Sigmund 2007; Svanberg and Svärd 2013) have the advantage of allowing for almost sharp transitions between material and void regions, even for uniform weighting.

*η*∈ [0,1] (Guest et al. 2004; Sigmund 2007). When thresholding at level

*η*= 0, the resulting density in a point is 0 if and only if the density within the neighborhood of that point is identically zero. On the other hand

*ρ*(

*x*) > 0 implies that the resulting density will be 1 at any point that has

*x*in its neighborhood. Thus,

*any point within a material region lies within a d-dimensional sphere with diameter D > 0 that is completely contained in the material region.*The text in italics may be adopted as the defining property of a material region possessing a minimum length scale not less than

*D*. To distinguish this overarching definition we will denote it by NEighborhood based minimum Length scale (NEL). Although, we have not been able to determine the exact origins of this definition, it has been extensively used—both implicitly and explicitly—in the literature (see, for instance, the works by Bruns and Tortorelli (2001), Bourdin (2001), Guest et al. (2004), Sigmund (2007), Guest (2009), and Svanberg and Svärd (2013)). A more elaborate definition of the NEL has been given by Zhang et al. (2014). Given the structural skeleton

*S*(

*M*) of \(M = \overline {M}\), consisting of all points in

*M*that have at least two nearest points on

*∂*

*M*, Zhang et al. (2014) define the minimum length scale as

*x*with radius

*r*.

For binary densities, thresholding filtered densities at *η* = 0 gives the same result as computing maxima over neighborhoods (Sigmund 2007). Thus, for binary densities, thresholding filtered densities at *η* = 0 provides a realization of the dilate operator from mathematical morphology. Other realizations for binary densities of the dilate operator are given by the geometric and harmonic dilate filters with the parameter *α* = 0 (Svanberg and Svärd 2013). Analogously, considering thresholding at *η* = 1 leads to a definition of minimum length scale for void regions, considerations of the erode operator and its various realizations for binary densities.

In applications using gradient based optimization algorithms, thresholding is replaced by application of a differentiable function that approximates the Heaviside step function (Guest et al. 2004). Similarly, differentiable filters that approximate the dilate and erode operators are used (Sigmund 2007; Svanberg and Svärd 2013). In all cases, the degree of approximation is controlled by a scalar parameter. As pointed out by Sigmund (2007), it is important to keep in mind that although such filters give the same result on binary densities in the limit where the approximation is exact, they will in general produce different results for non-binary densities and finite approximation errors. The overall conclusion is that a lower bound on the NEL of either material or void regions can be imposed by using standard filtering methods. We also note that a common feature is that such filters approximate the morphological dilate or erode operators on binary densities. (This also applies to filters approximating morphological open or close operators since these are compositions of dilate and erode operators.) By introducing two design fields, one controlling the layout of material and one controlling the layout of void, Guest (2009) was able to impose independent minimum length scales on both phases using Heaviside projection. Strictly speaking, the definition of the NEL is only applicable to binary designs. However, it seems that the common understanding is that this is less of an issue when the designs are almost binary with almost sharp transitions between regions of different materials.

From a manufacturing point of view in two spatial dimensions, designs with NEL not less than *D* > 0 on the material phase could be manufactured using a circular deposition tool with diameter *D*, while designs with NEL not less than *D* on the void phase could be manufactured using a circular machining tool with diameter *D* (Sigmund 2007). The same reasoning applies to NELs defined using non-circular neighborhoods; for instance, if the void phase has NEL defined using some neighborhood, one may use a punch tool in the shape of the neighborhood in manufacturing.

*η*∈ [

*η*

_{d},

*η*

_{e}] yields designs with the same topology, then any design obtained by thresholding the filtered densities at an intermediate level

*η*

_{i}∈ (

*η*

_{e},

*η*

_{d}) possesses NELs on both phases. Later, Zhou et al. (2015) introduced geometrical conditions aiming to guarantee that thresholding the filtered densities within a range of levels leads to designs with the same topology. However, the function

^{2}, their conditions are vacuously satisfied. Nevertheless, thresholding \(\tilde {\rho }\) at

*η*

_{d}= 0.2,

*η*

_{i}= 0.5, and

*η*

_{e}= 0.8, respectively, yields three different topologies, as illustrated in Fig. 1. We note that function (2) can be excluded by requiring \(\frac {\partial \tilde {\rho }}{\partial n} = 0\) at the design domain boundary. Whether, appending \(\frac {\partial \tilde {\rho }}{\partial n} = 0\) to Zhou et al.’s (2015) conditions make them sufficient in general is an open question. It is interesting to note that the response of designs with NELs on both phases need not be robust against uniform dilations and erosions of the design (Zhou et al. 2015).

To simultaneously control the minimum length scale of both materials, Poulsen (2003) introduced the MOLE-method (MOnotonicity based minimum LEngth scale). For simplicity, we state the definition of the MOLE in two spatial dimensions. *The MOLE is at least* *D* > 0 *if at any point* *x* *∈Ω the restriction of the density to any of the line segments* *x* + *t*(cos*𝜃*, sin*𝜃*), *t* ∈ [−*D*/2,*D*/2],*𝜃* ∈{0,*π*/4,*π*/2,3*π*/4} *is monotonic in* *t*. Imposing that the MOLE is at least *D* > 0 implies that the boundary between material and void regions consists of piecewise straight lines meeting at angles no less than 3*π*/4, and in particular that the smallest feature is an octagon with diameter \((1+\sqrt {2})D\). To enforce a lower bound on the MOLE, one extra constraint was added to the formulation of the topology optimization problem.

Allaire et al. (2016) work with a level set representation of the design and make the following definition. *The thickness of * *M is larger than* *D* > *0 if for each point x* ∈ *∂**M and any* *t* ∈ [0,*D*], *it holds that x* − *t**n*(*x*) ∈ *M*, *where n*(*x*) *denotes the outward unit normal to M* *at point x*. To impose minimum thickness via constraints or penalties in the problem formulation, the definition is reformulated using the signed distance function. For a point in the interior of *M* the value of the signed distance function *d*_{M} is the negative distance from the point to the boundary, for a point on the boundary of *M* the value is 0, and for a point in the exterior of *M* the value is the distance from the point to the boundary. In the level set context the NEL can be conveniently expressed by using the signed distance function and the skeleton of *M* (Guo et al. 2014b; Xia and Shi 2015): *d*_{M}(*x*) ≤−*D*/2 for all *x* ∈ *S*(*M*). As pointed out by Allaire et al. (2016), the behavior of their minimum thickness and the NEL can be rather different. Consider, for instance, the unit square with rounded corners with rounding radius 0 < *r* ≪ 1, then the minimum thickness is 1 while NEL = 2*r* ≪ 1.

Within the Moving Morphable Components (MMC) approach (Guo et al. 2014a) with trapezoidal components, a different notion of minimum length scale considering the individual sizes of the components and the sizes of their intersection regions was introduced by Zhang et al. (2016).

## 3 Paper outline

The remainder of the paper is organized into two main parts: *Foundations of minimum size control*, and *Computational approach and experiments*. The first part starts with Section 4.1 that gives an introduction to standard mathematical morphology for subsets of \(\mathbb {R}^{d}\). To handle subsets of a bounded convex domain, we introduce a modification of standard morphology in Section 4.2. In Section 4.3, we propose definition (31) of the NEL for open subsets of a bounded convex domain and elaborate on its relation to the morphological operations of Section 4.2. Section 4.4 discusses morphological operators on Cartesian grids, their connection to the discretized density based topology optimization problem, and concludes with condition (53) that can be used to impose independent NELs on both phases. To quantitatively asses the NELs of an optimized design, we introduce some quality measures in Section 4.5. The first part concludes with a discussion in Section 4.6. The second part starts with Section 5.1 that introduces a method for compliance problems that heuristically imposes NELs on both phases via condition (53). Section 5.2 describes in detail the morphology-mimicking filters used in the numerical experiments, which are presented in Section 5.3. Section 5.4 provides a discussion on the proposed numerical method and the obtained results. A concluding summary related to both parts of the paper is given in Section 6.

## 4 Foundations of minimum size control

### 4.1 Preliminaries on mathematical morphology

Mathematical morphology is a branch of image analysis originating from the works of Georges Matheron and Jean Serra in the early sixties. The main idea of mathematical morphology is to gain information about a set \(M\subset \mathbb {R}^{d}\) by probing it by a smaller set \(B\subset \mathbb {R}^{d}\). In mathematical morphology *B* is referred to as a structuring element. In image analysis (topology optimization) the set *M* represents the binary image (design) given by the characteristic function 1_{M}(*x*). Dilation and erosion are perhaps the simplest morphological operations and they serve as building blocks for more complex operations.

*M*by

*B*as

*M*⊕

*B*. An immediate consequence of definition (3) is that dilation is commutative, that is,

*M*by

*B*is defined as

*M*⊖

*B*. Equivalently, since \(y\in \mathcal {E}_{B}(M)\) if and only if

*y*+

*b*∈

*M*for all

*b*∈

*B*, the erosion of

*M*by

*B*consists of all translations

*y*such that

*y*+

*B*⊂

*M*; that is,

*M*by

*B*and the closing of

*M*by

*B*are defined by

*B*acting on a set

*M*.

*ρ*by

*B*is defined as

*x*and all

*M*we have that

*b*∈

*B*such that

*x*∈

*b*+

*M*. Hence, \(\mathcal {D}_{B}(1_{M}(x)) = 1_{\mathcal {D}_{B}(M)}(x)\), which shows that definitions (3) and (13) are consistent for binary images. Similarly, we define the erosion of

*ρ*by

*B*as

### 4.2 Morphological operations on bounded domains

*bounded*convex domain \({\Omega }\subset \mathbb {R}^{d}\). We will also restrict our attention to structural elements containing 0; that is, 0 ∈

*B*. To this end, we introduce the operations

*M*⊂Ω. (Note that by taking \({\Omega } = \mathbb {R}^{d}\) the morphological operators of the previous section are retrieved, that is, \(\mathcal {D}_{B}(M)=\mathcal {D}^{\mathbb {R}^{d}}_{B}(M)\) and so on.)

*x*∈Ω.

### 4.3 Minimum length scale of sets

*B*∋ 0 be open, bounded, symmetric, and convex. Then the Minkowski functional

_{B}on \(\mathbb {R}^{d}\) for which

*B*is the open unit ball; that is,

*B*= {

*x*∣∥

*x*∥

_{B}< 1}. We define the local length scale relative

*B*at

*x*∈

*M*of a nonempty open set

*M*⊂Ω as the radius of the largest ball with center in

*M*containing

*x*such that its intersection with Ω lies within

*M*. That is,

*B*

_{r}(

*y*) =

*y*+

*r*

*B*= {

*x*∣∥

*x*−

*y*∥

_{B}<

*r*} denotes the ball obtained by scaling and translating the open unit ball. For applications in topology optimization where some differential equation is defined on (the design) M, it is natural to require M to be open. Moreover, if the structuring element is open, then the opening of any set is open and the closing of any set is closed.

*M*≠

*∅*, then \(R_{B}^{{\Omega }}(M;x)>0\) since

*M*⊂Ω is by assumption open. Furthermore, the following lemma holds; a proof is given in Appendix A.

### **Lemma 1**

*If* *M*≠*∅**and* \(0<r<R_{B}^{{\Omega }}(M;x)\)*,* *then* *E*_{rB}(*M*;*x*)≠*∅**.*

*M*≠

*∅*relative

*B*as the smallest local length scale of

*M*, that is,

*M*=

*∅*, it is natural to define \(R_{B}^{{\Omega }}(\emptyset ) = 0\), rather than using definition (31) and the convention that inf

*∅*=

*∞*that would lead to \(R_{B}^{{\Omega }}(\emptyset ) = \infty \). We note that the case

*M*=

*∅*, is of little practical importance in topology optimization. For bounded Ω, the main difference between NEL (1) and NEL (31) lies in the treatment of regions that are close to the boundary

*∂*Ω. By letting \({\Omega } = \mathbb {R}^{d}\) in definition (31), we essentially obtain NEL (1) in as much as the two definitions agree for sufficiently regular sets. For future reference, we define

*M*satisfying \(M = \mathcal {O}^{{\Omega }}_{B}(M)\) is called

*B*-open relative Ω, or just

*B*-open if \({\Omega } = \mathbb {R}^{d}\). Sets

*M*such that both the interior and the exterior are

*B*-open relative Ω are called

*B*-regular relative Ω, or just

*B*-regular if \({\Omega } = \mathbb {R}^{d}\). The two sets, illustrated to the left and in the middle of Fig. 3, are

*B*-open and

*B*-regular, respectively; the structuring element

*B*is depicted in the top right corner of the same figure. When \({\Omega } = \mathbb {R}^{d}\) and \(B = \{x\in \mathbb {R}^{d}\mid \|x\|<1\}\) (the Euclidean unit ball in \(\mathbb {R}^{d}\))

*r*

*B*-regular sets are simply called

*r*-regular (Serra1982, § 5; Pavlidis1982, § 7). It can be shown that an

*r*-regular set must be of class

*C*

^{1}(Duarte and Torres 2014).

We proceed by three theorems that link *B*-open sets and NEL (31).

### **Theorem 1**

*If* *M*≠*∅**is* *r**B**-open* *relative* Ω*for some* *r* > 0*,* *then* \(R_{B}^{{\Omega }}(M)\geq r\)*.*

### *Proof*

*M*≠

*∅*is

*r*

*B*-open, definitions (16) and (18), as well as expression (4), we find that

*x*∈

*M*belongs to (

*y*+

*r*

*B*) ∩Ω⊂

*M*for some \(y\in \mathcal {E}^{{\Omega }}_{rB}(M)\subset M\). Hence \(R_{B}^{{\Omega }}(M;x)\geq r\) for all

*x*∈

*M*, which implies that \(R_{B}^{{\Omega }}(M)\geq r\). □

We note that Theorem 1 makes it possible to quantitatively asses the NEL of a set using morphological operators. Moreover, Theorem 1 in combination with the idempotence (24) of the open operator provide a way to impose a lower bound on the NEL of the designs in topology optimization. More precisely, the NEL is guaranteed to be at least *r* by requiring that the design is the morphological opening by *r**B* of some set. In particular, this is true if \(M=\mathcal {O}^{{\Omega }}_{rB}(M)\).

### **Theorem 2**

*If* *M*≠*∅**and* \(R_{B}^{{\Omega }}(M)>0\)*,* *then* M *is* *r**B**-open* *for any* r *satisfying* \(0<r<R_{B}^{{\Omega }}(M)\)*.*

### *Proof*

Since the open operator is anti-extensive (23), we only need to show that \(M\subset \mathcal {O}^{{\Omega }}_{rB}(M)\). If *m* ∈ *M*, then, for any \(0<r < R_{B}^{{\Omega }}(M)\leq R_{B}^{{\Omega }}(M;m)\), by Lemma 1 there exists *y* ∈ *M* such that *m* ∈ (*y* + *r**B*) ∩Ω⊂ *M*. By (20) we conclude that \(y\in \mathcal {E}^{{\Omega }}_{rB}(M)\). Hence, there exists \(y\in \mathcal {E}^{{\Omega }}_{rB}\) and *b* ∈ *B* such that *m* = *y* + *r**b*, so by definitions (16) and (18) \(m\in \mathcal {D}^{{\Omega }}_{rB}(\mathcal {E}^{{\Omega }}_{rB}(M)) = \mathcal {O}^{{\Omega }}_{rB}(M)\). □

Theorem 2 shows that a set with positive NEL relative *B* is *r**B*-open for any *r* > 0 less than the NEL. We also conclude that a set whose interior and exterior both possess positive NELs must have a regular boundary.

Finally, we combine Theorem 1 and Theorem 2 to show that NEL (31) could equivalently be defined using open operator (18).

### **Theorem 3**

*For*

*M*≠

*∅*

*,*

*using the convention that*sup

*∅*= 0

*,*

*it holds that*

### *Proof*

Let \(\tilde {R}_{B}^{{\Omega }}(M) = \sup \{r>0\mid M = \mathcal {O}_{rB}^{{\Omega }}(M)\}\). If \(R_{B}^{{\Omega }}(M) > 0\), then Theorem 2 ensures \(M = \mathcal {O}_{rB}^{{\Omega }}(M)\) for all \(0 < r < R_{B}^{{\Omega }}(M)\); hence \(\tilde {R}_{B}^{{\Omega }}(M)\geq R_{B}^{{\Omega }}(M)\). Consequently, since \(R_{B}^{{\Omega }}(M)\ge 0\) and \(\tilde {R}_{B}^{{\Omega }}(M)\ge 0\), it holds that if \(\tilde {R}_{B}^{{\Omega }}(M)= 0\) then \(R_{B}^{{\Omega }}(M) = 0\).

On the contrary, assume that \(\tilde {R}_{B}^{{\Omega }}(M)>0\). Then for each *𝜖* > 0 there exists a strictly positive number *r*_{𝜖} that satisfies \(r_{\epsilon } \leq \tilde {R}_{B}^{{\Omega }}(M)<r_{\epsilon } + \epsilon \) such that \(M = \mathcal {O}_{r_{\epsilon } B}^{{\Omega }}(M)\). By Theorem 1, we find that \(R_{B}^{{\Omega }}(M)\geq \tilde {R}_{B}^{{\Omega }}(M)- \epsilon \). Hence, \(\tilde {R}_{B}^{{\Omega }}(M)>0\) implies that \(R_{B}^{{\Omega }}(M)\geq \tilde {R}_{B}^{{\Omega }}(M)\). Consequently, if \(R_{B}^{{\Omega }}(M) = 0\) then \(\tilde {R}_{B}^{{\Omega }}(M)= 0\). □

Expression (34) shows that NEL (31) of a nonempty open set can in principle be estimated to any desired accuracy by computing the morphological opening for different values of *r* and applying a bisection method.

*r*

*B*-open while the exterior is

*r*

^{′}

*B*-open with

*r*≠

*r*

^{′}, defines a subclass of min{

*r*,

*r*

^{′}}

*B*-regular sets. That is,

*M*relative Ω. Using duality (22) of the morphological operators, condition (35) takes the equivalent form

*note the prime on B in the close operator*)

### 4.4 Minimum length scale in topology optimization using mathematical morphology

*n*elements. To this end, assume that the design domain Ω is a hyperrectangle discretized using a regular grid. Moreover, we assume that a piecewise constant function

*ρ*

_{h}is used to approximate the design and let \(\boldsymbol {\rho }\in [0,1]^{n}\subset \mathbb {R}^{n}\) be a vector that holds the values of the design at each element. For a generic neighborhood shape \(\mathcal {N}\subset \mathbb {R}^{d}\), we define the neighborhood \(\mathcal {N}_{i}\) of element

*i*as all elements

*j*with centroids

*x*

_{j}in \(x_{i} + \mathcal {N}\), that is,

*r*> 0 in the norm ∥⋅∥

_{B}introduced in the previous section; that is, \(\mathcal {N} = rB\). In this case

*i*. In this case the discrete morphological operations (39) satisfy

*≤*

**ρ***if and only if*

**η***ρ*

_{i}≤

*η*

_{i}for all

*i*. We note that operations (39) are increasing; that is,

*i*

*−*

**1***, and using the duality*

**ρ***that satisfies the relation*

**ρ***satisfies (49), then so does \(\boldsymbol {\mathcal {M}}(\boldsymbol {\rho })\), where \(\boldsymbol {\mathcal {M}}\) denotes any of the discrete morphological operators. Condition (37), which expresses that both the interior and exterior of the design possess NELs (possibly measured in different norms), translates to*

**ρ***two*binary auxiliary design vectors

**η**_{1},

**η**_{2}, imposing the constraint \(\boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\eta }_{1}) = \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\eta }_{\boldsymbol {2}})\), and define the (physical) design as \(\boldsymbol {\rho } = \boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\eta }_{\boldsymbol {1}})\) (\(= \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\eta }_{\boldsymbol {2}})\)). The idempotences (46) and (47) of the discrete open and close operators imply that such

*satisfies conditions (50) and (51). However, as we now demonstrate, introducing one extra design variable per element is superfluous as far as there is no gain in design freedom. By anti-extensivity (44) of the discrete open operator and extensivity (45) of the discrete close operator we find that*

**ρ***. Expression (52) implies that conditions (50) and (51) hold if and only if*

**ρ**### 4.5 Quality measures

*M*

_{DOC}quantifies any residual in condition (53). A related quality measure is

*F*

_{DOC}measures the number of elements that are 1 after the close operation but 0 after the open operation. We remark that

*M*

_{DOC}= 0 implies that

*F*

_{DOC}= 0 but the reverse is not necessarily true. To be specific, a purely 0–1 design satisfying

*M*

_{DOC}= 0 has NELs on

*both*phases.

*M*

_{DIO}= 0 (

*M*

_{DIC}= 0) has NEL on the material (void) phase. In the numerical experiments we use

*M*

_{DIO}and

*M*

_{DIC}to estimate the attained NELs on the material and void phases, respectively. Finally, we note that quality measures (54), (56), and (57) are related:

Here, we use the 1-norm for all quality measures. One could, of-course, also use another norm to define these measures. The choice of norm is dictated by how much one wants small areas where minimum size conditions (50), (51), or (53) are not satisfied to influence the total quality measure. The 1-norm is rather forgiving toward having only small areas where the minimum size conditions are not satisfied, while, for example the max-norm would only focus on the largest element-wise deviation. In the binary case with exact morphological operators on a uniform mesh, the quality measures based on the 1-norm give the relative area (or volume) where the corresponding minimum size condition is not satisfied.

### 4.6 Discussion

As pointed out before (Sigmund 2007; Guest 2009), there are some complications regarding minimum length scales for parts of the design that are adjacent to the design domain boundaries. In particular, if \({\Omega }\subset \mathbb {R}^{2}\) is a rectangle and *B* is the Euclidean unit ball, then *R*_{B}(Ω) = 0. Hence, *M* ⊂Ω and \(V = {\Omega }\setminus \overline {M}\) cannot both possess NELs defined by expression (32). Moreover, if both phases are required to possess NELs defined by expression (32), then only one phase can occupy the region adjacent to a flat boundary. (Remember that NEL (32) and NEL (1) are essentially the same.) NEL (31) handles these issues by allowing the structuring element to be cut by Ω, implying that the definition of local length scale varies within Ω. Another approach to handle such issues has been presented by Xia and Shi (2015) within the level set framework, where they propose to trim the skeleton close to the design domain boundary before computing NEL (1).

*R*

_{B}(

*M*) ≥

*r*. However, as will be shown in the following example (see Fig. 4), nothing can be guaranteed regarding \(R_{B}^{{\Omega }}(V)\) or

*R*

_{B}(

*V*). Let Ω = (0,1)

^{2},

*r*= 1/6,

*B*be the open Euclidean unit ball, \(\tilde {{\Omega }} = (-r,1+r)^{2}\), and \(M = \mathcal {O}_{rB}({\Omega })\); then although \(\mathcal {O}_{rB}^{\tilde {{\Omega }}}(\tilde {V}) = \tilde {V}\), it holds that \(R_{B}(V) = R_{B}^{{\Omega }}(V) = 0\). The conclusion is that padding the design with zeros, makes it possible to impose

*R*

_{B}(

*M*) ≥

*r*and \(R_{B}^{\tilde {{\Omega }}}(\tilde {V})\geq r\) (and depending on the properties of \(\tilde {\Omega }\) even \(R_{B}(\tilde {V})\geq r\)). Analogous conclusions follow when the design is padded with ones; that is, one may impose

*R*

_{B}(

*V*) ≥

*r*and \(R_{B}^{\tilde {{\Omega }}}(\tilde {M})\geq r\) (and depending on the properties of \(\tilde {\Omega }\) even \(R_{B}(\tilde {M})\geq r\)), where we have defined \(\tilde {M} = \tilde {\Omega }\setminus \overline {V}\).

*both phases*cannot in general prevent the formation of one node hinges. Nevertheless, since four non-overlapping Euclidean balls cannot tangent in one point, imposing NELs on

*both phases*with a Euclidean ball as structuring element excludes designs with one node hinges (for sufficiently fine grids). We note that Poulsen (2003) in a similar way concludes that the MOLE needs check monotonicity not only along the coordinate axes but also along the diagonals in order to exclude one node hinges.

## 5 Computational approach and experiments

### 5.1 Heuristic method for compliance problems

*, we define the physical density*

**ρ***p*≥ 1 is a SIMP penalty parameter, and \(\boldsymbol {\mathcal {O}}_{h} (\boldsymbol {\rho })\) is a differentiable approximation of the discrete morphological opening. However, instead of using \(\boldsymbol {\mathcal {O}}_{h} (\boldsymbol {\rho })\) in the volume constraint, we use a differentiable approximation of the discrete morphological closing \(\boldsymbol {\mathcal {C}}_{h} (\boldsymbol {\rho })\). (To increase readability, we have suppressed the index showing the dependence of the approximate morphological operators on the neighborhood shape.) More precisely, we define the set of admissible designs \(\mathcal {A}\) as

*E*|/|Ω|) of the elements, and

*V*

^{∗}is the maximum fractional volume of Ω allowed to be occupied by material. The motivation for this approach is that intuitively, the use of the SIMP penalty parameter

*p*> 1 promotes binary designs while the use of the open operator to define the physical design but the close operator in the volume constraint promotes designs satisfying condition (53); that is, designs with NEL on both phases. More precisely, if we use exact morphological operators, then—by relation (52)—it holds that \(\boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho })^{p}\leq \boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho })\leq \boldsymbol {\rho }\leq \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\rho })\). This means that an element

*i*where \({\mathcal {O}}_{\mathcal {N}i}(\boldsymbol {\rho })^{p}<{\mathcal {C}}_{\mathcal {N}^{\prime }i}(\boldsymbol {\rho })\) yields a relatively small contribution to the stiffness compared to its contribution to the volume constraint. Thus, designs that satisfy \(\boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\rho })=\boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho })^{p}\) are promoted. For such designs, relation (52) implies that \(\boldsymbol {\rho } = \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\rho })=\boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho }) = \boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho })^{p}\). Hence the design satisfies relations (49) and (53); that is, the design is binary and possesses NELs on

*both*material and void.

### 5.2 Filtering strategy

*f*

*W*-filters to approximate morphological operators. To be explicit, in expressions (59) and (60), \(\boldsymbol {\mathcal {C}}_{h} (\boldsymbol {\rho })\) is replaced with \(\boldsymbol {\mathcal {C}}_{\alpha }^{H} (\boldsymbol {\rho })\), and \(\boldsymbol {\mathcal {O}}_{h} (\boldsymbol {\rho })\) with \(\boldsymbol {\mathcal {O}}_{\alpha }^{H} (\boldsymbol {\rho })\); where the harmonic close \(\boldsymbol {\mathcal {C}}_{\alpha }^{H} (\boldsymbol {\rho })\) and harmonic open \(\boldsymbol {\mathcal {O}}_{\alpha }^{H} (\boldsymbol {\rho })\) are defined in expressions (65) and (66) found below. Filters based on the harmonic mean were first introduced in topology optimization by Svanberg and Svärd (2013). We use equal weights within each neighborhood and thus define the weight matrix \(\boldsymbol {W}\in \mathbb {R}^{n\times n}\) with nonnegative entries by

*is a binary neighborhood indicator matrix, with elements*

**G***g*

_{ij}= 1 if \(j\in \mathcal {N}_{i}\), else

*g*

_{ij}= 0.

*α*> 0 is defined as

*α*> 0 can be written as

*α*> 0 satisfy

*α*→ 0 for binary designs.

*α*> 0 as

### 5.3 Numerical experiments

*M*

_{ND}quantifies how close the design is to begin binary. Here, we use \(\boldsymbol {\mathcal {C}}^{H}_{\alpha } (\boldsymbol {\rho })\) in the definition of

*M*

_{ND}since this is the design that enters the volume constraint and thus the one that naturally would be suggested as the design to be build. We remark that if we achieve our goal to have \(\boldsymbol {\mathcal {C}}^{H}_{\alpha } (\boldsymbol {\rho })=\boldsymbol {\mathcal {O}}^{H}_{\alpha } (\boldsymbol {\rho })=\boldsymbol {\rho }\), we expect a very small difference if

*M*

_{ND}would be defined using \(\boldsymbol {\mathcal {O}}^{H}_{\alpha } (\boldsymbol {\rho })\) or

*instead of \(\boldsymbol {\mathcal {C}}^{H}_{\alpha } (\boldsymbol {\rho })\). (This is indeed the case for the optimized designs presented later in this section.) In addition to*

**ρ***M*

_{ND}, we will use the quality measures introduced in Section 4.5 that quantify how close a binary design is to satisfy NEL conditions on either or both phases of material. When computing

*M*

_{DOC},

*F*

_{DOC},

*M*

_{DIO}, and

*M*

_{DIC}, we approximate the morphological operators by their harmonic counterparts \(\boldsymbol {\mathcal {O}}_{\alpha }^{H}(\boldsymbol {\rho })\) and \(\boldsymbol {\mathcal {C}}_{\alpha }^{H}(\boldsymbol {\rho })\) with

*α*= 10

^{− 8}. In particular, we have a purely 0–1 design with NELs on both materials if

*M*

_{ND}= 0 and

*M*

_{DOC}= 0. All quality measures below are presented in per percent (

*%*) instead of dimensionless numbers; for example, if the right hand side of expression (67) equals 0.018, then we write that

*M*

_{ND}= 1.8

*%*.

#### 5.3.1 Cantilever beam optimization

_{D}; and subject to a vertical surface traction density that is uniformly distributed over Γ

_{F}, the middle 10% of the domain’s right side.

*n*=

*n*

_{x}×

*n*

_{y}square elements, and use the finite element method with bilinear elements to solve for the nodal displacements of the structure \(\boldsymbol {u} \in \mathbb {R}^{N}\), where

*N*= 2(

*n*

_{x}+ 1)(

*n*

_{y}+ 1). The problem of minimizing the compliance of the structure given a limit on the available volume of material can be written as

*solves*

**u***N*×

*N*stiffness matrix corresponding to the element densities \(\tilde {\boldsymbol {\rho }}(\boldsymbol {\rho })\), and

*∈\(\mathbb {R}^{N}\) is the load vector. More precisely, letting*

**f***φ*

_{i},

*i*∈{1,…,

*N*} denote the finite element basis functions, the element values of \(\boldsymbol {K}\left (\tilde {\boldsymbol {\rho }}(\boldsymbol {\rho }) \right )\) are given by

*𝜖*(

*u*) = (∇

*u*+ ∇

*u*

^{T})/2 is the strain tensor (or the symmetrized gradient) of u, the colon “:” denotes the scalar product of the two matrices,

*E*is a constant fourth-order elasticity tensor, and \(\tilde {\rho }_{h}\) is an elementwise constant function with element values \(\tilde {\boldsymbol {\rho }}(\boldsymbol {\rho })\). Similarly, the element values of

*are*

**f***t*∈

*L*

^{2}(Γ

_{F})

^{d}represents the surface traction density on the boundary portion Γ

_{F}.

To minimize the compliance of the cantilever beam, we use the gradient based optimality criteria method (Bendsøe and Sigmund 2003, §1.2) with damping parameter *η* = 0.5 together with a continuation approach for *p*, the SIMP parameter used in definition (59), and *α*, the nonlinearity parameter used to define the nonlinear filters. The continuation approach starts using a fixed nonlinearity parameter *α* = 10 and approximately solves problem (68) for *p* = 1,1.5,…,3. After that, the continuation continues using a fixed *p* = 3 and approximately solves problem (68) with *α* = 10^{1−m/2} for *m* = 1,2,…,18. We refer to this scheme as the cautious continuation approach. For the first problem we employ a uniform initial guess that actively satisfies the volume constraint. At each following subproblem, we use the approximate closing of the design obtained in the previous step as initial guess. The stopping criterion used at each step was that either the maximum elementwise update of the design vector * ρ* was less than 0.01 or that 50 iterations had passed on that continuation step.

*V*

^{∗}= 0.5 on a design domain discretized by 768 × 512 elements. The (approximately) circular neighborhoods used in the filtering are illustrated in the top right corner of each sub-figure. The radii of these neighborhoods are 4 (top row left), 6 (top row right), 8 (middle row left), 10 (middle row right), 12 (bottom row left), and 14 (bottom row right) elements, respectively. The value of RelObj, stated below each optimized beam, shows the corresponding relative objective function value; that is, the optimized beam’s compliance divided by the compliance of a beam optimized without filtering and without penalty (compare with the variable thickness sheet problem). For all these results the quality measures defined above satisfy the following inequalities:

*M*

_{ND}< 1.2 ⋅ 10

^{− 5}

*%*,

*M*

_{DOC}< 5.0 ⋅ 10

^{− 6}

*%*, and

*F*

_{DOC}= 0

*%*. The small values of the quality measures, as well as the presented results, demonstrate that we indeed have minimum size control of both material phases. A closer analysis reveals that the maximum elementwise change required to get a fully 0–1 design is less than 10

^{− 5}for all designs in Fig. 7.

*p*= 3 and stepping

*α*= 10

^{4 − 3m}for

*m*= 1,2,3,4 and employing the same filtering procedure as for the results in Fig. 7, yields the designs in Fig. 8. These results satisfy similar inequalities for the quality measures (

*M*

_{ND}< 9.7 ⋅ 10

^{− 6}

*%*,

*M*

_{DOC}< 3.9 ⋅ 10

^{− 6}

*%*, and

*F*

_{DOC}= 0

*%*) as those obtained when using the cautious continuation approach. Thus, we also have minimum size control of both material phases in this case. Comparing the resulting designs in Figs. 7 and 8 reveals that, for large filter radii, the two continuation approaches produce similar results. However for small filter radii, the cautious continuation approach produced design with finer features than the aggressive continuation approach. Note however that both approaches produce designs that up to the given tolerance satisfy the first order optimality conditions (the KKT conditions) of the optimization problem.

As we now illustrate, by using the values of *M*_{DIO} and *M*_{DIC} computed for various filter radii one may estimate the actual NELs of material and void regions, respectively. Figure 9 shows *M*_{DIO} and *M*_{DIC} as functions of filter radius for the top and middle designs on the left in Figs. 7 and 8. For the top left designs in Figs. 7 and 8, each quality measure has a distinct jump. NEL condition (50) is satisfied (within a given tolerance) only before the jump in *M*_{DIO}, and analogously NEL condition (51) is satisfied (within a given tolerance) only before the jump in *M*_{DIC}. In accordance with Theorem 3, we estimate the NEL of the material region as the largest radius where *M*_{DIO} is below a certain threshold; analogously, we estimate the NEL of the void region as the largest radius where *M*_{DIC} is below a certain threshold. Based on the values in Fig. 9, we estimate that \(R_{B}^{{\Omega }}(M) = 8\) and \(R_{B}^{{\Omega }}(V) = 4\) for the top left design in Fig. 7; and that \(R_{B}^{{\Omega }}(M) = 11\) and \(R_{B}^{{\Omega }}(V) = 4\) for the top left design in Fig. 8. In either case, the imposed lower bound on the NELs of both phases were 4.

*M*

_{DIO}and

*M*

_{DIC}in Fig. 9. By performing a similar analysis for all the designs in Figs. 7 and 8, we obtain the estimates in Table 1. Thus, for these designs the NELs of the void regions are tight on the bound, while the NELs of the material regions are not. Moreover, the deviations from the lower bounds are larger for the beams obtained using the aggressive continuation strategy.

Estimated NELs for the designs in Figs. 7 and 8. Here, \(R_{B}^{{\Omega }}\)-imp, \(\frac {@@}{@@}R_{B}^{{\Omega }}(M)\), \(\frac {@@}{@@}R_{B}^{{\Omega }}(V)\) refers to the imposed lower bound on the NEL of both material and void, the obtained NEL of material, and the obtained NEL of void, respectively

Fig. 7 | Fig. 8 | ||||
---|---|---|---|---|---|

\(\frac {@@}{@@}R_{B}^{{\Omega }}\)-imp | \(\frac {@@}{@@}R_{B}^{{\Omega }}(M)\) | \(\frac {@@}{@@}R_{B}^{{\Omega }}(V)\) | \(\frac {@@}{@@}R_{B}^{{\Omega }}(M)\) | \(\frac {@@}{@@}R_{B}^{{\Omega }}(V)\) | |

Top left | 4 | 8 | 4 | 11 | 4 |

Top right | 6 | 7 | 6 | 9 | 6 |

Middle left | 8 | 9 | 8 | 9 | 8 |

Middle right | 10 | 10 | 10 | 11 | 10 |

Bottom left | 12 | 22 | 12 | 24 | 12 |

Bottom right | 14 | 24 | 14 | 24 | 14 |

*M*

_{ND}< 3.9 ⋅ 10

^{− 6}

*%*,

*M*

_{DOC}< 3.8 ⋅ 10

^{− 6}

*%*, and

*F*

_{DOC}= 0

*%*. In all these cases, the maximum elementwise change required to get a fully 0–1 design is less than 4 ⋅ 10

^{− 5}. Judging from Fig. 10, the obtained designs appears mesh convergent.

#### 5.3.2 Minimum heat compliance

_{D}and is thermally insulated along the rest of the boundary Γ

_{N}. For the minimum heat compliance problem, using standard SIMP with

*p*= 3 and standard filtering schemes to impose NEL on one of the phases yields designs with large

*M*

_{ND}(Lazarov et al. 2016). Moreover, there are numerical evidence that, for this problem—unlike the cantilever beam example—, an open–close filtering strategy (combined with adequate penalization of intermediate conductivities) fails to provide designs with NELs on both phases (Hägg and Wadbro 2017). Thus, the minimum heat compliance problem, although its apparent simplicity, is rather challenging for methods that impose NELs in density based topology optimization.

*N*= (

*n*

_{x}+ 1)

^{2}. The problem of minimizing the heat compliance of the structure given a limit on the available volume of material (with high thermal conductivity) is given by problem (68) together with equation system (69). Here, the physical element densities \(\tilde {\boldsymbol {\rho }}(\boldsymbol {\rho })\) are defined as in expression (59) with \(\underline {\rho }= 10^{-3}\). The entries of \(\boldsymbol {K}\left (\tilde {\boldsymbol {\rho }}(\boldsymbol {\rho }) \right )\) and

*are given by*

**f***φ*

_{i},

*i*∈{1,…,

*N*} are the basis functions. We use

*V*

^{∗}= 0.5 and the same cautious continuation strategy for the SIMP parameter

*p*and the nonlinearity parameter

*α*as employed for the cantilever beam example. As for the cantilever beam examples, we stopped when either the maximum elementwise update of the design vector

*was less than 0.01 or when 50 iterations had passed on that step.*

**ρ***p*(

*p*= 1,1.5,…,3) with

*α*= 10 and then decreasing

*α*(

*α*= 10

^{1−m/2}for

*m*= 1,2,…,18) keeping

*p*= 3. The (approximately) circular neighborhoods used in the filtering are illustrated in the top right corner of each sub-figure. The radii of these neighborhoods are 4, 6, and 8 (top row); 10, 12, and 14, (second row from top); 16, 18, and 20 (third row from top); and 22, 24, and 26 (bottom row) elements, respectively. For all these results the quality measures satisfy the following inequalities:

*M*

_{ND}< 0.14

*%*,

*M*

_{DOC}< 0.011

*%*, and

*F*

_{DOC}< 0.0016

*%*, that is, at most 4 elements differ in material when using the discrete open and close operator. We also remark that

*F*

_{DOC}= 0 for eight of the optimized designs in Fig. 12.

Experiments using the aggressive continuation approach as well as tests for mesh convergence have been performed. Since the behavior is similar to that observed for the cantilever beam example, these results are not presented. We have also estimated the obtained NELs for the material and void regions, similarly as illustrated in Fig. 9 and Table 1 for the cantilever beams. In contrast to the cantilever beam problem, the NELs for the designs optimized with respect to heat compliance are tight on the imposed lower bound for the material (high conductivity) regions, while the NELs of the void (low conductivity) regions are not. Moreover, in this case and in particular for the void regions, it is harder to give an exact estimate of the obtained NEL, since the quality measures does not have a clear gap between low and high values in all cases.

*V*

^{∗}= 0.5, a square neighborhood (illustrated at the top right corner of this image) to impose a length scale on the material, and an octagonal shaped neighborhood to impose a length scale on the void regions. These neighborhoods are illustrated to the right of the optimized plate. This result was obtained on a domain discretized by 2048 × 2048 elements, and the quality measures for this design satisfy:

*M*

_{ND}< 0.012

*%*,

*M*

_{DOC}< 0.0030

*%*, and

*F*

_{DOC}< 5.7 ⋅ 10

^{− 4}

*%*. Thus, the design in Fig. 13 satisfies the imposed lower bounds on the NELs of both phases. As indicated in Section 2, this design could be manufactured using either a

*square deposition tool*or an

*octagonal punch*with the same sizes as the neighborhoods in Fig. 13. However, it could

*not*be manufactured using an

*octagonal deposition tool*or a

*square punch*with the same sizes as the neighborhoods in Fig. 13.

### 5.4 Discussion

*M*

_{ND}and

*M*

_{DOC}. In a similar way as the basic SIMP method cannot guarantee convergence toward binary designs, the heuristic method used in the numerical experiments does not guarantee convergence toward binary designs with NELs on both phases. Despite that, we obtain mesh convergent essentially binary designs with independent NELs of both phases for both the minimum compliant cantilever beam as well as for the heat compliance problem—without the need of any postprocessing or projection step. We remark that it is misleading to classify the harmonic

*f*

*W*-mean filters, as well as any other

*f*

*W*-mean filter, as projection based. The reason for this stand point is that all

*f*

*W*-mean filters are internal, that is,

*not*respect the range of values of their input.

**ρ**_{M}and

**ρ**_{V}denote two independent design vectors used for controlling the layout of material and void, respectively; \(\boldsymbol {\mathcal {D}}_{h}(\boldsymbol {\rho })\) and \(\boldsymbol {\mathcal {E}}_{h}(\boldsymbol {\rho })\) denote differentiable approximations of the morphological dilation and erosion, respectively. If filter (75) produces a binary result, then \(\boldsymbol {F}(\boldsymbol {\rho }_{M},\boldsymbol {\rho }_{V})=\boldsymbol {\mathcal {D}}_{h}(\boldsymbol {\rho }_{M}) = \boldsymbol {\mathcal {E}}_{h}(\boldsymbol {\rho }_{V})\). Thus, in the limit of exact morphological operators and when the resulting design is binary, filter (75) imposes lower bounds on the NELs of both phases. Apart from not needing two design vectors, imposing condition (53) has the advantage that the design vector itself becomes regularized in the sense that \(\boldsymbol {\rho } = \boldsymbol {\mathcal {O}}_{\mathcal {N}}(\boldsymbol {\rho }) = \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(\boldsymbol {\rho })\).

Regarding *M*_{ND}, the optimized designs presented in Section 5.3 outperforms those obtained by state of the art techniques for imposing minimum length scales presented in the review by Lazarov et al. (2016). In what way the proposed method benefits from extra penalization of intermediate densities has not been fully investigated. On one hand, for elements *i* where \(0 < {\mathcal {O}}_{hi}(\boldsymbol {\rho }) < {\mathcal {C}}_{hi}(\boldsymbol {\rho }) < 1\), we are effectively using a higher value of the SIMP parameter. On the other hand, we note that condition (53) can be satisfied for intermediate densities; for instance \(\boldsymbol {c\boldsymbol {1}} = \boldsymbol {\mathcal {O}}_{\mathcal {N}}(c\boldsymbol {1}) = \boldsymbol {\mathcal {C}}_{\mathcal {N}^{\prime }}(c\boldsymbol {1})\) for any *c* ∈ (0,1), a relation which also holds for the harmonic approximations employed in the numerical experiments.

By using *M*_{ND} together with the quality measures introduced in Section 4.5, we can *quantitatively* verify that the optimized designs possess the imposed NELs, and in principle *quantitatively* estimate their actual NELs. To the best of our knowledge, quantitative estimation of the minimum length scale has not been previously employed in density based topology optimization. As mentioned in Section 2, If the design is (almost) binary, then filters that approximate the morphological dilate (erode), will guarantee NEL on the material (void) region. In that case quantitative verification, that the imposed lower bound on the NEL of one of the phases is satisfied, is superfluous. Nevertheless, quantitative estimation of the actual NELs can still be of interest. The numerical experiments indicate that how tight the actual NELs are to their lower bounds depends on the continuation strategy used for the filter parameter *α* and SIMP parameter *p*. We believe that, quantitative estimation of the MOLE could be performed, in a similar way as done here, by using the discrete MOLE functional (Poulsen 2003) instead of *M*_{DIO} and *M*_{DIC}.

To obtain the beams in Fig. 7 using the cautious continuation approach, the OC algorithm required 550–750 iterations, the corresponding number for the beams in Fig. 8 is 90–120 iterations. The reason for the large number of iterations is that we converged at each step in the continuation. A much faster algorithm, that produce similar results can be obtained by relaxing the termination criteria for all except the last step in the continuation approach. We remark that in particular for small filter radii, using a continuation strategy with many stages produces better results than using a continuation approach with few stages. This is in line with the results by, for example, Alexandersen et al. (2016), who remark that using a continuation scheme typically produces better results than starting with the end values. However, without imposing severe design restrictions, one cannot provide any convergence guarantees for continuation schemes in general (Stolpe and Svanberg 2001). Apart from the cost related to the continuation strategy, the extra cost (compared to the standard SIMP method) associated with the heuristic method introduced in Section 5.1 is that related to the introduction of the approximate close operator. If, as done in the numerical experiments, a cascade of generalized *f**W*-mean filters are used to approximate the discrete morphological operators the extra computational complexity is *O*(*n*) on a regular grid using polygonal shaped neighborhoods (Wadbro and Hägg 2015; Hägg and Wadbro 2017). For general neighborhood shapes the extra computational complexity is *O*(*n* log *n*) by employing an FFT-based filtering strategy (Lazarov and Wang 2017).

## 6 Concluding summary

In this paper, we propose definition (31) of the NEighborhood based minimum Length scale (NEL) that is similar to definition (1) of Zhang et al. (2014); the main difference lies in the treatment of regions that are close to the boundary of the design domain. The main contribution of this paper is to rigorously establish the connection between NEL (31) and (modified) morphological operators for subsets of a convex (possible bounded) domain. We show that subsets with positive NEL are characterized as being morphologically open. A direct consequence of that characterization is that subsets whose interior and exterior both possess positive NELs are characterized by being simultaneously morphologically open and (essentially) morphologically closed. We show that, in the discretized setting of density based topology optimization, the latter translates to condition (53). We modify the SIMP-method for minimum compliance problems so that it promotes binary designs satisfying condition (53). The obtained designs are almost binary and possess positive NELs (possibly measured in different norms) on both phases of material. We make no claim toward applicability of this numerical method for other topology optimization problems—It merely serves as a demonstrator of the developed theory, which is generally applicable. The proper implementation of condition (53), in the optimization formulation of more challenging problems, is open for future investigation. The theory presented in Section 4 naturally extends to multiphase topology optimization. By requiring that each phase *M*_{i} ⊂Ω is *r*_{i}*B*_{i}-open, independent minimum length scales are imposed. However, how to implement such scheme in density based topology optimization is an open problem that requires further research.

## Notes

### Acknowledgements

This work is financially supported by the Swedish Foundation for Strategic Research (No. AM13-0029) and by the Swedish Research Council (No. 621-3706).

## References

- Alexandersen J, Sigmund O, Aage N (2016) Large scale three-dimensional topology optimisation of heat sinks cooled by natural convection. Int J Heat Mass Transf 100:876–891. https://doi.org/10.1016/j.ijheatmasstransfer.2016.05.013 CrossRefGoogle Scholar
- Allaire G, Jouve F, Michailidis G (2016) Thickness control in structural optimization via a level set method. Struct Multidiscip Optim 53(6):1349–1382. https://doi.org/10.1007/s00158-016-1453-y MathSciNetCrossRefGoogle Scholar
- Bendsøe MP, Sigmund O (2003) Topology optimization. Theory, methods, and applications. Springer, BerlinzbMATHGoogle Scholar
- Borrvall T (2001) Topology optimization of elastic continua using restriction. Arch Comput Meth Eng 8 (4):351–385. https://doi.org/10.1007/BF02743737 MathSciNetCrossRefzbMATHGoogle Scholar
- Bourdin B (2001) Filters in topology optimization. Int J Numer Methods Eng 50 (9):2143–2158. https://doi.org/10.1002/nme.116 MathSciNetCrossRefzbMATHGoogle Scholar
- Bruns T E, Tortorelli D A (2001) Topology optimization of non-linear elastic structures and compliant mechanisms. Comput Methods Appl Mech Eng 190(26–27):3443–3459. https://doi.org/10.1016/S0045-7825(00)00278-4 CrossRefzbMATHGoogle Scholar
- Duarte P, Torres M J (2014) Smoothness of boundaries of regular sets. J Math Imaging Vis 48(1):106–113. https://doi.org/10.1007/s10851-012-0397-0 MathSciNetCrossRefzbMATHGoogle Scholar
- Guest J K (2009) Topology optimization with multiple phase projection. Comput Methods Appl Mech Eng 199(1–4):123–135. https://doi.org/10.1016/j.cma.2009.09.023 MathSciNetCrossRefzbMATHGoogle Scholar
- Guest J K, Prévost J H, Belytschko T (2004) Achieving minimum length scale in topology optimization using nodal design variables and projection functions. Int J Numer Methods Eng 61(2):238–254. https://doi.org/10.1002/nme.1064 MathSciNetCrossRefzbMATHGoogle Scholar
- Guo X, Zhang W, Zhong W (2014a) Doing topology optimization explicitly and geometrically—a new moving morphable components based framework. J Appl Mech 81(8):081009. https://doi.org/10.1115/1.4027609
- Guo X, Zhang W, Zhong W (2014b) Explicit feature control in structural topology optimization via level set method. Comput Methods Appl Mech Eng 272:354–378. https://doi.org/10.1016/j.cma.2014.01.010
- Hägg L, Wadbro E (2017) Nonlinear filters in topology optimization: existence of solutions and efficient implementation for minimum compliance problems. Struct Multidiscip Optim 55(3):1017–1028. https://doi.org/10.1007/s00158-016-1553-8 MathSciNetCrossRefGoogle Scholar
- Heijmans H J A M (1995) Mathematical morphology: a modern approach in image processing based on algebra and geometry. SIAM Review 37(1):1–36. https://doi.org/10.1137/1037001 MathSciNetCrossRefzbMATHGoogle Scholar
- Lazarov B S, Sigmund O (2011) Filters in topology optimization based on helmholtz-type differential equations. Int J Numer Methods Eng 86(6):765–781. https://doi.org/10.1002/nme.3072 MathSciNetCrossRefzbMATHGoogle Scholar
- Lazarov B S, Wang F (2017) Maximum length scale in density based topology optimization. Comput Methods Appl Mech Eng 318:826–844. https://doi.org/10.1016/j.cma.2017.02.018 MathSciNetCrossRefGoogle Scholar
- Lazarov B S, Wang F, Sigmund O (2016) Length scale and manufacturability in density-based topology optimization. Arch Appl Mech 86 (1):189–218. https://doi.org/10.1007/s00419-015-1106-4 CrossRefGoogle Scholar
- Pavlidis T (1982) Algorithms for graphics and image processing. Computer Science Press, RockvilleCrossRefzbMATHGoogle Scholar
- Petersson J, Sigmund O (1998) Slope constrained topology optimization. Int J Numer Methods Eng 41(8):1417–1434. https://doi.org/10.1002/(SICI)1097-0207(19980430)41:8<1417::AID-NME344>3.0.CO;2-N MathSciNetCrossRefzbMATHGoogle Scholar
- Poulsen T A (2003) A new scheme for imposing a minimum length scale in topology optimization. Int J Numer Methods Eng 57(6):741–760. https://doi.org/10.1002/nme.694 MathSciNetCrossRefzbMATHGoogle Scholar
- Schevenels M, Sigmund O (2016) On the implementation and effectiveness of morphological close–open and open–close filters for topology optimization. Struct Multidiscip Optim 54(1):15–21. https://doi.org/10.1007/s00158-015-1393-y MathSciNetCrossRefGoogle Scholar
- Serra J (1982) Image analysis and mathematical morphology. Academic Press, LondonzbMATHGoogle Scholar
- Sigmund O (2007) Morphology-based black and white filters for topology optimization. Struct Multidiscip Optim 33(4–5):401–424. https://doi.org/10.1007/s00158-006-0087-x CrossRefGoogle Scholar
- Stolpe M, Svanberg K (2001) On the trajectories of penalization methods for topology optimization. Struct Multidiscip Optim 21(2):128–139. https://doi.org/10.1007/s001580050177 CrossRefGoogle Scholar
- Svanberg K, Svärd H (2013) Density filters for topology optimization based on the pythagorean means. Struct Multidiscip Optim 48(5):859–875. https://doi.org/10.1007/s00158-013-0938-1 MathSciNetCrossRefGoogle Scholar
- Wadbro E, Hägg L (2015) On quasi-arithmetic mean based filters and their fast evaluation for large-scale topology optimization. Struct Multidiscip Optim 52(5):879–888. https://doi.org/10.1007/s00158-015-1273-5 MathSciNetCrossRefGoogle Scholar
- Wang F, Lazarov B S, Sigmund O (2011) On projection methods, convergence and robust formulations in topology optimization. Struct Multidiscip Optim 43(6):767–784. https://doi.org/10.1007/s00158-010-0602-y CrossRefzbMATHGoogle Scholar
- Xia Q, Shi T (2015) Constraints of distance from boundary to skeleton: For the control of length scale in level set based structural topology optimization. Comput Methods Appl Mech Eng 295(Supplement C):525–542. https://doi.org/10.1016/j.cma.2015.07.015 MathSciNetCrossRefGoogle Scholar
- Zhang W, Zhong W, Guo X (2014) An explicit length scale control approach in simp-based topology optimization. Comput Methods Appl Mech Eng 282:71–86. https://doi.org/10.1016/j.cma.2014.08.027 MathSciNetCrossRefGoogle Scholar
- Zhang W, Li D, Zhang J, Guo X (2016) Minimum length scale control in structural topology optimization based on the moving morphable components (MMC) approach. Comput Methods Appl Mech Eng 311:327–355. https://doi.org/10.1016/j.cma.2016.08.022 MathSciNetCrossRefGoogle Scholar
- Zhou M, Lazarov B S, Wang F, Sigmund O (2015) Minimum length scale in topology optimization by geometric constraints. Comput Methods Appl Mech Eng 293:266–282. https://doi.org/10.1016/j.cma.2015.05.003 MathSciNetCrossRefGoogle Scholar

## Copyright information

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.