Loading…

Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method

The structural complexity (the number of holes) of the 2D or 3D continuum structures can be measured by their topology invariants (i.e., Euler and Betti numbers). Controlling the 2D and 3D structural complexity is significant in topology optimization design because of the various consideration, incl...

Full description

Saved in:
Bibliographic Details
Published in:Computer methods in applied mechanics and engineering 2022-02, Vol.389, p.114302, Article 114302
Main Authors: Liang, Yuan, Yan, XinYu, Cheng, GengDong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3
cites cdi_FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3
container_end_page
container_issue
container_start_page 114302
container_title Computer methods in applied mechanics and engineering
container_volume 389
creator Liang, Yuan
Yan, XinYu
Cheng, GengDong
description The structural complexity (the number of holes) of the 2D or 3D continuum structures can be measured by their topology invariants (i.e., Euler and Betti numbers). Controlling the 2D and 3D structural complexity is significant in topology optimization design because of the various consideration, including manufacturability and necessary structural redundancy, but remains a challenging subject. In this paper, we propose a programmable Euler–Poincaré formula to efficiently calculate the Euler and Betti numbers for the 0–1 pixel-based structures. This programmable Euler–Poincaré​ formula only relates to the nodal density and nodal characteristic vector that represents the nodal neighbor relation so that it avoids manually counting the information of the vertices, edges, and planes on the surfaces of the structure. As a result, the explicit formulations between the structural complexity (the number of holes) and the discrete density design variables for 2D and 3D continuum structures can be efficiently constructed. Furthermore, the discrete variable sensitivity of the structural complexity is calculated through the programmable Euler–Poincaré formula so that the structural complexity control problem can be efficiently and mathematically solved by Sequential Approximate Integer Programming and Canonical relaxation algorithm Various 2D and complicated 3D numerical examples are presented to demonstrate the effectiveness of the method. We further believe that this study bridges the gap between structural topology optimization and mathematical topology analysis, which is much expected in the structural optimization community.
doi_str_mv 10.1016/j.cma.2021.114302
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2639721237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0045782521005946</els_id><sourcerecordid>2639721237</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3</originalsourceid><addsrcrecordid>eNp9kMlOwzAQhi0EEqXwANwscU7xklWcUFsWqRIXOFuOPQFHSRxsp2p5elyFM3OZkeb_Z_kQuqVkRQnN79uV6uWKEUZXlKacsDO0oGVRJYzy8hwtCEmzpChZdomuvG9JjJKyBYLtYeyMMgErOwRnO2wbzDZYDhrzDfbBTSpMTnax348dHEw44vqItfHKQQC8l87IugMc7Gg7-3nEdgymNz8yGDvgHsKX1dfoopGdh5u_vEQfT9v39Uuye3t-XT_uEsVZFpIG0rLSdZ0pratcpyxtUg1N_EbpWGtOqwwkpEWtG6BVUROl66rSOS9TnheSL9HdPHd09nsCH0RrJzfElYLlvCoYZbyIKjqrlLPeO2jE6Ewv3VFQIk40RSsiTXGiKWaa0fMweyCevzfghFcGBgXaOFBBaGv-cf8C2Hd-rw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2639721237</pqid></control><display><type>article</type><title>Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Liang, Yuan ; Yan, XinYu ; Cheng, GengDong</creator><creatorcontrib>Liang, Yuan ; Yan, XinYu ; Cheng, GengDong</creatorcontrib><description>The structural complexity (the number of holes) of the 2D or 3D continuum structures can be measured by their topology invariants (i.e., Euler and Betti numbers). Controlling the 2D and 3D structural complexity is significant in topology optimization design because of the various consideration, including manufacturability and necessary structural redundancy, but remains a challenging subject. In this paper, we propose a programmable Euler–Poincaré formula to efficiently calculate the Euler and Betti numbers for the 0–1 pixel-based structures. This programmable Euler–Poincaré​ formula only relates to the nodal density and nodal characteristic vector that represents the nodal neighbor relation so that it avoids manually counting the information of the vertices, edges, and planes on the surfaces of the structure. As a result, the explicit formulations between the structural complexity (the number of holes) and the discrete density design variables for 2D and 3D continuum structures can be efficiently constructed. Furthermore, the discrete variable sensitivity of the structural complexity is calculated through the programmable Euler–Poincaré formula so that the structural complexity control problem can be efficiently and mathematically solved by Sequential Approximate Integer Programming and Canonical relaxation algorithm Various 2D and complicated 3D numerical examples are presented to demonstrate the effectiveness of the method. We further believe that this study bridges the gap between structural topology optimization and mathematical topology analysis, which is much expected in the structural optimization community.</description><identifier>ISSN: 0045-7825</identifier><identifier>EISSN: 1879-2138</identifier><identifier>DOI: 10.1016/j.cma.2021.114302</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Apexes ; Complexity ; Density ; Design optimization ; Euler and Betti number ; Formulations ; Graph theory ; Integer programming ; Manufacturability ; Optimization ; Redundancy ; Structural complexity control ; Topology invariants ; Topology optimization</subject><ispartof>Computer methods in applied mechanics and engineering, 2022-02, Vol.389, p.114302, Article 114302</ispartof><rights>2021 Elsevier B.V.</rights><rights>Copyright Elsevier BV Feb 1, 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3</citedby><cites>FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Liang, Yuan</creatorcontrib><creatorcontrib>Yan, XinYu</creatorcontrib><creatorcontrib>Cheng, GengDong</creatorcontrib><title>Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method</title><title>Computer methods in applied mechanics and engineering</title><description>The structural complexity (the number of holes) of the 2D or 3D continuum structures can be measured by their topology invariants (i.e., Euler and Betti numbers). Controlling the 2D and 3D structural complexity is significant in topology optimization design because of the various consideration, including manufacturability and necessary structural redundancy, but remains a challenging subject. In this paper, we propose a programmable Euler–Poincaré formula to efficiently calculate the Euler and Betti numbers for the 0–1 pixel-based structures. This programmable Euler–Poincaré​ formula only relates to the nodal density and nodal characteristic vector that represents the nodal neighbor relation so that it avoids manually counting the information of the vertices, edges, and planes on the surfaces of the structure. As a result, the explicit formulations between the structural complexity (the number of holes) and the discrete density design variables for 2D and 3D continuum structures can be efficiently constructed. Furthermore, the discrete variable sensitivity of the structural complexity is calculated through the programmable Euler–Poincaré formula so that the structural complexity control problem can be efficiently and mathematically solved by Sequential Approximate Integer Programming and Canonical relaxation algorithm Various 2D and complicated 3D numerical examples are presented to demonstrate the effectiveness of the method. We further believe that this study bridges the gap between structural topology optimization and mathematical topology analysis, which is much expected in the structural optimization community.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Complexity</subject><subject>Density</subject><subject>Design optimization</subject><subject>Euler and Betti number</subject><subject>Formulations</subject><subject>Graph theory</subject><subject>Integer programming</subject><subject>Manufacturability</subject><subject>Optimization</subject><subject>Redundancy</subject><subject>Structural complexity control</subject><subject>Topology invariants</subject><subject>Topology optimization</subject><issn>0045-7825</issn><issn>1879-2138</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kMlOwzAQhi0EEqXwANwscU7xklWcUFsWqRIXOFuOPQFHSRxsp2p5elyFM3OZkeb_Z_kQuqVkRQnN79uV6uWKEUZXlKacsDO0oGVRJYzy8hwtCEmzpChZdomuvG9JjJKyBYLtYeyMMgErOwRnO2wbzDZYDhrzDfbBTSpMTnax348dHEw44vqItfHKQQC8l87IugMc7Gg7-3nEdgymNz8yGDvgHsKX1dfoopGdh5u_vEQfT9v39Uuye3t-XT_uEsVZFpIG0rLSdZ0pratcpyxtUg1N_EbpWGtOqwwkpEWtG6BVUROl66rSOS9TnheSL9HdPHd09nsCH0RrJzfElYLlvCoYZbyIKjqrlLPeO2jE6Ewv3VFQIk40RSsiTXGiKWaa0fMweyCevzfghFcGBgXaOFBBaGv-cf8C2Hd-rw</recordid><startdate>20220201</startdate><enddate>20220201</enddate><creator>Liang, Yuan</creator><creator>Yan, XinYu</creator><creator>Cheng, GengDong</creator><general>Elsevier B.V</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20220201</creationdate><title>Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method</title><author>Liang, Yuan ; Yan, XinYu ; Cheng, GengDong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Complexity</topic><topic>Density</topic><topic>Design optimization</topic><topic>Euler and Betti number</topic><topic>Formulations</topic><topic>Graph theory</topic><topic>Integer programming</topic><topic>Manufacturability</topic><topic>Optimization</topic><topic>Redundancy</topic><topic>Structural complexity control</topic><topic>Topology invariants</topic><topic>Topology optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liang, Yuan</creatorcontrib><creatorcontrib>Yan, XinYu</creatorcontrib><creatorcontrib>Cheng, GengDong</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer methods in applied mechanics and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liang, Yuan</au><au>Yan, XinYu</au><au>Cheng, GengDong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method</atitle><jtitle>Computer methods in applied mechanics and engineering</jtitle><date>2022-02-01</date><risdate>2022</risdate><volume>389</volume><spage>114302</spage><pages>114302-</pages><artnum>114302</artnum><issn>0045-7825</issn><eissn>1879-2138</eissn><abstract>The structural complexity (the number of holes) of the 2D or 3D continuum structures can be measured by their topology invariants (i.e., Euler and Betti numbers). Controlling the 2D and 3D structural complexity is significant in topology optimization design because of the various consideration, including manufacturability and necessary structural redundancy, but remains a challenging subject. In this paper, we propose a programmable Euler–Poincaré formula to efficiently calculate the Euler and Betti numbers for the 0–1 pixel-based structures. This programmable Euler–Poincaré​ formula only relates to the nodal density and nodal characteristic vector that represents the nodal neighbor relation so that it avoids manually counting the information of the vertices, edges, and planes on the surfaces of the structure. As a result, the explicit formulations between the structural complexity (the number of holes) and the discrete density design variables for 2D and 3D continuum structures can be efficiently constructed. Furthermore, the discrete variable sensitivity of the structural complexity is calculated through the programmable Euler–Poincaré formula so that the structural complexity control problem can be efficiently and mathematically solved by Sequential Approximate Integer Programming and Canonical relaxation algorithm Various 2D and complicated 3D numerical examples are presented to demonstrate the effectiveness of the method. We further believe that this study bridges the gap between structural topology optimization and mathematical topology analysis, which is much expected in the structural optimization community.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.cma.2021.114302</doi></addata></record>
fulltext fulltext
identifier ISSN: 0045-7825
ispartof Computer methods in applied mechanics and engineering, 2022-02, Vol.389, p.114302, Article 114302
issn 0045-7825
1879-2138
language eng
recordid cdi_proquest_journals_2639721237
source ScienceDirect Freedom Collection 2022-2024
subjects Algorithms
Apexes
Complexity
Density
Design optimization
Euler and Betti number
Formulations
Graph theory
Integer programming
Manufacturability
Optimization
Redundancy
Structural complexity control
Topology invariants
Topology optimization
title Explicit control of 2D and 3D structural complexity by discrete variable topology optimization method
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A48%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Explicit%20control%20of%202D%20and%203D%20structural%20complexity%20by%20discrete%20variable%20topology%20optimization%20method&rft.jtitle=Computer%20methods%20in%20applied%20mechanics%20and%20engineering&rft.au=Liang,%20Yuan&rft.date=2022-02-01&rft.volume=389&rft.spage=114302&rft.pages=114302-&rft.artnum=114302&rft.issn=0045-7825&rft.eissn=1879-2138&rft_id=info:doi/10.1016/j.cma.2021.114302&rft_dat=%3Cproquest_cross%3E2639721237%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c325t-fe489dbb5cdd96d424f4def302cd24fd3195eae47bdfe197b0cdb99d6384367a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2639721237&rft_id=info:pmid/&rfr_iscdi=true