Pub Date : 2024-03-15DOI: 10.1016/j.cad.2024.103706
Han Zhang , Hang Dai , Wenjing Ren
This study proposes a design method to generate multivariable control chalice-shaped columns based on multi-objective optimization leveraging SubD modelling technology to smooth the geometric transition between slab and column. Taking horizontal force into consideration, the paper introduces total material usage as both an optimization objective and an important basis for final solution selection to gain a more elegant and dynamic form needed in architectural design. The paper applies the method to examples of both single-column and multi-column structures. The outcome is chalice-shaped columns balancing structural efficiency and aesthetic requirements.
{"title":"A study on the design method of multivariable control chalice-shaped columns considering horizontal forces based on multi-objective optimization","authors":"Han Zhang , Hang Dai , Wenjing Ren","doi":"10.1016/j.cad.2024.103706","DOIUrl":"10.1016/j.cad.2024.103706","url":null,"abstract":"<div><p>This study proposes a design method to generate multivariable control chalice-shaped columns based on multi-objective optimization leveraging SubD modelling technology to smooth the geometric transition between slab and column. Taking horizontal force into consideration, the paper introduces total material usage as both an optimization objective and an important basis for final solution selection to gain a more elegant and dynamic form needed in architectural design. The paper applies the method to examples of both single-column and multi-column structures. The outcome is chalice-shaped columns balancing structural efficiency and aesthetic requirements.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103706"},"PeriodicalIF":4.3,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140198554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-11DOI: 10.1016/j.cad.2024.103703
Depeng Gao, Yang Gao, Hongwei Lin
Porous structures are intricate solid materials with numerous small pores, extensively used in fields like medicine, chemical engineering, and aerospace. However, the design of such structures using computer-aided tools is a time-consuming and tedious process. In this study, we propose a novel representation method and design approach for porous units that can be infinitely spliced to form a porous structure. We use periodic B-spline functions to represent periodic or symmetric porous units. Starting from a voxel representation of a porous sample, the discrete distance field is computed. To fit the discrete distance field with a periodic B-spline, we introduce the constrained least squares progressive-iterative approximation algorithm, which results in an implicit porous unit. This unit can be subject to optimization to enhance connectivity and utilized for topology optimization, thereby improving the model’s stiffness while maintaining periodicity or symmetry. The experimental results demonstrate the potential of the designed complex porous units in enhancing the mechanical performance of the model. Consequently, this study has the potential to incorporate remarkable structures derived from artificial design or nature into the design of high-performing models, showing the promise for biomimetic applications.
{"title":"Periodic implicit representation, design and optimization of porous structures using periodic B-splines","authors":"Depeng Gao, Yang Gao, Hongwei Lin","doi":"10.1016/j.cad.2024.103703","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103703","url":null,"abstract":"<div><p>Porous structures are intricate solid materials with numerous small pores, extensively used in fields like medicine, chemical engineering, and aerospace. However, the design of such structures using computer-aided tools is a time-consuming and tedious process. In this study, we propose a novel representation method and design approach for porous units that can be infinitely spliced to form a porous structure. We use periodic B-spline functions to represent periodic or symmetric porous units. Starting from a voxel representation of a porous sample, the discrete distance field is computed. To fit the discrete distance field with a periodic B-spline, we introduce the constrained least squares progressive-iterative approximation algorithm, which results in an implicit porous unit. This unit can be subject to optimization to enhance connectivity and utilized for topology optimization, thereby improving the model’s stiffness while maintaining periodicity or symmetry. The experimental results demonstrate the potential of the designed complex porous units in enhancing the mechanical performance of the model. Consequently, this study has the potential to incorporate remarkable structures derived from artificial design or nature into the design of high-performing models, showing the promise for biomimetic applications.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103703"},"PeriodicalIF":4.3,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140121990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-28DOI: 10.1016/j.cad.2024.103696
Mauhing Yip , Annette Stahl , Christian Schellewald
In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of the mesh. The proposed automated hole-detection method is valuable to the computer-aided design (CAD) community as all boundary-edges within the mesh are utilized and for each boundary-edge the algorithm guarantees both the existence and the uniqueness of the boundary associated to it. As existing hole-detection approaches assume that singular vertices are absent or may require mesh modification, these methods are ill-equipped to detect boundaries/holes in real-world meshes that contain singular vertices. We demonstrate the method in an underwater autonomous robotic application, exploiting surface reconstruction methods based on point cloud data. In such a scenario the determined holes can be interpreted as information gaps, enabling timely corrective action during the data acquisition. However, the scope of our method is not confined to these two sectors alone; it is versatile enough to be applied on any edge-manifold triangle mesh. An evaluation of the method is performed on both synthetic and real-world data (including a triangle mesh from a point cloud obtained by a multibeam sonar). The source code of our reference implementation is available: https://github.com/Mauhing/hole-detection-on-triangle-mesh.
{"title":"Robust Hole-Detection in Triangular Meshes Irrespective of the Presence of Singular Vertices","authors":"Mauhing Yip , Annette Stahl , Christian Schellewald","doi":"10.1016/j.cad.2024.103696","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103696","url":null,"abstract":"<div><p>In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of the mesh. The proposed automated hole-detection method is valuable to the computer-aided design (CAD) community as all boundary-edges within the mesh are utilized and for each boundary-edge the algorithm guarantees both the existence and the uniqueness of the boundary associated to it. As existing hole-detection approaches assume that singular vertices are absent or may require mesh modification, these methods are ill-equipped to detect boundaries/holes in real-world meshes that contain singular vertices. We demonstrate the method in an underwater autonomous robotic application, exploiting surface reconstruction methods based on point cloud data. In such a scenario the determined holes can be interpreted as information gaps, enabling timely corrective action during the data acquisition. However, the scope of our method is not confined to these two sectors alone; it is versatile enough to be applied on any edge-manifold triangle mesh. An evaluation of the method is performed on both synthetic and real-world data (including a triangle mesh from a point cloud obtained by a multibeam sonar). The source code of our reference implementation is available: <span>https://github.com/Mauhing/hole-detection-on-triangle-mesh</span><svg><path></path></svg>.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103696"},"PeriodicalIF":4.3,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S001044852400023X/pdfft?md5=15189e6bb47b6319e85b8bbbfd406777&pid=1-s2.0-S001044852400023X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140024119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-20DOI: 10.1016/j.cad.2024.103695
Jean-Philippe Jasienski , Yuchi Shen , Patrick Ole Ohlbrock , Denis Zastavni , Pierluigi D'Acunto
This article presents a computational implementation for the Vector-based Graphic Statics (VGS) framework making it an effective CAD tool for the design of spatial structures in static equilibrium (VGS-tool). The paper introduces several key features that convert a purely theoretical graph and geometry based framework into a fully automated computational procedure, including the following new contributions: a general algorithm for constructing 3-dimensional interdependent force and force diagrams; the implementation of a procedure that allows the interdependent transformation of both diagrams; an approach to apply specific constraints to the computationally generated diagrams; the integration of the algorithms as a plug-in for a CAD environment (Grasshopper3D of Rhino3D). The main features of the proposed framework are highlighted with a design case study developed using the newly introduced CAD plug-in (namely the VGS-tool). This plugin uses synthetic-oriented and intuitive graphical representation to allow the user to design spatial structures in equilibrium as three-dimensional trusses. The goal is to facilitate collaboration between structural engineers and architects during the conceptual phase of the design process.
{"title":"A computational implementation of Vector-based 3D Graphic Statics (VGS) for interactive and real-time structural design","authors":"Jean-Philippe Jasienski , Yuchi Shen , Patrick Ole Ohlbrock , Denis Zastavni , Pierluigi D'Acunto","doi":"10.1016/j.cad.2024.103695","DOIUrl":"10.1016/j.cad.2024.103695","url":null,"abstract":"<div><p>This article presents a computational implementation for the Vector-based Graphic Statics (VGS) framework making it an effective CAD tool for the design of spatial structures in static equilibrium (VGS-tool). The paper introduces several key features that convert a purely theoretical graph and geometry based framework into a fully automated computational procedure, including the following new contributions: a general algorithm for constructing 3-dimensional interdependent force and force diagrams; the implementation of a procedure that allows the interdependent transformation of both diagrams; an approach to apply specific constraints to the computationally generated diagrams; the integration of the algorithms as a plug-in for a CAD environment (Grasshopper3D of Rhino3D). The main features of the proposed framework are highlighted with a design case study developed using the newly introduced CAD plug-in (namely the VGS-tool). This plugin uses synthetic-oriented and intuitive graphical representation to allow the user to design spatial structures in equilibrium as three-dimensional trusses. The goal is to facilitate collaboration between structural engineers and architects during the conceptual phase of the design process.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103695"},"PeriodicalIF":4.3,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139956210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-17DOI: 10.1016/j.cad.2024.103686
Marián Fabian, Pavel Chalmovianský, Martina Bátorová
This paper deals with surfaces covering a set of spheres, whose centers form polyhedra. We propose novel methods of skinning based on homotopic deformation for the considered case. A method starts with a regular surface with a simple construction which can be deformed in a many ways. We demonstrate some of them in a few examples. The method is compared to the existing solutions by the new approach implementation and the visualization of the obtained results.
{"title":"Homotopy Based Skinning of Spheres","authors":"Marián Fabian, Pavel Chalmovianský, Martina Bátorová","doi":"10.1016/j.cad.2024.103686","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103686","url":null,"abstract":"<div><p>This paper deals with surfaces covering a set of spheres, whose centers form polyhedra. We propose novel methods of skinning based on homotopic deformation for the considered case. A method starts with a regular surface with a simple construction which can be deformed in a many ways. We demonstrate some of them in a few examples. The method is compared to the existing solutions by the new approach implementation and the visualization of the obtained results.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103686"},"PeriodicalIF":4.3,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448524000137/pdfft?md5=8a10d41ad4d81b9aa8d4f06921111f99&pid=1-s2.0-S0010448524000137-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139907355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-13DOI: 10.1016/j.cad.2024.103694
Arun Rehal , Dibakar Sen
The current practice of manual wire harness design is labor-intensive, time-consuming, costly, and error-prone. In this paper, we present a methodology for completely automated wire harness design. We propose a topological approach that yields all the possible electrically admissible but topologically distinct harness system layouts that can be used to connect the specified terminals. Each generated layout represents a possible harness design. For layout generation, the proposed method utilizes the so-called routing graphs associated with the closed surfaces bounding the product. The developed methods are able to handle both — (1) On-Surface routing, when the wires are required to be constrained to the surface of the product, and (2) In-Air routing, when in addition to the surface the wires are also allowed to be embedded in product’s ambiance. For the final geometric embedding of the generated harnesses, we present an optimization-based methodology that determines the optimum lengths of the segments over which the wires should be bundled together. The results presented demonstrate the efficacy of the proposed approach through multiple realistic examples.
{"title":"A Novel Topological Method for Automated and Exhaustive Wire Harness Design","authors":"Arun Rehal , Dibakar Sen","doi":"10.1016/j.cad.2024.103694","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103694","url":null,"abstract":"<div><p>The current practice of manual wire harness design is labor-intensive, time-consuming, costly, and error-prone. In this paper, we present a methodology for completely automated wire harness design. We propose a topological approach that yields all the possible electrically admissible but topologically distinct harness system layouts that can be used to connect the specified terminals. Each generated layout represents a possible harness design. For layout generation, the proposed method utilizes the so-called routing graphs associated with the closed surfaces bounding the product. The developed methods are able to handle both — (1) On-Surface routing, when the wires are required to be constrained to the surface of the product, and (2) In-Air routing, when in addition to the surface the wires are also allowed to be embedded in product’s ambiance. For the final geometric embedding of the generated harnesses, we present an optimization-based methodology that determines the optimum lengths of the segments over which the wires should be bundled together. The results presented demonstrate the efficacy of the proposed approach through multiple realistic examples.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103694"},"PeriodicalIF":4.3,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139738051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-02DOI: 10.1016/j.cad.2024.103685
Pedro López-Adeva Fernández-Layos, Luis F.S. Merchante
We present a new algorithm to compute the minimum distance and penetration depth between two convex bodies represented by their Signed Distance Function (SDF). First, we formulate the problem as an optimization problem suitable for arbitrary non-convex bodies, and then we propose the ellipsoid algorithm to solve the problem when the two bodies are convex. Finally, we benchmark the algorithm and compare the results in collision detection against the popular Gilbert–Johnson–Keerthi (GJK) and Minkowski Portal Refinement (MPR) algorithms, which represent bodies using the support function. Results show that our algorithm has similar performance to both, providing penetration depth like MPR and, with better robustness, minimum distance like GJK. Our algorithm provides accurate and fast collision detection between implicitly modeled convex rigid bodies and is able to substitute existing algorithms in previous applications whenever the support function is replaced with the SDF.
{"title":"Convex Body Collision Detection Using the Signed Distance Function","authors":"Pedro López-Adeva Fernández-Layos, Luis F.S. Merchante","doi":"10.1016/j.cad.2024.103685","DOIUrl":"10.1016/j.cad.2024.103685","url":null,"abstract":"<div><p>We present a new algorithm to compute the minimum distance and penetration depth between two convex bodies represented by their Signed Distance Function (SDF). First, we formulate the problem as an optimization problem suitable for arbitrary non-convex bodies, and then we propose the ellipsoid algorithm to solve the problem when the two bodies are convex. Finally, we benchmark the algorithm and compare the results in collision detection against the popular Gilbert–Johnson–Keerthi (GJK) and Minkowski Portal Refinement (MPR) algorithms, which represent bodies using the support function. Results show that our algorithm has similar performance to both, providing penetration depth like MPR and, with better robustness, minimum distance like GJK. Our algorithm provides accurate and fast collision detection between implicitly modeled convex rigid bodies and is able to substitute existing algorithms in previous applications whenever the support function is replaced with the SDF.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103685"},"PeriodicalIF":4.3,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448524000125/pdfft?md5=8461bf077f6c01f40cc9b071ee24014f&pid=1-s2.0-S0010448524000125-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139667516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-06DOI: 10.1016/j.cad.2024.103683
Taoran Liu , Hongfei Ye , Jianjing Zheng , Yao Zheng , Jianjun Chen
Computer-aided design (CAD) models usually contain many errors between neighboring surfaces, such as slivers, gaps, and overlaps. To clean up such models, virtual operations have been suggested to merge multiple neighboring CAD surfaces into a single composite surface. However, it remains a challenge to generate a quality mesh on thereby formed dirty composite surfaces. In this paper, we propose a novel advancing front technique (AFT) that can treat such composite surfaces by developing two new schemes to enhance the traditional AFT. Firstly, for each composite surface, we define a parametric plane by using a combined set of the tessellation on this composite surface. Simplicial complex augmentation framework reparameterization approach is suggested since it can treat tessellations containing gap and overlap after introducing a pre-processing step. Meanwhile, this approach can ensure a bijective mapping between the parametric and physical space. The front intersection check can thus be performed on the parametric plane robustly. Secondly, the indirect and direct approaches are alternatively employed to calculate ideal points in different circumstances. In the circumstance that the possible new element is completely contained in one single CAD surface, the ideal point is calculated on the intrinsic parametric plane of the surface; otherwise, the ideal point is directly calculated on the physical space. We avoid using the geometry defined on the tessellation since we prefer to getting a mesh respecting the original CAD model rather than its tessellation counterpart. Presently, the developed new schemes have been incorporated into our in-house surface mesher, and their efficiency and effectiveness have been demonstrated through a comparison with state-of-the-art commercial tools (e.g., COMSOL Multiphysics) and AFT algorithm, using CAD models of industry-level complexity.
{"title":"Advancing Front Mesh Generation on Dirty Composite Surfaces","authors":"Taoran Liu , Hongfei Ye , Jianjing Zheng , Yao Zheng , Jianjun Chen","doi":"10.1016/j.cad.2024.103683","DOIUrl":"10.1016/j.cad.2024.103683","url":null,"abstract":"<div><p><span>Computer-aided design (CAD) models usually contain many errors between neighboring surfaces, such as slivers, gaps, and overlaps. To clean up such models, virtual operations have been suggested to merge multiple neighboring CAD surfaces into a single composite surface. However, it remains a challenge to generate a quality mesh on thereby formed dirty composite surfaces. In this paper, we propose a novel advancing front technique (AFT) that can treat such composite surfaces by developing two new schemes to enhance the traditional AFT. Firstly, for each composite surface, we define a </span>parametric<span> plane by using a combined set of the tessellation on this composite surface. Simplicial complex<span><span> augmentation framework reparameterization approach is suggested since it can treat tessellations containing gap and overlap after introducing a pre-processing step. Meanwhile, this approach can ensure a </span>bijective mapping between the parametric and physical space. The front intersection check can thus be performed on the parametric plane robustly. Secondly, the indirect and direct approaches are alternatively employed to calculate ideal points in different circumstances. In the circumstance that the possible new element is completely contained in one single CAD surface, the ideal point is calculated on the intrinsic parametric plane of the surface; otherwise, the ideal point is directly calculated on the physical space. We avoid using the geometry defined on the tessellation since we prefer to getting a mesh respecting the original CAD model rather than its tessellation counterpart. Presently, the developed new schemes have been incorporated into our in-house surface mesher, and their efficiency and effectiveness have been demonstrated through a comparison with state-of-the-art commercial tools (e.g., COMSOL Multiphysics) and AFT algorithm, using CAD models of industry-level complexity.</span></span></p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"169 ","pages":"Article 103683"},"PeriodicalIF":4.3,"publicationDate":"2024-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139392856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-06DOI: 10.1016/j.cad.2023.103672
Long Chen , Lele Zhang , Yanan Wu , Gang Xu , Baotong Li
Traditional structural optimization design methods are based on the finite element analysis(FEA), which makes it difficult to construct a direct relationship between the design parameters and the design objective parameters in the structural design process. The FEA method needs to convert the models back and forth between the design model and the analysis or optimization model during the design process. It is a cumbersome and time-consuming work and also affects the analysis accuracy. We propose an integrated design method that seamlessly integrates process of design, simulation and optimization based on uniformity of design models, analysis models and optimization models by benefiting the advantages of volume parameterization and isogeometric analysis(IGA). The size parameters are input as high-level parameters, then the middle parameters are obtained through hierarchical mapping. Based on these parameters, the semantic feature framework composes of feature points, feature curves and feature surfaces and even feature volume is gradually constructed. By extracting paths and sections, the geometric feature framework is generated. The paths and sections are segmented to form the volume parametric sub-patches through volume parametric mapping. These sub-patches are merged into a whole volume parametric model that can be used for IGA and size driven deformation. Based on volume parametric model, a mathematical relationship is constructed between the design objective parameters and the size design parameters. Through the mathematical relationship, the sensitivity equations are derived for sensitivity analysis. Finally, an isogeometric size optimization process is complete. Thus, an integration of design process including geometric modeling, performance analysis, and structural optimization is achieved. Taking the maximum stiffness and the minimum stress as the size optimization objectives, the integrated design examples fall into four groups including single size optimization, multi sizes non-coupled optimization, multi sizes coupled optimization, and complex mechanical structure optimization. The optimization results prove that our method is effective, and it can be applied on complex mechanical parts. The designed results do not require reconstruction, thus achieving the integrated and optimized design of mechanical structures.
传统的结构优化设计方法以有限元分析(FEA)为基础,在结构设计过程中难以构建设计参数与设计目标参数之间的直接关系。有限元分析方法在设计过程中需要在设计模型和分析或优化模型之间来回转换模型。这是一项繁琐耗时的工作,而且还会影响分析精度。我们提出了一种集成设计方法,利用体积参数化和等几何分析(IGA)的优势,在统一设计模型、分析模型和优化模型的基础上,实现设计、模拟和优化过程的无缝集成。首先输入尺寸参数作为高层参数,然后通过分层映射获得中间参数。在这些参数的基础上,逐步构建由特征点、特征曲线和特征曲面乃至特征体积组成的语义特征框架。通过提取路径和断面,生成几何特征框架。通过体积参数映射,对路径和截面进行分割,形成体积参数子块。这些子块合并成一个整体的体参数模型,可用于 IGA 和尺寸驱动变形。基于体积参数模型,设计目标参数和尺寸设计参数之间建立了数学关系。通过该数学关系,得出了用于灵敏度分析的灵敏度方程。最后,等几何尺寸优化过程就完成了。这样,几何建模、性能分析和结构优化等设计过程就实现了一体化。以最大刚度和最小应力为尺寸优化目标,综合设计实例分为四组,包括单一尺寸优化、多尺寸非耦合优化、多尺寸耦合优化和复杂机械结构优化。优化结果证明了我们的方法是有效的,并且可以应用于复杂的机械零件。设计结果无需重构,从而实现了机械结构的集成优化设计。
{"title":"Isogeometric Size Optimization Design Based on Parameterized Volume Parametric Models","authors":"Long Chen , Lele Zhang , Yanan Wu , Gang Xu , Baotong Li","doi":"10.1016/j.cad.2023.103672","DOIUrl":"10.1016/j.cad.2023.103672","url":null,"abstract":"<div><p><span><span><span>Traditional structural optimization design methods are based on the finite element analysis(FEA), which makes it difficult to construct a direct relationship between the design parameters and the design objective parameters in the structural design process. The FEA method needs to convert the models back and forth between the design model and the analysis or optimization model during the design process. It is a cumbersome and time-consuming work and also affects the analysis accuracy. We propose an integrated design method that seamlessly integrates process of design, simulation and optimization based on uniformity of design models, analysis models and optimization models by benefiting the advantages of volume parameterization and isogeometric analysis(IGA). The size parameters are input as high-level parameters, then the middle parameters are obtained through hierarchical mapping. Based on these parameters, the semantic feature<span> framework composes of feature points, feature curves and feature surfaces and even feature volume is gradually constructed. By extracting paths and sections, the geometric feature framework is generated. The paths and sections are segmented to form the volume </span></span>parametric sub-patches through volume parametric mapping. These sub-patches are merged into a whole volume </span>parametric model that can be used for IGA and size driven deformation. Based on volume parametric model, a mathematical relationship is constructed between the design objective parameters and the size design parameters. Through the mathematical relationship, the sensitivity equations are derived for sensitivity analysis. Finally, an isogeometric size optimization process is complete. Thus, an integration of design process including </span>geometric modeling<span>, performance analysis, and structural optimization is achieved. Taking the maximum stiffness and the minimum stress as the size optimization objectives, the integrated design examples fall into four groups including single size optimization, multi sizes non-coupled optimization, multi sizes coupled optimization, and complex mechanical structure optimization. The optimization results prove that our method is effective, and it can be applied on complex mechanical parts. The designed results do not require reconstruction, thus achieving the integrated and optimized design of mechanical structures.</span></p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"169 ","pages":"Article 103672"},"PeriodicalIF":4.3,"publicationDate":"2024-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139376195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}