Computer-Aided Design最新文献_第9页

Fast Reconstruction of Microstructures with Ellipsoidal Inclusions Using Analytical Descriptors 利用解析描述子快速重建椭球夹杂微观结构

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-20 DOI: 10.1016/j.cad.2023.103635

Paul Seibert , Markus Husert , Maximilian P. Wollner , Karl A. Kalina , Markus Kästner

{"title":"Fast Reconstruction of Microstructures with Ellipsoidal Inclusions Using Analytical Descriptors","authors":"Paul Seibert , Markus Husert , Maximilian P. Wollner , Karl A. Kalina , Markus Kästner","doi":"10.1016/j.cad.2023.103635","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103635","url":null,"abstract":"<div><p>Microstructure reconstruction is an important and emerging aspect of computational materials engineering and multiscale modeling and simulation. Despite extensive research and fast progress in the field, the application of descriptor-based reconstruction remains limited by computational resources. Common methods for increasing the computational feasibility of descriptor-based microstructure reconstruction lie in approximating the microstructure by simple geometrical shapes and by utilizing differentiable descriptors to enable gradient-based optimization. The present work combines these two ideas for structures composed of non-overlapping ellipsoidal inclusions such as magnetorheological elastomers. This requires to express the descriptors as a function of the microstructure parametrization. Deriving these relations leads to analytical solutions that further speed up the reconstruction procedure. Based on these descriptors, microstructure reconstruction is formulated as a multi-stage optimization procedure. The developed algorithm is validated by means of different numerical experiments and advantages and limitations are discussed in detail.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448523001677/pdfft?md5=2f1cf9313dca3d0de81488f37ae4a7ec&pid=1-s2.0-S0010448523001677-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92101163","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}

引用次数: 1

A compact yet flexible design space for large-scale nonperiodic 3D woven composites based on a weighted game for generating candidate tow architectures 一种基于加权博弈的大型非周期三维编织复合材料候选拖曳结构的紧凑而灵活的设计空间

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-20 DOI: 10.1016/j.cad.2023.103637

Zhen-Pei Wang , Brian N. Cox , Shemuel Joash Kuehsamy , Mark Hyunpong Jhon , Olivier Sudre , N. Sridhar , Gareth J. Conduit

{"title":"A compact yet flexible design space for large-scale nonperiodic 3D woven composites based on a weighted game for generating candidate tow architectures","authors":"Zhen-Pei Wang , Brian N. Cox , Shemuel Joash Kuehsamy , Mark Hyunpong Jhon , Olivier Sudre , N. Sridhar , Gareth J. Conduit","doi":"10.1016/j.cad.2023.103637","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103637","url":null,"abstract":"<div><p>Three-dimensional non-periodic woven composite preforms have sufficient design flexibility that tows can be aligned along principal loading paths even in shaped structural components with detailed local features. While this promises competitive performance, the feasible design space is combinatorially large, far beyond exhaustive search. Seeking a design space that is compact and easily searched yet can span the full potential of 3D weaving, we propose a method for generating candidate designs called the Background Vector Method (BVM) which treats weaving tows as agents in a game competing to match background vectors derived from different design requirements. The BVM generates candidate designs that adapt local architecture to global design goals by adjusting scalar weights. A manufacturing-based parameterization assures fabricability. The scope of possible designs and the speed of the BVM are illustrated by re-creating common periodic 3D weaving patterns and novel complex non-periodic architectures, with a route demonstrated to forming cavities, ducts, and other open volumes. How the BVM might be incorporated within an optimization algorithm is outlined and pathways are shown for systematically enlarging the design space as individual design problems may require.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91999406","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}

引用次数: 0

Gradient design and fabrication methodology for interleaved self-locking kirigami panels 交错自锁基利米板的梯度设计和制造方法

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-13 DOI: 10.1016/j.cad.2023.103632

Hao Qiu , Yixiong Feng , Yicong Gao , Zhaoxi Hong , Jianrong Tan

{"title":"Gradient design and fabrication methodology for interleaved self-locking kirigami panels","authors":"Hao Qiu , Yixiong Feng , Yicong Gao , Zhaoxi Hong , Jianrong Tan","doi":"10.1016/j.cad.2023.103632","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103632","url":null,"abstract":"<div><p>Sandwich panels with excellent mechanical properties are widely used in the aerospace, architecture, and automobile industries. Kirigami-inspired structural designs are receiving increasing attention owing to the shape-induced functions and novel properties imparted by their folds and cuts. In this study, novel graded self-locking kirigami panels based on a tucked-interleaved pattern are developed and analyzed under quasi-static loading. The proposed tucked-interleaved pattern can be assembled to form freely supported self-locking polyhedral structures. The self-locking property is ensured by the interleaved flaps, which create in-plane compression to hold the structure in place. In particular, we analyze the effects of geometric variations in kirigami panels fabricated using a CO<sub>2</sub> laser machining system. The experimental data under quasi-static compression and simulation results both indicate that the proposed kirigami panels have outstanding load-to-weight ratios on the order of 10<sup>5</sup>. It appears that the introduction of a graded design can generate graded stiffness as well as superior specific energy absorption with an appropriate introduction of geometric gradients. These results show that the proposed kirigami panels combining self-locking and programmable non-uniform stiffness have great potential for non-uniform engineering applications.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448523001641/pdfft?md5=70fa5e265ba9c95a37e880f44d35416f&pid=1-s2.0-S0010448523001641-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91987318","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}

引用次数: 0

Machine learning-driven optimization design of hydrogel-based negative hydration expansion metamaterials 基于机器学习的水凝胶负水化膨胀超材料优化设计

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-11 DOI: 10.1016/j.cad.2023.103631

Yisong Qiu, Hongfei Ye, Hongwu Zhang, Yonggang Zheng

{"title":"Machine learning-driven optimization design of hydrogel-based negative hydration expansion metamaterials","authors":"Yisong Qiu, Hongfei Ye, Hongwu Zhang, Yonggang Zheng","doi":"10.1016/j.cad.2023.103631","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103631","url":null,"abstract":"<div><p>Hydrogel-based negative hydration expansion (NHE) metamaterials are composite structures composed of responsive hydrogels and polymers, and their properties depend on their unique structures. In this paper, an optimization method based on the combination of the back-propagation neural network (BPNN) and the multi-population genetic algorithm (MPGA) is developed to rapidly design isotropic and anisotropic hydrogel-based metamaterials with specific NHE effects. In this method, several dimensionless design parameters are introduced to describe the structural characteristics of the metamaterial. The initial dataset is constructed based on the finite element method simulation results, and the mapping relationship between the design parameters and the equivalent linear strain is constructed by the BPNN, and the metamaterial with specific effect is efficiently optimized by combining the MPGA. The method is proved to have high accuracy and efficiency, and is applied to design many novel 2D and 3D metamaterials. The 3D metamaterial designed by this method has an ultra-large NHE ratio about 82 %. Compared with the topology optimization method, this method can significantly reduce the amount of computation, and can effectively avoid falling into the local optimum. The results show that the optimization method based on machine learning is an efficient means to design hydrogel-based metamaterials.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S001044852300163X/pdfft?md5=f22de6c63d7148c72cfbfaf0f89db584&pid=1-s2.0-S001044852300163X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92061976","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}

引用次数: 0

Extending Point-Based Deep Learning Approaches for Better Semantic Segmentation in CAD 基于扩展点的深度学习方法在CAD中实现更好的语义分割

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-10 DOI: 10.1016/j.cad.2023.103629

Gerico Vidanes , David Toal , Xu Zhang , Andy Keane , Jon Gregory , Marco Nunez

{"title":"Extending Point-Based Deep Learning Approaches for Better Semantic Segmentation in CAD","authors":"Gerico Vidanes , David Toal , Xu Zhang , Andy Keane , Jon Gregory , Marco Nunez","doi":"10.1016/j.cad.2023.103629","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103629","url":null,"abstract":"<div><p>Geometry understanding is a core concept of computer-aided design and engineering (CAD/CAE). Deep neural networks have increasingly shown success as a method of processing complex inputs to achieve abstract tasks. This work revisits a generic and relatively simple approach to 3D deep learning – a point-based graph neural network – and develops best-practices and modifications to alleviate traditional drawbacks. It is shown that these methods should not be discounted for CAD tasks; with proper implementation, they can be competitive with more specifically designed approaches. Through an additive study, this work investigates how the boundary representation data can be fully utilised by leveraging the flexibility of point-based graph networks. The final configuration significantly improves on the predictive accuracy of a standard <em>PointNet++</em> network across multiple CAD model segmentation datasets and achieves state-of-the-art performance on the <em>MFCAD++</em> machining features dataset. The proposed modifications leave the core neural network unchanged and results also suggest that they can be applied to other point-based approaches.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49711218","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}

引用次数: 0

Multicomponent Topology Optimization Method Considering Stepwise Linear Assemblability with a Fictitious Physical Model 考虑虚拟物理模型分步线性可装配性的多部件拓扑优化方法

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-06 DOI: 10.1016/j.cad.2023.103628

R. Hirosawa , M. Noda , K. Matsushima , Y. Noguchi , T. Yamada

引用次数: 0

Simplification of 3D CAD Model in Voxel Form for Mechanical Parts Using Generative Adversarial Networks 用生成对抗性网络简化机械零件的体素形式三维CAD模型

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-01 DOI: 10.1016/j.cad.2023.103577

Hyunoh Lee , Jinwon Lee , Soonjo Kwon , Karthik Ramani , Hyung-gun Chi , Duhwan Mun

{"title":"Simplification of 3D CAD Model in Voxel Form for Mechanical Parts Using Generative Adversarial Networks","authors":"Hyunoh Lee , Jinwon Lee , Soonjo Kwon , Karthik Ramani , Hyung-gun Chi , Duhwan Mun","doi":"10.1016/j.cad.2023.103577","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103577","url":null,"abstract":"<div><p>Most three-dimensional (3D) computer-aided design (CAD) models of mechanical parts, created during the design stage, have high shape complexity. The shape complexity required of CAD models reduces according to the field of application. Therefore, it is necessary to simplify the shapes of 3D CAD models, depending on their applications. Traditional simplification methods recognize simplification target shape based on a pre-defined algorithm. Such algorithm-based methods have difficulty processing unusual partial shapes not considered in the CAD model. This paper proposes a method that uses a network based on a generative adversarial network (GAN) to simplify the 3D CAD models of mechanical parts. The proposed network recognizes and removes simplification target shapes included in the 3D CAD models of mechanical parts. A 3D CAD model dataset was constructed to train the 3D CAD model simplification network. 3D CAD models are represented in voxel form in the dataset. Next, the constructed training dataset was used to train the proposed network. Finally, a 3D voxel simplification experiment was performed to evaluate the performance of the trained network. The experiment results showed that the network had an average error rate of 3.38% for the total area of the mechanical part and an average error rate of 14.61% for the simplification target area.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49711094","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}

引用次数: 1

A Region-growing GradNormal Algorithm for Geometrically and Topologically Accurate Mesh Extraction 一种用于几何和拓扑精确网格提取的区域增长GradNormal算法

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-01 DOI: 10.1016/j.cad.2023.103559

Chen Zong , Jinhui Zhao , Pengfei Wang , Shuangmin Chen , Shiqing Xin , Yuanfeng Zhou , Changhe Tu , Wenping Wang

{"title":"A Region-growing GradNormal Algorithm for Geometrically and Topologically Accurate Mesh Extraction","authors":"Chen Zong , Jinhui Zhao , Pengfei Wang , Shuangmin Chen , Shiqing Xin , Yuanfeng Zhou , Changhe Tu , Wenping Wang","doi":"10.1016/j.cad.2023.103559","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103559","url":null,"abstract":"<div><p>With the prevalence of implicit shape processing and reconstruction, extracting a polygonal mesh of an isosurface from volume data, which plays an important role in these tasks, is receiving more and more attention. GradNormal, a recently proposed marching tetrahedra method, can effectively extract high-quality meshes from analytic functional shapes but suffers from detail loss and computational inefficiency issues. In this paper, we improve GradNormal from four aspects. First, we extend GradNormal from an analytic function to an arbitrary geometric domain equipped with the projection operation. Second, we select a seed tetrahedron and find only the tetrahedra intersecting the implicit surface, in a region-growing style, which helps save memory and accelerate calculation. Third, we invent a hierarchical tiling mechanism to enhance the recovery accuracy of the resulting mesh, unlike the uniform tiling used in GradNormal. Finally, we propose to accurately predict how the underlying surface goes through a tetrahedral element so that complicated topological structures such as thin plates and gaps can be well captured. Extensive experimental results on challenging shapes show that the improved GradNormal is able to quickly produce a feature-adapted triangle mesh that is more topologically and geometrically accurate than the state-of-the-art.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49761553","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}

引用次数: 1

A Simple Point-based Iso-Scallop Tool Path Planning Method for Noisy Point Clouds with High Robustness and Controlled Errors 一种基于简单点的高鲁棒性、误差可控的噪声点云等距扇贝刀具路径规划方法

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-01 DOI: 10.1016/j.cad.2023.103560

Guoyue Luo, Qiang Zou

{"title":"A Simple Point-based Iso-Scallop Tool Path Planning Method for Noisy Point Clouds with High Robustness and Controlled Errors","authors":"Guoyue Luo, Qiang Zou","doi":"10.1016/j.cad.2023.103560","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103560","url":null,"abstract":"<div><p>With the rapid advances in 3D scanning and vision technologies, point clouds have seen a significant increase in their application to CNC machining. As an important way to generate tool paths from point clouds, point-based direct planning methods are, however, now restricted to high-quality point clouds. Most existing methods would have robustness issues if a noisy point cloud is given due to their reliance on the noise-sensitive estimation of differential properties from point clouds. Error control under noisy point clouds is also rarely considered. This paper presents a robust and error-controlled point-based iso-scallop tool path planning method for CNC machining with ball-nosed cutters. It casts the problem of searching for scallop/CL points to another problem of finding circle-sphere intersection points and the maximum/minimum among them. Both circle-sphere intersections and <strong><em>max/min</em></strong> comparisons are easy to implement and robust. It has also been theoretically proved that the intersections and comparisons can ensure an error bound of <span><math><mrow><mn>2</mn><mi>ϵ</mi></mrow></math></span> on the final results if two conditions called <span><math><mi>ϵ</mi></math></span>-sampling and <span><math><mi>ϵ</mi></math></span>-covering are met. The effectiveness of the method has been demonstrated by a series of examples and comparisons.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49761556","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}

引用次数: 1

Towards G1-Continuous Multi-Strip Path-Planning for 5-Axis Flank CNC Machining of Free-Form Surfaces Using Conical Cutting Tools 面向G1连续多条路径规划的五轴平面数控加工自由曲面的锥形刀具

IF 4.3 3区计算机科学

Computer-Aided Design Pub Date : 2023-10-01 DOI: 10.1016/j.cad.2023.103555

Kanika Rajain , Michal Bizzarri , Miroslav Lávička , Jiří Kosinka , Michael Bartoň

{"title":"Towards G1-Continuous Multi-Strip Path-Planning for 5-Axis Flank CNC Machining of Free-Form Surfaces Using Conical Cutting Tools","authors":"Kanika Rajain , Michal Bizzarri , Miroslav Lávička , Jiří Kosinka , Michael Bartoň","doi":"10.1016/j.cad.2023.103555","DOIUrl":"https://doi.org/10.1016/j.cad.2023.103555","url":null,"abstract":"<div><p>Existing flank milling path-planning methods typically lead to tiny gaps or overlaps between neighboring paths, which causes artifacts and imperfections in the workpiece. We propose a new multi-strip path-planning method for 5-axis flank milling of free-form surfaces which targets <span><math><msup><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> (tangent-plane) continuity of the neighboring strips along shared boundaries. While for some geometries one cannot achieve <span><math><msup><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> continuity and high approximation quality at the same time, our optimization framework offers a good trade-off between machining accuracy in terms of distance error and the <span><math><msup><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> connection of neighboring strips. We demonstrate our algorithm on synthetic free-form surfaces as well as on industrial benchmark datasets, showing that we are able to meet fine industrial tolerances and simultaneously significantly reduce the kink angle of adjacent strips, and consequently to improve the surface finish in terms of smoothness.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710976","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}

引用次数: 0