Computer-Aided Design最新文献

{"title":"Closing gaps in the digital thread with the Quality Information Framework (QIF) standard for a seamless geometry assurance process","authors":"Martin Roth ,&nbsp;Abolfazl Rezaei Aderiani ,&nbsp;Edward Morse ,&nbsp;Kristina Wärmefjord ,&nbsp;Rikard Söderberg","doi":"10.1016/j.cad.2025.103860","DOIUrl":"10.1016/j.cad.2025.103860","url":null,"abstract":"<div><div>An essential premise for a reliable variation simulation is that information on the geometrical part variations and their accumulation and propagation within an assembly is available, accessible, interchangeable, and usable in all geometry-related downstream activities. For this reason, this article studies the potential of the QIF (Quality Information Framework) standard. It illustrates how it can be used in the sense of Model-Based Definition to close gaps in the digital geometry assurance process. Besides benefits in the automation of variation simulation, it demonstrates that the semantic, feature-based linkage between product specification and inspection information in QIF 3.0 facilitates the augmentation of variation simulation with more detailed feature information for pre-production applications and feeding the digital twin to assure and optimize product quality in the production phase.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103860"},"PeriodicalIF":3.0,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143463544","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}

{"title":"Performance evaluation of 3DCAD systems based on unified automatic test, cloud model and variable weight AHP","authors":"Jin Cheng ,&nbsp;Hao Lv ,&nbsp;Huqiang Ye ,&nbsp;Zhenyu Liu ,&nbsp;Jinsong Feng ,&nbsp;Jianrong Tan","doi":"10.1016/j.cad.2025.103862","DOIUrl":"10.1016/j.cad.2025.103862","url":null,"abstract":"<div><div>Performance, typically measured in terms of accuracy, efficiency and resource occupation of various modeling operations, is a key factor for assessing the quality of 3DCAD systems, hence it is necessary to scientifically and impartially evaluate the performance of different 3DCAD systems for CAD companies to understand the gap between their systems and leading ones. In view of these considerations, a performance evaluation framework is proposed for 3DCAD systems based on unified automatic test, cloud model and variable weight analytic hierarchy process (AHP). First, an automatic test tool and a series of test cases are developed for the unified automatic performance test of various 3DCAD systems so that the test data can be efficiently achieved. In the acquisition of the performance test data, the fluctuation of hardware performance and the random resource allocation of operating systems will cause the uncertainty of 3DCAD systems itself and the instability of the test environment. To accurately modeling these uncertainties, a novel self-subtracted backward cloud generator (SSBCG) is proposed, based on which the performance indexes of 3DCAD systems can be characterized as cloud models and the uncertainty of system performance is distinguished from the external instability of the test environment by the entropy and hyper entropy of cloud models. Additionally, a variable weight AHP considering both the credibility and relative importance of the performance indexes is put forward to calculate the overall performance score of 3DCAD systems. Finally, the feasibility, effectiveness and engineering practicability of the proposed performance evaluation framework for 3DCAD systems is verified through a case study.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103862"},"PeriodicalIF":3.0,"publicationDate":"2025-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143453254","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}

{"title":"An efficient parallel mesh generation method for finite element based analysis of large complex architecture","authors":"Jiaming Li ,&nbsp;Wanqing Zhao ,&nbsp;Chunnan Li ,&nbsp;Xin Zhang ,&nbsp;Tongkun Deng ,&nbsp;Jun Wang ,&nbsp;Jinye Peng","doi":"10.1016/j.cad.2025.103851","DOIUrl":"10.1016/j.cad.2025.103851","url":null,"abstract":"<div><div>The Finite Element Method (FEM) is renowned for its exceptional computational accuracy and adaptability to diverse, complex geometric configurations, making it a powerful tool for assessing the structural stability of historical edifices. By leveraging structural mechanics analysis through FEM, a more proactive approach to the conservation of ancient structures can be pursued. Nonetheless, the analysis of many extant ancient architectures, characterized by their considerable scale and structural complexity, demands a vast quantity of finite element meshes to enable high-precision calculations—demands that traditional serial processing methods fail to meet. This paper introduces a parallel large-scale mesh generation algorithm designed for cluster computing environments, which facilitates the mesh generation for large-scale complex structures. The proposed algorithm enhances the continuity and integrity of mesh information across subdomains by projecting volume elements located on the interfaces of adjacent subdomains onto each other based on global barycentric IDs. This projection ensures that finite element analysis can proceed independently within each subdomain. Experimental results demonstrate that our approach not only generates a substantial number of meshes more efficiently but also ensures that the finite element analysis results for each subdomain closely approximate those of a global finite element analysis, as well as reducing the communication time among subdomains and improving the efficiency of the subsequent finite element solution. This advancement significantly boosts the time-efficiency of high-performance preventive monitoring and protection for largecomplex heritage architectures, thereby coenhancing the efficacy of preservation efforts.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103851"},"PeriodicalIF":3.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143445383","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}

{"title":"Reinforcement learning based automatic block decomposition of solid models for hexahedral meshing","authors":"Shuming Zhang ,&nbsp;Zhidong Guan ,&nbsp;Xiaodong Wang ,&nbsp;Pingan Tan ,&nbsp;Hao Jiang","doi":"10.1016/j.cad.2025.103850","DOIUrl":"10.1016/j.cad.2025.103850","url":null,"abstract":"<div><div>Generating high-quality meshes for CAD models is a crucial preprocessing task for numerical simulation. Although mesh generation techniques are well-established, automatic hexahedral meshing remains challenging, particularly for complex geometries. Conventional methods often require manual intervention to decompose solid models into simpler, meshable blocks, which is labor-intensive and demands expert knowledge. To address the challenge of automating the block decomposition of solid models for hexahedral meshing, we propose a novel reinforcement learning (RL) framework. This framework enables an agent to learn optimal decomposition strategies by interacting with a CAD modeling environment. Key contributions include a network-friendly method for representing and learning the environment’s state and the agent’s actions—3D geometric shapes and the corresponding block decomposition operations; a two-step training strategy that integrates imitation learning with reinforcement learning to improve training efficiency. Experimental results demonstrate that our RL-based method achieves a more effective automatic block decomposition of complex 3D solid models for generating high-quality hexahedral meshes.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103850"},"PeriodicalIF":3.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427933","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}

{"title":"Interactive design of flank-millable freeform B-spline surfaces","authors":"Pengbo Bo ,&nbsp;Zeyang Li ,&nbsp;Caiming Zhang","doi":"10.1016/j.cad.2025.103847","DOIUrl":"10.1016/j.cad.2025.103847","url":null,"abstract":"<div><div>We present a method for the interactive design of B-spline surfaces that accommodate cutting tool paths for high-precision flank milling, referred to as flank-millable surfaces. This approach explores the integration of surface design with manufacturing, aligning it with the principle of Design for Manufacturability (DFM). To enhance modeling flexibility, the design surface, cutting tool shape, and tool motion paths are all treated as variables within an optimization framework. The design surface is composed of a sequence of machined strips, with smooth transitions between adjacent strips to ensure high surface quality. To improve computational efficiency and support an interactive design process, we reformulate the constraints as quadratic equations and employ the guided projection method for optimization. Experimental results demonstrate the method’s effectiveness in designing complex freeform surfaces, making it a valuable tool for a wide range of applications.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103847"},"PeriodicalIF":3.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403261","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}

{"title":"A history-based parametric CAD sketch dataset with advanced engineering commands","authors":"Rubin Fan ,&nbsp;Fazhi He ,&nbsp;Yuxin Liu ,&nbsp;Jing Lin","doi":"10.1016/j.cad.2025.103848","DOIUrl":"10.1016/j.cad.2025.103848","url":null,"abstract":"<div><div>Modern computer-aided design (CAD) adopts history-based parametric modeling paradigm, in which the sketches play a crucial role to represent the design history, design intent, and design semantics of human engineers. Recent academic works include simple features, which are not suitable for the real-world engineering tasks. How to understand, generate and reconstruct CAD sketches with advanced engineering commands (primitives, operations and constraints) are still open challenges. To address these challenges, this paper is the first work to propose a history-based parametric CAD sketch dataset to support advanced engineering commands, named as HPSketch. Firstly, unlike existing simple datasets which are mainly composed of simple sketch primitives (typical line, arc, circle), HPSketch devises advanced primitives (such as parabola, hyperbola), operations (such as chamfer, fillet, rotation), and fruitful constraints. Secondly, HPSketch creatively propose a primitive selection command for advanced sketch operations, which can fully express the design intent and design knowledge for engineering design. This selection method is only available in our HPSketch dataset. Furthermore, unlike the simple fixed interactive constraints in previous sketch datasets, HPSketch presents a complicated, flexible constraint mechanism, which supports complicated engineering constraints. At present, HPSketch consists of 151,984 parametric sketches and 377,623 loops with 29 command types. The experiments show that the generated 2D sketches and 3D CAD models based on HPSketch are more complicated and more diverse than those based on existing sketch datasets. What is more encouraging is that sketches generated by HPSketch can be edited and re-designed by human engineers on mainstream industrial CAD softwares.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103848"},"PeriodicalIF":3.0,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143158297","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}

{"title":"Blending weight BSP Tree for mesh Boolean operations","authors":"Hangcheng Zhang ,&nbsp;Tianqi Song ,&nbsp;Ganxuan Zhang ,&nbsp;Kai Dai ,&nbsp;Le Wang ,&nbsp;Yi Liu ,&nbsp;Yi-Jun Yang ,&nbsp;Wei Zeng","doi":"10.1016/j.cad.2025.103849","DOIUrl":"10.1016/j.cad.2025.103849","url":null,"abstract":"<div><div>Boolean operations play an important role in geometry processing and CAD/ CAM. To accelerate it, spatial searching trees such as Binary Space Partitioning (BSP) Trees and KD-trees are utilized. In this paper, an approach is presented to construct the BSP Trees for the Boolean operation, where each model is efficiently located in a separate subspace. Unlike conventional methods to calculate the splitting plane, our method utilizes a size-distribution blending weighted squared distance in the BSP Tree construction, where the intrinsic weight is determined based on the size and distribution of the three-dimensional (3D) model and largely reflects the model shape. After determining the intrinsic size-distribution blending weighted squared distance, the effective splitting plane is calculated using the Weighted Squared Distance Minimization (WSDM) method. By utilizing the size-distribution blending weighted squared distance, the generated BSP Tree can divide the two models efficiently, even when dealing with 3D models that exhibit substantial geometric variations. In our experiments, the BSP Tree generated by our method reaches higher Intersecting Triangle Report Accuracy (ITRA) and Non-intersecting Triangles Removal Rate (NTRR), which means more efficient hierarchies than other techniques on two mesh models. The results of intersection tests time consumption and the Boolean operations demonstrate the effectiveness and efficiency of the BSP Tree generated by our method.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"182 ","pages":"Article 103849"},"PeriodicalIF":3.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143158298","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}

{"title":"Computational Topology, Boolean Algebras, and Solid Modeling","authors":"Alberto Paoluzzi ,&nbsp;Giorgio Scorzelli","doi":"10.1016/j.cad.2025.103839","DOIUrl":"10.1016/j.cad.2025.103839","url":null,"abstract":"<div><div>The paper aims to unfold and clarify both the theoretical approach and the practical implementation of an original and unusual solution to geometric modeling of any expression of the Boolean algebras generated by computer representations of solid models (Paoluzzi et al., 2020; Paoluzzi et al., 2023). Starting from the integration of generative, decompositive, enumerative, CSG, and Boundary primitive representation schemes, the paper describes both the underlying topological theory and how to make practical and effective use of a complete set algebra isomorphic to the Constructive Solid Geometry (CSG) enlarged with <span><math><mi>n</mi></math></span>-ary operations and explicit consideration of external space, including possible holes inside and between the elements of any assembly of solid models. All examples in this paper are supported by the straightforward Domain Specific Language (DSL) Plasm.jl <span><span>[1]</span></span>, <span><span>[2]</span></span> (Paoluzzi et al., 1995; Paoluzzi, 2003) , an extension to the geometry of FL (Function Level), by Backus and his group at IBM Almaden <span><span>[3]</span></span>, <span><span>[4]</span></span> (Williams and Wimmers, 1988; Backus et al., 1990) , and recently ported to the Julia language <span><span>[5]</span></span> (Bezanson et al., 2017) . The cover, text, and appendices present a concise and functional implementation of <figure><img></figure> , demonstrating simple examples and generating images of geometric objects corresponding to each section of the paper. The software, with a liberal license MIT, is available at <span><span>https://github.com/PlasmLanguage/Plasm.jl</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"181 ","pages":"Article 103839"},"PeriodicalIF":3.0,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143169468","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}

{"title":"Non-geodesic filament winding: Derivation process and resolution of a pair of ordinary differential equations in arc length based on vector projection","authors":"Erik Vargas-Rojas ,&nbsp;Francis Collombet","doi":"10.1016/j.cad.2024.103837","DOIUrl":"10.1016/j.cad.2024.103837","url":null,"abstract":"<div><div>Non-geodesic filament winding allows the manufacturing of various surfaces of revolution, including those once considered unsuitable for this process, such as Gaussian depressions (i.e., concavities), through numerical solutions of standard path equations without the need for ingenious workarounds. In this context, one of these mathematical models is thoroughly examined. It consists of an ordinary differential equation in arc length that has been exclusively applied to cylindrical geometries. The initial derivation technique is repeated with the aim of reformulating it in a more general manner, using intrinsic differential geometry concepts. As a result, a second equation, similar to the desired one but slightly more complex, is obtained. To verify its validity through comparison with the first equation, each is restated as a system of two differential equations that define the position of the path points of the fiber reinforcement, with the aid of cylindrical coordinates. Three geometries are chosen to validate the numerical solutions: a right circular cylinder, an exponential function that produces an axisymmetric Gaussian depression, and a third-degree polynomial that outlines a divergent nozzle. The solutions show that both systems of equations yield stable, predictable, and conventional results for all geometries, systems, and solving strategies. When the resolution is “forward” (i.e., the independent variable is the winding angle <span><math><mi>α</mi></math></span>: <span><math><mrow><mi>d</mi><mi>x</mi><mo>/</mo><mi>d</mi><mi>α</mi><mo>=</mo><msup><mrow><mi>α</mi><msup><mrow></mrow><mrow><mo>′</mo></mrow></msup></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup></mrow></math></span>), the process is more elaborate. In contrast, it is straightforward when the resolution is “inverse” (<span><math><msup><mrow><mi>α</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span>). Regarding the nozzle, comparison with an equation derived by another method, based on the geodesic and normal curvatures of the surface, reveals that the derived equation offers a broader solution range along the <span><math><mi>α</mi></math></span>-axis and can handle higher friction coefficient values than those reported in the literature. Consequently, the newly derived equation demonstrates greater comprehensiveness and applicability. It is concluded that the derivation procedure is well-defined and that both equations are effective for advancing filament winding methods.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"181 ","pages":"Article 103837"},"PeriodicalIF":3.0,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143169467","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}

{"title":"Point2skh: End-to-end Parametric Primitive Inference from Point Clouds with Improved Denoising Transformer","authors":"Cheng Wang ,&nbsp;Wenyu Sun ,&nbsp;Xinzhu Ma ,&nbsp;Fei Deng","doi":"10.1016/j.cad.2024.103838","DOIUrl":"10.1016/j.cad.2024.103838","url":null,"abstract":"<div><div>Recovering the CAD command sequence from the point cloud is an essential component in CAD reverse engineering. In this paper, we strive to solve this problem from both the perspectives of artificial intelligence and the procedures of procedural CAD models. We propose a CAD reconstruction method based on an end-to-end point-to-sketch network (Point2Skh) that can produce the CAD modeling sequence from the input geometrical point cloud by recovering the inverse sketch-and-extrude process. The point cloud is first segmented into point sets corresponding to the same extrusion. The modeling sequence can then be recovered by combining the network prediction of each point set. The proposed Point2Skh can detect and infer command vectors of sketch curves (line, arc, and circle) and the extrusion operation from the input point cloud of a single extrusion. By directly representing the sketch with its curves and inferring the command parameters, accurate sketch reconstruction is produced, which further leads to precise CAD reconstruction with sharp edges. The produced CAD modeling sequence is human-interpretable and can be readily edited by importing it into CAD tools. Experiments show that the Chamfer Distance (CD) between the predicted results and the ground truth is 0.312, and the primitive type and parameter accuracy are 93.87% and 83.24%, respectively.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"181 ","pages":"Article 103838"},"PeriodicalIF":3.0,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143169465","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}