<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">71256</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.071256</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Level Set Topology Optimization with Autonomous Hole Formation Using Material Removal Scheme of SIMP</article-title>
<alt-title alt-title-type="left-running-head">Level Set Topology Optimization with Autonomous Hole Formation Using Material Removal Scheme of SIMP</alt-title>
<alt-title alt-title-type="right-running-head">Level Set Topology Optimization with Autonomous Hole Formation Using Material Removal Scheme of SIMP</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Wu</surname><given-names>Fei</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Zeng</surname><given-names>Ziyang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Xie</surname><given-names>Kunliang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Liu</surname><given-names>Yuqiang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-5" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Ding</surname><given-names>Jiang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><xref ref-type="aff" rid="aff-3">3</xref><email>jding@gxu.edu.cn</email></contrib>
<aff id="aff-1"><label>1</label><institution>Guangxi Key Laboratory of New Energy Vehicle Power Battery and Green Powertrain Domain, School of Mechanical Engineering, Guangxi University</institution>, <addr-line>Nanning, 530004</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Guangxi Academy of Artificial Intelligence</institution>, <addr-line>Nanning, 530021</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>State Key Laboratory of Featured Metal Materials and Life-Cycle Safety for Composite Structures, Guangxi University</institution>, <addr-line>Nanning, 530004</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Jiang Ding. Email: <email>jding@gxu.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>26</day><month>11</month><year>2025</year>
</pub-date>
<volume>145</volume>
<issue>2</issue>
<fpage>1689</fpage>
<lpage>1710</lpage>
<history>
<date date-type="received">
<day>03</day>
<month>08</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>26</day>
<month>09</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_71256.pdf"></self-uri>
<abstract>
<p>The level set method (LSM) is renowned for producing smooth boundaries and clear geometric representations, facilitating integration with CAD environments. However, its inability to autonomously generate new holes during optimization makes the results highly dependent on the initial design. Although topological derivatives are often introduced to enable hole nucleation, their conversion into effective shape derivatives remains challenging, limiting topological evolution. To address this, a level set topology optimization method with autonomous hole formation (LSM-AHF) is proposed, integrating the material removal mechanism of the SIMP (Solid Isotropic Material with Penalization) method into the LSM framework. First, an initial structure is generated by adjusting the judgment threshold, and a binary thresholding algorithm is subsequently employed to obtain a clear and well-defined geometry. The structural boundaries of this geometry are then identified and used to construct a signed distance field, which serves as the initial level set function. To ensure smooth transitions across material interfaces and enhance numerical stability, Gaussian filtering is subsequently applied to the distance field. Numerical results demonstrate that LSM-AHF effectively enables hole nucleation without manual initialization and improves topology change, addressing the respective limitations of conventional LSM and SIMP methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>SIMP</kwd>
<kwd>LSM</kwd>
<kwd>judgment threshold</kwd>
<kwd>boundary distance model</kwd>
<kwd>autonomous hole formation</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>52475096</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Guangxi Natural Science Fund for Distinguished Young Scholars</funding-source>
<award-id>2025GXNSFFA069009</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Guangxi University</funding-source>
<award-id>2024BZRC010</award-id>
</award-group>
<award-group id="awg4">
<funding-source>Innovation Project of Guangxi Graduate Education</funding-source>
<award-id>YCBZ2025014</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The level set method (LSM) has attracted considerable interest in areas such as additive manufacturing and industrial design due to its ability to consistently provide clear and smooth boundary information, as it effectively describes the evolution of topology and shape by tracing structural boundaries [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. However, the inherent nature of the Hamilton&#x2013;Jacobi (H-J) equation, which dictates boundary evolution, can pose challenges, conventional LSM lack the intrinsic mechanism for hole nucleation during optimization, limiting topological complexity and thereby constraining the achievable optimality of the final design [<xref ref-type="bibr" rid="ref-3">3</xref>]. To ensure sufficient topological complexity, conventional LSM frameworks typically require predefining hole layouts in the initial design. However, such heuristics increase susceptibility to local minima and compromise global optimality, making the final results highly dependent on the initial layout [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Existing efforts to enhance hole-forming capabilities in LSMs can be categorized into three major directions: integration with topological derivatives, algorithmic modifications of LSM itself, and hybridization with other topology optimization frameworks.</p>
<p>In recent years, researchers have significantly enhanced the LSM by incorporating topological derivatives, enabling the automatic generation of holes. For instance, drawing on the bubble method proposed by Eschenauer et al. [<xref ref-type="bibr" rid="ref-5">5</xref>], researchers achieved automatic hole generation by integrating topological derivatives into LSM [<xref ref-type="bibr" rid="ref-6">6</xref>]. Cai et al. proposed the Adaptive Bubble Method (ABM) [<xref ref-type="bibr" rid="ref-7">7</xref>], which iteratively identifies holes within the structure and adaptively introduces deformable holes using topological derivatives. However, this approach is highly sensitive to parameter selection, requiring meticulous tuning to ensure stable optimization. Challis et al. incorporated topological derivatives into the Hamilton-Jacobi equation to enable automatic hole generation during the optimization process, but this modification can adversely affect optimization efficiency and stability [<xref ref-type="bibr" rid="ref-8">8</xref>]. Allaire et al. promoted hole nucleation by removing material regions with the smallest topological derivatives. Despite its theoretical soundness, this strategy often suffers from parameter sensitivity and added algorithmic complexity, limiting its widespread applicability.</p>
<p>To obtain hole-forming capability, researchers have proposed various LSM variants by modifying its evolution equations (H-J). For example, Wei et al. proposed a parameterized level set approach utilizing radial basis functions (RBF) [<xref ref-type="bibr" rid="ref-9">9</xref>], which enabled the automatic generation of holes within the structure, achieving the automatic formation of holes within the structure. However, this approach necessitates the introduction of additional parameters to control the generation and evolution of holes, leading to increased computational complexity. Luo et al. adopted a semi-implicit additive operator splitting (AOS) strategy to solve the Hamilton&#x2013;Jacobi equation and generate new holes, but this method has exhibited stability issues in certain cases [<xref ref-type="bibr" rid="ref-10">10</xref>]. Ullah et al. proposed a meshless element-free Galerkin method coupled with a radial basis function (RBF)-based level set method (LSM), which enables the nucleation of holes at appropriate locations within the design domain. However, the method is sensitive to optimization parameters, thereby increasing the cost and complexity of parameter tuning [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. Oellerich et al. proposed a modified wave equation method based on Hamilton&#x2019;s principle to achieve hole nucleation. However, the approach involves complex and sensitive parameter tuning, which affects the stability and accuracy of the results [<xref ref-type="bibr" rid="ref-13">13</xref>]. Despite these variants ability to generate holes automatically, these approaches are often hindered by unstable evolution behavior and high sensitivity to parameter tuning, limiting their reliability in practical applications.</p>
<p>Moreover, the combination of LSM with other optimization techniques has attracted considerable attention. Xia et al. combined the level set approach with the bi-directional evolutionary structural optimization (BESO) technique to remove low-efficiency material regions throughout the optimization process, achieving automatic hole generation [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>]. However, this approach requires multiple parameters to stabilize the optimization process. Park et al. combined LSM with the adaptive inner-front (AIF) method, dynamically creating new inner fronts during topology optimization to generate holes. Nonetheless, numerical oscillations during hole formation occasionally disrupt convergence, affecting the robustness of the optimization process [<xref ref-type="bibr" rid="ref-16">16</xref>]. Although these hybrid methods effectively enable hole nucleation, they frequently require complex parameter coordination, which may undermine robustness.</p>
<p>In summary, these studies have introduced notable advancements to the LSM, achieving promising results in automatic hole generation and structural optimization. However, challenges such as numerical stability, parameter sensitivity, and computational complexity persist, highlighting the need for further research and refinement.</p>
<p>An existing SIMP (Solid Isotropic Material with Penalization)-based method enables efficient material interpolation but often results in blurred material boundaries. In contrast, conventional LSM do not possess intrinsic hole-nucleation capability. Combining SIMP with LSM leverages SIMP&#x2019;s penalization to guide material distribution and provide density-based sensitivities, facilitating hole emergence at appropriate locations, enhancing topological complexity, and forming rational primary load paths, thereby leading to more reliable optimal designs. The proposed hybrid LSM-AHF framework integrates these strengths, allowing automatic hole generation with well-defined boundaries while maintaining computational efficiency.</p>
<p>A level set-based topology optimization method with autonomous hole formation, termed LSM-AHF, is proposed. In this approach, a SIMP-based material removal scheme is integrated into the level set framework to enable the spontaneous nucleation of holes. The proposed method addresses two major limitations of conventional approaches: the inability of standard level set methods to introduce new holes during optimization, and the poor boundary smoothness commonly observed in SIMP-generated topologies. Specifically, LSM-AHF introduces a judgment threshold to effectively identify and eliminate inefficient material, thereby facilitating the autonomous formation of porous features. The resulting structure is subsequently embedded into the level set formulation using a boundary distance model, ensuring smooth boundaries and well-defined topological characteristics. This dual mechanism enhances both topological adaptability and geometric regularity, making the method particularly suitable for structural designs aimed at seamless integration with CAD systems.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Level Set Topology Optimization for Autonomous Hole Formation Using Material Removal Scheme of SIMP (LSM-AHF)</title>
<p>As illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, LSM-AHF enables autonomous hole formation throughout the optimization process by incorporating a material removal strategy, thereby obtain an initial design with holes. Subsequently, the boundary distance model was used to convert the initial design information into an initialized level set function. Then, the optimization model was established, and the finite element analysis and sensitivity calculation were carried out. Finally, the optimal design is achieved through iterative solution of the H-J equation and continuous evolution of the level set function. LSM-AHF realization of autonomous hole forming during optimization, significantly reducing the dependence of LSM on the initial design.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Flowchart of LSM-AHF method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-1.tif"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Level Set Method</title>
<p>The LSM defines a higher dimensional surface through the level set function <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and employs the function&#x2019;s zero-level set to represent boundaries. It further updates the level set surface to govern boundary evolution while embedding the closed material domain <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula> within the design domain <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mtext>D</mml:mtext></mml:mrow></mml:math></inline-formula>. As shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the material distribution is represented by an implicit, Lipschitz-continuous level set function [<xref ref-type="bibr" rid="ref-1">1</xref>]:<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mi mathvariant="normal">&#x2216;</mml:mi><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>D</mml:mi><mml:mi mathvariant="normal">&#x2216;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the level set function, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>x</mml:mi></mml:math></inline-formula> represents the spatial coordinates within the design domain and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>t</mml:mi></mml:math></inline-formula> is the virtual time; The dynamic boundary <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, denoted by the black border, evolves over time as the level set function progresses.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Level set description: (<bold>a</bold>) Material distribution; (<bold>b</bold>) level set function</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-2.tif"/>
</fig>
<p>Here, the LSM implicitly describes the topology of the structure, and the topological optimization process of the continuum structure is achieved by solving H-J partial differential equations (PDEs) [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>]:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:math></disp-formula>here, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> denotes the boundary&#x2019;s normal velocity, which governs the movement of the shape and the evolution of the topology.</p>
<p>The LSM is recognized for generating clear and precise boundaries. However, it typically faces difficulties in forming new holes during the optimization process, as the topological evolution is heavily dependent on the initial hole setup [<xref ref-type="bibr" rid="ref-9">9</xref>]. To overcome this limitation, this study adopts a SIMP-based material removal strategy, enabling autonomous hole nucleation within the design domain. This integration reduces the dependency on prior hole placement and enhances the topological compliance of traditional LSM-based topology optimization.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Material Removal Strategy for SIMP</title>
<p>Traditionally, level-set topology optimization depends on user-defined initial hole placements within the design domain to steer the evolution of the structure. However, this approach heavily depends on prior knowledge, and the preset hole layout substantially impacts the final optimized structure, which may lead to a pronounced sensitivity of the level set method to the initial design. To address this limitation, this study introduces the SIMP-based material removal scheme, which enables autonomous hole nucleation within the design domain, thereby eliminating the reliance on manually placed initial holes and improving the robustness and generality of the optimization process.</p>
<p>SIMP uses the concept of Optimization Criteria (OC), which is an explicit updating criterion derived from the structural optimality condition (KKT condition), to decide which elements to remove from the structure. By introducing the Kuhn-Tucker condition (Kuhn-Tucker), the OC method constructs an optimization criterion based on the physical and structural properties of the material, and indirectly optimizes the structural properties through the iteration of design variables and Lagrange multipliers, and finally realizes independent porosity [<xref ref-type="bibr" rid="ref-18">18</xref>], as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Autonomous pore formation level set method, the process of generating holes in the optimization process: (<bold>a</bold>) initial structure; (<bold>b</bold>) preliminary hole structure; (<bold>c</bold>) hole structure; (<bold>d</bold>) initial design with holes; (<bold>e</bold>) clear initial design with holes, and finally clear optimization results are obtained</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-3.tif"/>
</fig>
<p>According to the density-based topology optimization method proposed by Bends&#x00F8;e et al., the SIMP density function interpolation model is
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the stiffness of the material, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> is a very small stiffness assigned to hole regions in order to prevent the stiffness matrix from becoming singular, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>p</mml:mi></mml:math></inline-formula> is a penalization factor, and <italic>p</italic> is a penalization factor for which a value of 3 is recommended [<xref ref-type="bibr" rid="ref-18">18</xref>], <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the density of each element <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>e</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the Young&#x2019;s modulus of each element <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>e</mml:mi></mml:math></inline-formula>.</p>
<p>Using minimum compliance as the objective function, the optimization model is formulated as:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:munder><mml:mo form="prefix">min</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:munder><mml:mo>&#x003A;</mml:mo><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mtext mathvariant="bold">U</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mtext mathvariant="bold">KU</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">u</mml:mtext></mml:mrow><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mtext mathvariant="bold">k</mml:mtext></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mtext mathvariant="bold">u</mml:mtext></mml:mrow><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>subject to&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x003A;</mml:mo><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">x</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mspace width="1em" /><mml:mspace width="1em" /><mml:mspace width="1em" /><mml:mrow><mml:mtext mathvariant="bold">KU</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">F</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mspace width="1em" /><mml:mspace width="1em" /><mml:mspace width="1em" /><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">x</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>In this formulation, <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>c</mml:mi></mml:math></inline-formula> denotes the structural compliance, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:mtext mathvariant="bold">U</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:mtext mathvariant="bold">F</mml:mtext></mml:mrow></mml:math></inline-formula> are the global displacement and external force vectors, respectively; <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:mtext mathvariant="bold">K</mml:mtext></mml:mrow></mml:math></inline-formula> is the assembled global stiffness matrix, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">u</mml:mtext></mml:mrow><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the displacement vector of element, <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">k</mml:mtext></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is stiffness matrix for unit Young&#x2019;s modulus <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>x</mml:mi></mml:math></inline-formula> is the vector of design variables, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>N</mml:mi></mml:math></inline-formula> is the total number of finite elements, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">x</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> stand for the current material volume and the prescribed volume limit, respectively.</p>
<p>The sensitivities of the objective function <italic>c</italic> and the material volume <italic>V</italic> with respect to the element densities <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are provided by:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">u</mml:mtext></mml:mrow><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mtext mathvariant="bold">k</mml:mtext></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mtext mathvariant="bold">u</mml:mtext></mml:mrow><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1.</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Sensitivity filtering is applied to prevent the occurrence of the checkerboard phenomenon.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>d</mml:mi></mml:math></inline-formula> denotes the index of neighboring elements located within the filtering radius of element <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>e</mml:mi></mml:math></inline-formula>. The operator <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the spatial weight factor, which is commonly based on the Euclidean distance between element <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>e</mml:mi></mml:math></inline-formula> and element <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>d</mml:mi></mml:math></inline-formula>.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>new&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x03B7;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x03B7;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2265;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x03B7;</mml:mi></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>new&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the updated design variable, <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the current design variable, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>r</mml:mi></mml:math></inline-formula> is the positive move limit, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the numerical damping coefficient. Based on these definitions, the optimality condition can be formulated as <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> [<xref ref-type="bibr" rid="ref-19">19</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>]
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is the Lagrange multiplier, which is solved by the dichotomy. Through the iterative update of the OC, the material distribution gradually evolves toward an optimal state under the given constraints. Throughout the optimization, the formation of pores naturally results from the material removal strategy embedded in the SIMP-based topology optimization method, as illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<p>In this process, elements that are critical to the primary load transfer path are preserved, while those with lower structural significance are progressively removed. As a result, holes form naturally within the design domain without any predefined initialization. The green regions marked by red arrows in <xref ref-type="fig" rid="fig-3">Fig. 3a</xref>&#x2013;<xref ref-type="fig" rid="fig-3">d</xref> indicate the locations of these autonomously generated pores as shown in <xref ref-type="fig" rid="fig-3">Fig. 3e</xref>.</p>
<p>From <xref ref-type="fig" rid="fig-3">Fig. 3d</xref>,<xref ref-type="fig" rid="fig-3">e</xref>, the clearer topological boundaries are obtained by further processing the grayscale SIMP results through a binarization threshold algorithm. This process classifies the global density field into two categories: elements with density values greater than a specified threshold are assigned as solid, while those below are treated as hole. The binarization threshold algorithm is defined as:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mtext>B</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>x</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mi>&#x03BA;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>otherwise</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mspace width="1em" /><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mn>0.5</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>,</mml:mo><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mn>0.5</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> represents the set of all element indices, where <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>m</mml:mi></mml:math></inline-formula> is the number of rows and <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of columns in the grid. <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>&#x03BA;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the binary threshold, which is determined iteratively using the bisection method to ensure that the binarized structure retains the same material volume as the original density field. The specific process from grayscale to clarity is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Force transmission path of cantilever beam and binary topology structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-4.tif"/>
</fig>
<p>As illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4a</xref>, a large portion of the initial solution consists of elements with intermediate density values, particularly near structural boundaries, which may hinder subsequent geometric representation and numerical processing. To overcome this limitation, a binary thresholding strategy is applied to eliminate grayscale ambiguity and to generate a distinct solid&#x2013;hole topology, as illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4b</xref> [<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<p>The outcome of this binarization process is a clean and well-defined structural layout, suitable for further geometric treatment. In particular, the resulting binary structure serves as a numerically consistent initial configuration for initializing the subsequent level set function, thereby ensuring topological coherence and continuity across the optimization stages.</p>
<p>To obtain excellent optimization results, it is necessary to obtain a suitable pore structure to ensure the complex topology, Therefore, a judgment threshold is adopted to identify the initial hole configuration [<xref ref-type="bibr" rid="ref-22">22</xref>], as illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3d</xref>, where the threshold value is calculated following in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the judgment threshold, <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the objective function before optimization, and <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the current objective function before optimization. The determination of the judgment threshold will be elaborated in the subsequent section.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Mapping from Density Field to Level Set Function</title>
<p>To establish a unified geometric representation and enable the mapping from the density field to the level set field, the clearly defined topology obtained through SIMP optimization is first processed to extract its boundary geometry [<xref ref-type="bibr" rid="ref-23">23</xref>], as illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5a</xref>,<xref ref-type="fig" rid="fig-5">b</xref>. Based on the identified boundary and surrounding non-boundary regions, a boundary distance model is then constructed, as shown in <xref ref-type="fig" rid="fig-5">Fig. 5c</xref>. This model provides the foundation for generating the signed distance field, thereby converting the discrete density-based topology into an implicit level set formulation and facilitating seamless transition between the two optimization stages.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Optimized level set-field mapping process for cantilever beam topology</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-5.tif"/>
</fig>
<sec id="s2_3_1">
<label>2.3.1</label>
<title>Extract the Boundary Geometry</title>
<p>To describe the principle of the boundary distance model, the boundary distance is defined as the relationship between the distance from the center point B of the cell to the boundary node A, as shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Schematic diagram of boundary distances</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-6.tif"/>
</fig>
<p>The <xref ref-type="fig" rid="fig-6">Fig. 6</xref> represents the boundary distance function, B is the cell coordinate and A is the boundary node coordinate.</p>
<p>To extract the boundary geometry from the binary density distribution, according to <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>, a cell <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is assumed to be a binarized density cell value, and a cell is designated as a boundary cell if at least one of its four neighboring cells has a different state indicating that the cell is in a transition state between solid and hollow. The boundary cell identification function is defined as follows:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi mathvariant="normal">&#x2203;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext mathvariant="italic">otherwise</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> indicates whether the node at <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a boundary node (1 for yes and 0 for no). After identifying the set of boundary nodes, the next step is to compute the coordinates of each element center, which are required for the subsequent calculation of boundary distances.</p>
<p>Based on the obtained boundary cells are transformed into boundary nodes defined as:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mtext>A</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is representing the boundary node coordinates.</p>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title>Geometry Mapping for Level Set Initialization</title>
<p>Based on the above unit center coordinates and boundary node coordinates, a signed distance function (SDF) is constructed as the initial level set. The boundary distance is defined as the minimum Euclidean distance from the center of the cell to the boundary, as follows:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">sign</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:munder><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mo>,</mml:mo></mml:math></disp-formula>here <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the boundary distance function, where <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> determines the point is positive (inside the boundary geometry), negative (outside the boundary geometry) and zero (on the boundary geometry). To ensure consistent geometric sign information, the obtained boundary function is employed to initialize the level set function, as follows:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the level set function, which acts as the initial setup for the succeeding topology optimization procedure.</p>
</sec>
<sec id="s2_3_3">
<label>2.3.3</label>
<title>Gaussian Filtering with Level Set Functions</title>
<p>To reduce the effects of protrusions, sharp corners, jagged edges, and numerical oscillations during the transition from the density field to the level set field, Gaussian filtering is introduced to ensure a smooth transition. The Gaussian filtering function is defined as follows:
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>smooth&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:munder><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>here, Gaussian core is <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is Gaussian kernel standard deviation; <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>g</mml:mi></mml:math></inline-formula> indicates relative movement in the vertical direction; <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>h</mml:mi></mml:math></inline-formula> indicates relative movement in the horizontal direction.</p>
<p>The level set function in <xref ref-type="fig" rid="fig-7">Fig. 7</xref> is Gaussian filtered to achieve a smoothing effect, which effectively reduces the high-frequency noise and details in the image or mesh, and makes the isosurfaces of the level set function more continuous and regular, which is helpful for the subsequent optimization process.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Gaussian filter plot for level set function</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-7.tif"/>
</fig>
<p>The LSM-AHF method achieves a globally reasonable topology distribution while ensuring smooth and manufacturable boundaries.</p>
</sec>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Optimization Problem</title>
<p>Building upon the initialized level set function derived above, the topology optimization problem aiming to minimize structural compliance is formulated as follows [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left" framespacing=".5em .125em"><mml:mtr><mml:mtd><mml:mrow><mml:mo movablelimits="true">min</mml:mo><mml:mo>:</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left" framespacing=".5em .125em"></mml:mtable><mml:mo>&#x2062;</mml:mo><mml:mi>J</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mtext>&#x03A9;</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mtext>&#x03A9;</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtable columnspacing="0" rowspacing="4pt" columnalign="center left" framespacing=".5em .125em"><mml:mtr><mml:mtd></mml:mtd><mml:mtd><mml:mrow><mml:mo>:</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left" framespacing=".5em .125em"></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left" framespacing=".5em .125em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>v</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mrow><mml:mi>V</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mtext>&#x03A9;</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>J</mml:mi></mml:math></inline-formula> is the compliance of the structure, <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mtext>&#x003B5;</mml:mtext></mml:math></inline-formula> is the strain tensor, <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the fourth-order constitutive tensor, <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>u</mml:mi></mml:math></inline-formula> is the real displacement field, <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula> is the area occupied by the linear elastic material, <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>v</mml:mi></mml:math></inline-formula> is the imaginary displacement field, <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the virtual displacement space, the solid material volume <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>V</mml:mi></mml:math></inline-formula>, and the prescribed target volume <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>. The formulations of the internal and external virtual energies <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, respectively, are expressed as follows:
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mi>f</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>v</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mi>g</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>v</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>D</mml:mi></mml:math></inline-formula> is the design domain; <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the Heaviside function [<xref ref-type="bibr" rid="ref-26">26</xref>]; <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula> for the boundaries of the design domain; <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a symmetric bilinear function with respect to the displacement <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>u</mml:mi></mml:math></inline-formula> and the test function <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>v</mml:mi></mml:math></inline-formula>; Under the Neumann boundary condition <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>l</mml:mi></mml:math></inline-formula> is a linear function of physical strength <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>f</mml:mi></mml:math></inline-formula> and traction <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>g</mml:mi></mml:math></inline-formula>.</p>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Sensitivity Analysis</title>
<p>Sensitivity analysis based on shape derivatives was performed under the LSM method optimization framework and the shape sensitivity analysis is derived by adjoint sensitivity analysis in this section. The first step gives the Lagrangian formula for the optimization problem [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>J</mml:mi><mml:mo>+</mml:mo><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is the Lagrangian multiplier, which <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>v</mml:mi></mml:math></inline-formula> is the accompanying displacement in the adjoint sensitivity analysis. <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref> can be reformulated as:
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-16">Eq. (16)</xref> is expressed as the material derivative of pseudo-time <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>t</mml:mi></mml:math></inline-formula> as
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where the partial derivative of time gives the so-called adjoint equation:
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>and
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>u</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>u</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The convective component of the material derivative constitutes the shape derivative, which is expressed as:
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mi>f</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>v</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>+</mml:mo><mml:mi>&#x03BA;</mml:mi><mml:mi>g</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>v</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Solve <xref ref-type="disp-formula" rid="eqn-18">Eq. (18)</xref> to get the adjoining variable <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mi>u</mml:mi></mml:math></inline-formula>. Substitute <xref ref-type="disp-formula" rid="eqn-20">(20)</xref> <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mi>u</mml:mi></mml:math></inline-formula>, ignore physical strength, and obtain
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo>,</mml:mo></mml:math></disp-formula>the normal velocity field is formulated based on the steepest descent method as follows.
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>Among them, <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> for the Lagrangian multiplier that controls the volume constraints, <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mtext>&#x003B5;</mml:mtext><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the strain energy density of the linear elastic structure. Through continuous update speed <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the iterative optimization of the structure is realized [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>].</p>
</sec>
<sec id="s2_6">
<label>2.6</label>
<title>Numerical Implementation</title>
<p>This section provides a detailed explanation of the optimization procedure for the LSM-AHF method.</p>
<p>The proposed method (LSM-AHF) uses the SIMP material removal scheme to open holes in the low strain energy region to achieve automatic hole nucleation, eliminating the influence of the initial design on the optimized design, as described in <xref ref-type="sec" rid="s2">Section 2</xref>. The method framework is decomposed into 7 steps, as shown in Algorithm 1.</p>
<fig id="fig-18">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-18.tif"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Numerical Examples</title>
<sec id="s3_1">
<label>3.1</label>
<title>Example of a 2D Optimization Study</title>
<p>To reflect the efficacy and reliability of the LSM-AHF method, verification was conducted using both 2D and 3D examples.</p>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Cantilever Beam</title>
<p>Take a cantilever beam as an example, as shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The design domain is discretized into 160 &#x00D7; 80 quadrilateral elements, with the left boundary fixed and a downward force <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mtext>N&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula> applied at the right midpoint. The Young&#x2019;s modulus of the solid material is assigned as <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, while to prevent numerical singularities, the Young&#x2019;s modulus of the hole material is specified as <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>9</mml:mn></mml:math></inline-formula>. The Poisson&#x2019;s ratio is set to <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mn>0.3</mml:mn></mml:math></inline-formula> and a volume fraction constraint of 0.4 is imposed.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Design domains and boundary conditions for cantilever beam structures</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-8.tif"/>
</fig>
<p>Based on the boundary conditions and load information, the cantilever beam is optimized by the LSM-AHF method and the resulting optimization iteration diagram, shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Optimized the historical iteration graph of the cantilever beam topology optimization under different grid resolutions: Grid I (120 &#x00D7; 60), Grid II (160 &#x00D7; 80), and Grid III (200 &#x00D7; 100)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-9.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, when the threshold is 0.05, the value of the objective function remains stable after only 28 iterations, indicating that the convergence condition is reached relatively quickly in this case. Moreover, consistent convergence behavior across different grid resolutions further demonstrates the robustness and reliability of the LSM-AHF method.</p>
<p>Taking the cantilever beam structure as an example, the effect of different judgment thresholds on the optimization results is investigated by the LSM-AHF topology optimization method proposed in this paper as shown in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparative analysis of optimization of cantilever beams with different judgment thresholds</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Judgment threshold</th>
<th>Topological structure</th>
<th>Optimal results</th>
<th>Iteration number</th>
<th>Compliance</th>
</tr>
</thead>
<tbody>
<tr>
<td>0.05</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-1.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-2.tif"/></td>
<td>83</td>
<td>78.084</td>
</tr>
<tr>
<td>0.1</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-3.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-4.tif"/></td>
<td>75</td>
<td>78.647</td>
</tr>
<tr>
<td>0.15</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-5.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-6.tif"/></td>
<td>70</td>
<td>78.824</td>
</tr>
<tr>
<td>0.2</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-7.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-8.tif"/></td>
<td>65</td>
<td>79.041</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The optimization process of the cantilever beam topology under different judgment thresholds is analyzed based on <xref ref-type="table" rid="table-1">Table 1</xref>. As the judgment threshold increases, the number of iterations decreases while the final compliance increases, indicating a trade-off between computational efficiency and solution quality. Specifically, when <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>, both the objective function value (compliance) and the volume fraction stabilize after approximately 83 iterations. Although this setting requires a longer convergence time, it yields a relatively low compliance value, suggesting that an optimal structural topology is achieved. This suggests that lower thresholds (<inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula>) are more suitable for accuracy-demanding scenarios.</p>

<p>To verify the performance of the proposed LSM-AHF method, the VFLS (Velocity field level-set) method with different initial designs is comparatively analyzed as shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison of LSM-AHF topology optimization method with the VFLS-2D MBB beams</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th align="center">Optimization method</th>
<th align="center">Initial design</th>
<th align="center">Optimization result</th>
<th align="center">Iteration number</th>
<th align="center">Compliance value</th>
<th align="center">Relative amount</th>
</tr>
</thead>
<tbody>
<tr>
<td>VFLS (1)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-9.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-10.tif"/></td>
<td>105</td>
<td>73.991</td>
<td>5.2%</td>
</tr>
<tr>
<td>VFLS (2)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-11.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-12.tif"/></td>
<td>85</td>
<td>72.988</td>
<td>6.5%</td>
</tr>
<tr>
<td>LSM-AHF</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-13.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-14.tif"/></td>
<td>83</td>
<td>78.084</td>
<td>&#x2014;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Using the VFLS method to compare the initial design 1 and initial design 2 forms uniformly in the design domain, the optimization results are shown in <xref ref-type="table" rid="table-2">Table 2</xref>, it is evident that the topology obtained from initial design 1 is suboptimal, as indicated by a relatively high structural compliance of 73.991, while the topology results obtained from Initial Design 2 yield a compliance value of 72.988, the compliance values produced by the LSM-AHF method are closely aligned with those of the VFLS method, with a difference of less than 6.5%. This consistency verifies the robustness of the proposed method.</p>

</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Messerschmitt-Bolkow-Blohm (MBB) Beam</title>
<p>The optimal design problem for the MBB beam is illustrated in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. The beam is subjected to a vertical force applied at the midpoint of its upper edge. The reference domain for this problem is a rectangular area measuring 2 &#x00D7; 1 units. The upper limit for the volume fraction in this design is set at 0.4 [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Design domain and boundary conditions of the MBB beam structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-10.tif"/>
</fig>
<p>The optimization iteration process of the MBB beam is carried out using the LSM-AHF method, and the corresponding iteration results are shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Optimized the historical iteration graph of the MBB beam under different grid resolutions: Grid I (120 &#x00D7; 60), Grid II (160 &#x00D7; 80), and Grid III (200 &#x00D7; 100)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-11.tif"/>
</fig>
<p>The iterative trends of the objective function and volume fraction are illustrated in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>. After the initial 15th iterations, the objective function gradually stabilizes. This stabilization can be attributed to the initial design&#x2019;s ability to automatically generate holes and evolve into a more complex topological configuration, which is effectively captured by the LSM-AHF framework, thereby enhancing the convergence and optimization performance. A numerical oscillation is observed around the 20th iteration, which is caused by the transition from the density field to the level set field. Moreover, the convergence behavior is observed to be consistent across different grid resolutions, indicating the reliability of the LSM-AHF method in capturing the optimization trends.</p>
<p>The optimization process of the cantilever beam topology under different judgment thresholds is analyzed based on <xref ref-type="table" rid="table-3">Table 3</xref>. As the judgment threshold increases, the number of iterations decreases while the final compliance increases. Specifically, when <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>, both the objective function value (compliance) and the volume fraction stabilize after approximately 38 iterations. Although this setting requires a longer convergence time, it yields a relatively low compliance value, suggesting that an optimal structural topology is achieved.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparative analysis of optimization of MBB beam with different judgment thresholds</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Judgment threshold</th>
<th>Topological structure</th>
<th>Optimal results</th>
<th>Iteration number</th>
<th>Compliance</th>
</tr>
</thead>
<tbody>
<tr>
<td>0.05</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-15.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-16.tif"/></td>
<td>38</td>
<td>16.774</td>
</tr>
<tr>
<td>0.1</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-17.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-18.tif"/></td>
<td>31</td>
<td>16.796</td>
</tr>
<tr>
<td>0.15</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-19.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-20.tif"/></td>
<td>30</td>
<td>16.819</td>
</tr>
<tr>
<td>0.2</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-21.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-22.tif"/></td>
<td>28</td>
<td>17.071</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To evaluate the performance of the proposed LSM-AHF method, a comparative analysis was conducted using the VFLS method applied to MBB beams with different initial designs, as summarized in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Comparison of LSM-AHF topology optimization method with the VFLS-2D MBB beams</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th align="center">Optimization method</th>
<th align="center">Initial design</th>
<th align="center">Optimization result</th>
<th align="center">Iteration number</th>
<th align="center">Compliance value</th>
<th align="center">Relative amount</th>
</tr>
</thead>
<tbody>
<tr>
<td>VFLS (1)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-23.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-24.tif"/></td>
<td>36</td>
<td>15.887</td>
<td>5.3%</td>
</tr>
<tr>
<td>VFLS (2)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-25.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-26.tif"/></td>
<td>30</td>
<td>15.843</td>
<td>5.5%</td>
</tr>
<tr>
<td>LSM-AHF</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-27.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-28.tif"/></td>
<td>38</td>
<td>16.774</td>
<td>&#x2014;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Using the VFLS method to compare the initial design 1 and initial design 2 forms uniformly in the design domain, the optimization results are shown in <xref ref-type="table" rid="table-4">Table 4</xref>, it is obvious that the topology results obtained by the initial design 1 are not very ideal, with a structural compliance of 15.887; while the topology results obtained by the initial design 2 have a compliance value of 15.843, and the structural compliance values obtained by the LSM-AHF method are close to those obtained by the VFLS method, which verifies the compliance of the method.</p>

</sec>
<sec id="s3_1_3">
<label>3.1.3</label>
<title>Cantilever Beam with Fixing Holes</title>
<p>A cantilever beam featuring fixing holes, subjected to a vertical load <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mtext>N&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula> applied to its lower right section. The reference domain is a rectangle measuring 2 &#x00D7; 1 units, with a volume fraction upper limit of 0.4, as shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Design domains and boundary conditions for cantilever structures with fixing holes</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-12.tif"/>
</fig>
<p>The optimization iteration process of the cantilever beam with fixing holes is carried out using the LSM-AHF method, and the corresponding iteration results are shown in <xref ref-type="fig" rid="fig-13">Fig. 13</xref>.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Optimized historical iteration graphs for cantilever structures with fixing holes under different grid resolutions: Grid I (120 &#x00D7; 60), Grid II (160 &#x00D7; 80), and Grid III (200 &#x00D7; 100)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-13.tif"/>
</fig>
<p>The cantilever beam with fixing holes is optimized using the LSM-AHF method. As shown in <xref ref-type="fig" rid="fig-13">Fig. 13</xref>, a noticeable numerical oscillation in the volume fraction occurs around the 13th iteration, which is attributed to the mapping process from the density field to the level set field. The solution quickly stabilizes in the subsequent iterations, demonstrating the fast convergence capability of the proposed method. Moreover, the results are consistent across different grid resolutions, confirming the robustness of the observed convergence behavior.</p>
<p>To evaluate the performance of the proposed LSM-AHF method, a comparative analysis was conducted using the VFLS method applied to cantilever beam with fixing holes with different initial designs, as summarized in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Comparison of optimization results for cantilever beams with fixing holes at different judgment thresholds</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Judgment threshold</th>
<th>Topological structure</th>
<th>Optimal results</th>
<th>Iteration number</th>
<th>Compliance</th>
</tr>
</thead>
<tbody>
<tr>
<td>0.05</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-29.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-30.tif"/></td>
<td>63</td>
<td>89.644</td>
</tr>
<tr>
<td>0.1</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-31.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-32.tif"/></td>
<td>60</td>
<td>89.729</td>
</tr>
<tr>
<td>0.15</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-33.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-34.tif"/></td>
<td>55</td>
<td>90.743</td>
</tr>
<tr>
<td>0.2</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-35.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-36.tif"/></td>
<td>53</td>
<td>89.916</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The optimization process of the cantilever beam topology under different judgment thresholds is analyzed based on <xref ref-type="table" rid="table-5">Table 5</xref>. As the judgment threshold increases, the number of iterations decreases while the final compliance increases. Specifically, when <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>, both the objective function value (compliance) and the volume fraction stabilize after approximately 60 iterations. Although this setting requires a longer convergence time, it yields a relatively low compliance value, suggesting that an optimal structural topology is achieved.</p>

<p>To evaluate the performance of the proposed LSM-AHF method, a comparative analysis was conducted using the VFLS method applied to MBB beams with different initial designs, as summarized in <xref ref-type="table" rid="table-6">Table 6</xref>.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Comparison between LSM-AHF and VFLS-2D topology optimization methods applied to a cantilever beam with fixing holes</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th align="center">Optimization method</th>
<th align="center">Initial design</th>
<th align="center">Optimization result</th>
<th align="center">Iteration number</th>
<th align="center">Compliance value</th>
<th align="center">Relative amount</th>
</tr>
</thead>
<tbody>
<tr>
<td>VFLS (1)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-37.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-38.tif"/></td>
<td>52</td>
<td>88.053</td>
<td>1.77%</td>
</tr>
<tr>
<td>VFLS (2)</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-39.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-40.tif"/></td>
<td>53</td>
<td>89.053</td>
<td>0.65%</td>
</tr>
<tr>
<td>LSM-AHF</td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-41.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_71256-inline-42.tif"/></td>
<td>63</td>
<td>89.644</td>
<td>&#x2014;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Using the VFLS method to compare the initial design 1 and initial design 2 forms uniformly in the design domain, the optimization results are shown in <xref ref-type="table" rid="table-6">Table 6</xref>, it is obvious that the topology results obtained by the initial design 1 are not very ideal, with a structural compliance of 88.053; while the topology results obtained by the initial design 2 have a compliance value of 89.053, and the structural compliance values obtained by the LSM-AHF method are close to those obtained by the VFLS method, which verifies the compliance of the method.</p>

<p>The initial SIMP stage rapidly identifies the main load-carrying paths, providing a good starting point. The subsequent LSM stage only needs to refine boundaries and optimize topology locally, which is not significantly increase computational time.</p>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>3D Optimization Study</title>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Cantilever Beam Structure</title>
<p>As shown in <xref ref-type="fig" rid="fig-14">Fig. 14</xref>, a three-dimensional cantilever beam with a reference size of 4 &#x00D7; 4 &#x00D7; 2 is analyzed. A vertical load <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mtext>N&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula> is imposed at the midpoint of its right end, and the structure must satisfy a volume constraint of 0.4 [<xref ref-type="bibr" rid="ref-29">29</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>].</p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Design domains and boundary conditions for the 3D cantilever structures</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-14.tif"/>
</fig>
<p>The iterative journey of the objective function is shown in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>. In the first 12 to 45 iterations, the value of the objective function oscillates, mainly due to the vigorous motion during the hole fusion process, evolving a complex topology from a basic topology.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Optimized historical iteration graphs of the 3D cantilever structures</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-15.tif"/>
</fig>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Three-Dimensional Simply Supported Structure</title>
<p>As shown in <xref ref-type="fig" rid="fig-16">Fig. 16</xref>, the case study considers a simply supported 3D structure with dimensions of 4 &#x00D7; 4 &#x00D7; 4, subjected to a vertical load <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mtext>N&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula> at the midpoint of the top face, with a volume constraint set at 0.4.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Design domains and boundary conditions for the 3D supported structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-16.tif"/>
</fig>
<p>The iterative journey of the objective function is shown in <xref ref-type="fig" rid="fig-17">Fig. 17</xref>. in the first 25 to 35 iterations, the value of the objective function oscillates, mainly due to the vigorous motion during the hole fusion process, generating a complex topology from a trivial topology. Moreover, the LSM-AHF method can be readily extended to the design of composite and graded material structures [<xref ref-type="bibr" rid="ref-31">31</xref>,<xref ref-type="bibr" rid="ref-32">32</xref>]. With more flexible encoding strategies, it can also be applied to the optimization of GPL (Graphene Platelet) distributions and different foundation types, thereby broadening its applicability.</p>
<fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Optimized historical iteration graphs of the 3D supported structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_71256-fig-17.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>To address the limitation of the level set method (LSM) in autonomously generating new holes during topological evolution, a novel level set-based topology optimization method with autonomous hole formation capability (LSM-AHF) is introduced in this research The approach first applies a judgment threshold to the SIMP density field to obtain a clearly defined porous initial design. Then, the boundary of this porous initial design is extracted and used to construct a signed distance model, enabling a consistent and accurate mapping from the density field to the level set field. This mapping allows the design to smoothly transition into the LSM framework for further structural optimization. Numerical examples demonstrate that the proposed LSM-AHF significantly improves topological adaptability and optimization effectiveness. By addressing the hole-nucleation limitation of traditional LSM and resolving the boundary irregularity of SIMP-based designs, the method offers a robust and unified solution for topology optimization with enhanced geometric and structural performance. Future work will focus on incorporating experimental validation to calibrate material parameters and verify optimized designs, thereby enhancing the reliability and applicability of the proposed framework. Moreover, the proposed method is general and can be extended to other types of composite structures, different geometries, and diverse loading scenarios.</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported by the National Natural Science Foundation of China [52475096]; Guangxi Natural Science Fund for Distinguished Young Scholars [2025GXNSFFA069009]; Bagui Outstanding Youth Program of Guangxi, China; Natural Science and Technology Innovation Development Doubling Plan Project of Guangxi University, China [2024BZRC010]; Innovation Project of Guangxi Graduate Education, China [YCBZ2025014].</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Fei Wu developed the research framework, performed theoretical derivations, and drafted the manuscript. Ziyang Zeng conducted result interpretation and revised the manuscript accordingly. Kunliang Xie prepared the figures and conducted data analysis. Yuqiang Liu contributed to the development of the research manuscript revisions. Jiang Ding contributed to the research framework and manuscript preparation. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The data that support the findings of this study are available from the corresponding author upon reasonable request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Allaire</surname> <given-names>G</given-names></string-name>, <string-name><surname>Jouve</surname> <given-names>F</given-names></string-name>, <string-name><surname>Toader</surname> <given-names>AM</given-names></string-name></person-group>. <article-title>Structural optimization using sensitivity analysis and a level-set method</article-title>. <source>J Comput Phys</source>. <year>2004</year>;<volume>194</volume>:<fpage>363</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jcp.2003.09.032</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>A level set method for structural topology optimization and its applications</article-title>. <source>Adv Eng Softw</source>. <year>2004</year>;<volume>35</volume>:<fpage>415</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.advengsoft.2004.06.004</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Van Dijk</surname> <given-names>NP</given-names></string-name>, <string-name><surname>Maute</surname> <given-names>K</given-names></string-name>, <string-name><surname>Langelaar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Van Keulen</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Level-set methods for structural topology optimization: a review</article-title>. <source>Struct Multidisc Optim</source>. <year>2013</year>;<volume>48</volume>:<fpage>437</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-013-0912-y</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>MY</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>D</given-names></string-name></person-group>. <article-title>A level set method for structural topology optimization</article-title>. <source>Comput Methods Appl Mech Eng</source>. <year>2003</year>;<volume>192</volume>:<fpage>227</fpage>&#x2013;<lpage>46</lpage>. doi:<pub-id pub-id-type="doi">10.1016/S0045-7825(02)00559-5</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Eschenauer</surname> <given-names>HA</given-names></string-name>, <string-name><surname>Kobelev</surname> <given-names>VV</given-names></string-name>, <string-name><surname>Schumacher</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Bubble method for topology and shape optimization of structures</article-title>. <source>Struct Optim</source>. <year>1994</year>;<volume>8</volume>:<fpage>42</fpage>&#x2013;<lpage>51</lpage>. doi:<pub-id pub-id-type="doi">10.1007/BF01742933</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Burger</surname> <given-names>M</given-names></string-name>, <string-name><surname>Hackl</surname> <given-names>B</given-names></string-name>, <string-name><surname>Ring</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Incorporating topological derivatives into level set methods</article-title>. <source>J Comput Phys</source>. <year>2004</year>;<volume>194</volume>:<fpage>344</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jcp.2003.09.033</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cai</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>W</given-names></string-name></person-group>. <article-title>An adaptive bubble method for structural shape and topology optimization</article-title>. <source>Comput Methods Appl Mech Eng</source>. <year>2020</year>;<volume>360</volume>:<fpage>112778</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cma.2019.112778</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Challis</surname> <given-names>VJ</given-names></string-name></person-group>. <article-title>A discrete level-set topology optimization code written in Matlab</article-title>. <source>Struct Multidisc Optim</source>. <year>2010</year>;<volume>41</volume>:<fpage>453</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-009-0430-0</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wei</surname> <given-names>P</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>MY</given-names></string-name></person-group>. <article-title>An 88-line MATLAB code for the parameterized level set method based topology optimization using radial basis functions</article-title>. <source>Struct Multidisc Optim</source>. <year>2018</year>;<volume>58</volume>:<fpage>831</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-018-1904-8</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname> <given-names>J</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tong</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>MY</given-names></string-name></person-group>. <article-title>A semi-implicit level set method for structural shape and topology optimization</article-title>. <source>J Comput Phys</source>. <year>2008</year>;<volume>227</volume>:<fpage>5561</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jcp.2008.02.003</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ullah</surname> <given-names>B</given-names></string-name></person-group>. <article-title>A coupled meshless element-free galerkin and radial basis functions method for level set-based topology optimization</article-title>. <source>J Braz Soc Mech Sci Eng</source>. <year>2022</year>;<volume>44</volume>(<issue>3</issue>):<fpage>89</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s40430-022-03382-5</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ullah</surname> <given-names>B</given-names></string-name>, <string-name><surname>Ullah</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>W</given-names></string-name></person-group>. <article-title>A parametrized level set based topology optimization method for analysing thermal problems</article-title>. <source>Comput Math Appl</source>. <year>2021</year>;<volume>99</volume>:<fpage>99</fpage>&#x2013;<lpage>112</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.camwa.2021.07.018</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Oellerich</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yamada</surname> <given-names>T</given-names></string-name></person-group>. <article-title>A level set topology optimization theory based on Hamilton&#x2019;s principle</article-title>. <source>Int J Numer Methods Eng</source>. <year>2025</year>;<volume>126</volume>(<issue>17</issue>):<fpage>e70120</fpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xia</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Stable hole nucleation in level set based topology optimization by using the material removal scheme of BESO</article-title>. <source>Comput Methods Appl Mech Eng</source>. <year>2019</year>;<volume>343</volume>:<fpage>438</fpage>&#x2013;<lpage>52</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cma.2018.09.002</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>A parameter-free approach to determine the lagrange multiplier in the level set method by using the BESO</article-title>. <source>Comput Model Eng Sci</source>. <year>2021</year>;<volume>128</volume>:<fpage>283</fpage>&#x2013;<lpage>95</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2021.015975</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Park</surname> <given-names>KS</given-names></string-name>, <string-name><surname>Youn</surname> <given-names>SK</given-names></string-name></person-group>. <article-title>Topology optimization of shell structures using adaptive inner-front (AIF) level set method</article-title>. <source>Struct Multidisc Optim</source>. <year>2008</year>;<volume>36</volume>:<fpage>43</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-007-0169-4</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Xing</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Nong</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Discrete level set method enhanced by conformal mapping: an efficient approach for topology optimization of piezoelectric energy harvesters</article-title>. <source>Struct Multidisc Optim</source>. <year>2024</year>;<volume>67</volume>:<fpage>173</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-024-03893-w</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rozvany</surname> <given-names>GIN</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>M</given-names></string-name></person-group>. <article-title>The COC algorithm, part I: cross-section optimization or sizing</article-title>. <source>Comput Methods Appl Mech Eng</source>. <year>1991</year>;<volume>89</volume>:<fpage>281</fpage>&#x2013;<lpage>308</lpage>. doi:<pub-id pub-id-type="doi">10.1016/0045-7825(91)90045-8</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Andreassen</surname> <given-names>E</given-names></string-name>, <string-name><surname>Clausen</surname> <given-names>A</given-names></string-name>, <string-name><surname>Schevenels</surname> <given-names>M</given-names></string-name>, <string-name><surname>Lazarov</surname> <given-names>BS</given-names></string-name>, <string-name><surname>Sigmund</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Efficient topology optimization in MATLAB using 88 lines of code</article-title>. <source>Struct Multidisc Optim</source>. <year>2011</year>;<volume>43</volume>:<fpage>1</fpage>&#x2013;<lpage>16</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-010-0594-7</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ming</surname> <given-names>Zhou</given-names></string-name>, <string-name><surname>Sigmund</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Complementary lecture notes for teaching the 99/88-line topology optimization codes</article-title>. <source>Struct Multidiscip Optim</source>. <year>2021</year>;<volume>64</volume>(<issue>5</issue>):<fpage>3227</fpage>&#x2013;<lpage>31</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-021-03004-z</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>E</given-names></string-name>, <string-name><surname>Liao</surname> <given-names>J</given-names></string-name></person-group>. <article-title>An explicit and implicit hybrid method for structural topology optimization</article-title>. <source>J Phys</source>. <year>2021</year>;<volume>1820</volume>:<fpage>012183</fpage>. doi:<pub-id pub-id-type="doi">10.1088/1742-6596/1820/1/012183</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>YM</given-names></string-name></person-group>. <source>Evolutionary topology optimization of continuum structures: methods and applications</source>. <edition>1st ed</edition>. <publisher-loc>Hoboken, NJ, USA</publisher-loc>: <publisher-name>John Wiley &#x0026; Sons, Inc.</publisher-name>; <year>2010</year>. doi:<pub-id pub-id-type="doi">10.1002/9780470689486</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Garrido-Jurado</surname> <given-names>S</given-names></string-name>, <string-name><surname>Mu&#x00F1;oz-Salinas</surname> <given-names>R</given-names></string-name>, <string-name><surname>Madrid-Cuevas</surname> <given-names>FJ</given-names></string-name>, <string-name><surname>Mar&#x00ED;n-Jim&#x00E9;nez</surname> <given-names>MJ</given-names></string-name></person-group>. <article-title>Automatic generation and detection of highly reliable fiducial markers under occlusion</article-title>. <source>Pattern Recognit</source>. <year>2014</year>;<volume>47</volume>:<fpage>2280</fpage>&#x2013;<lpage>92</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.patcog.2014.01.005</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Kang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Velocity field level-set method for topological shape optimization using freely distributed design variables</article-title>. <source>Int J Numer Methods Eng</source>. <year>2019</year>;<volume>120</volume>:<fpage>1411</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.1002/nme.6185</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname> <given-names>M</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>G</given-names></string-name>, <string-name><surname>Pan</surname> <given-names>M</given-names></string-name></person-group>. <article-title>The parameterized level set method for structural topology optimization with shape sensitivity constraint factor</article-title>. <source>Eng Comput</source>. <year>2021</year>;<volume>37</volume>:<fpage>855</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00366-019-00860-8</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Osher</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sethian</surname> <given-names>JA</given-names></string-name></person-group>. <article-title>Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations</article-title>. <source>J Comput Phys</source>. <year>1988</year>;<volume>79</volume>:<fpage>12</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1016/0021-9991(88)90002-2</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>J</given-names></string-name>, <string-name><surname>Xing</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Nong</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Level set function based on conformal geometry theory: an efficient approach for optimization of shell structure with arbitrary gaussian curvature</article-title>. <source>Structures</source>. <year>2023</year>;<volume>56</volume>:<fpage>104995</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.istruc.2023.104995</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Tong</surname> <given-names>L</given-names></string-name>, <string-name><surname>Kang</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>A level set method for structural shape and topology optimization using radial basis functions</article-title>. <source>Comput Struct</source>. <year>2009</year>;<volume>87</volume>:<fpage>425</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compstruc.2009.01.008</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Deng</surname> <given-names>H</given-names></string-name>, <string-name><surname>Vulimiri</surname> <given-names>PS</given-names></string-name>, <string-name><surname>To</surname> <given-names>AC</given-names></string-name></person-group>. <article-title>An efficient 146-line 3D sensitivity analysis code of stress-based topology optimization written in MATLAB</article-title>. <source>Optim Eng</source>. <year>2022</year>;<volume>23</volume>:<fpage>1733</fpage>&#x2013;<lpage>57</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11081-021-09675-3</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>An improved partial differential equation filter scheme for topology optimization of additively manufactured coated structure</article-title>. <source>Comput Struct</source>. <year>2023</year>;<volume>288</volume>:<fpage>107147</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compstruc.2023.107147</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Banh</surname> <given-names>TT</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Multi-material topology optimization design for continuum structures with crack patterns</article-title>. <source>Compos Struct</source>. <year>2018</year>;<volume>186</volume>:<fpage>193</fpage>&#x2013;<lpage>209</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compstruct.2017.12.004</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Banh</surname> <given-names>TT</given-names></string-name>, <string-name><surname>Lieu</surname> <given-names>QX</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>J</given-names></string-name>, <string-name><surname>Kang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>D</given-names></string-name></person-group>. <article-title>A robust dynamic unified multi-material topology optimization method for functionally graded structures</article-title>. <source>Struct Multidiscip Optim</source>. <year>2023</year>;<volume>66</volume>(<issue>4</issue>):<fpage>75</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-023-03410-3</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>