Computer-Aided Design最新文献

{"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}

{"title":"Persistent homology-driven optimization of effective relative density range for triply periodic minimal surfaces","authors":"Depeng Gao ,&nbsp;Yuanzhi Zhang ,&nbsp;Hongwei Lin ,&nbsp;Qiang Zou","doi":"10.1016/j.cad.2024.103835","DOIUrl":"10.1016/j.cad.2024.103835","url":null,"abstract":"<div><div>Triply periodic minimal surfaces (TPMSs) play a vital role in the design of porous structures, with applications in bone tissue engineering, chemical engineering, and the creation of lightweight models. However, fabrication of TPMSs via additive manufacturing is feasible only within a specific range of relative densities, termed the effective relative density range (EDR), outside of which TPMSs exhibit unmanufacturable features. In this study, the persistent homology is applied to theoretically calculate and extend the EDRs of TPMSs. To expand the design domain of TPMSs while maintaining their symmetry, TPMSs are transformed into a new representation based on B-spline functions and a series of operators, which is referred to as Generalized-TPMSs. Through topological analysis, the Generalized-TPMSs are further optimized to expand their EDRs while maintaining a high degree of similarity to the original TPMSs. The optimized Generalized-TPMSs are referred to as <em>EDR-Variant TPMS (EDR-VTPMS)</em>. Experimental validation confirms the effectiveness of the approach in extending the EDRs of TPMSs. Moreover, EDR-VTPMS exhibits enhanced performance in heterogeneous and high-stiffness model design compared to their conventional counterparts. The EDR-VTPMSs with increased EDRs hold promise for replacing traditional TPMSs in applications that require porous structures with varying densities.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103835"},"PeriodicalIF":3.0,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177623","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":"Point-normal convexity preserving curve interpolation","authors":"Nikolaos C. Gabrielides ,&nbsp;Nickolas S. Sapidis","doi":"10.1016/j.cad.2024.103836","DOIUrl":"10.1016/j.cad.2024.103836","url":null,"abstract":"<div><div>This paper studies the notion of convexity preservation in the context of point-normal interpolation in 2D. It is proved that <span><math><msup><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-continuous piecewise <em>generalized cubic curves in tension</em> are always capable of preserving the convexity implied by the data with finite tension parameters. Focus is placed on the variable degree polynomials and it is proved that there always exist a <span><math><msup><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-continuous cubic spline that interpolates the data and is also convexity preserving.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103836"},"PeriodicalIF":3.0,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177624","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":"Geometric Modeling for Microstructure Design and Manufacturing: A Review of Representations and Modeling Algorithms","authors":"Qiang Zou,&nbsp;Guoyue Luo","doi":"10.1016/j.cad.2024.103834","DOIUrl":"10.1016/j.cad.2024.103834","url":null,"abstract":"<div><div>Microstructures, characterized by intricate structures at the microscopic scale, hold the promise of important disruptions in the field of mechanical engineering due to the superior mechanical properties they offer. One fundamental technique of microstructure design and manufacturing is geometric modeling, which generates the 3D computer models required to run high-level procedures such as simulation, optimization, and process planning. There is, however, a lack of comprehensive discussions on this body of knowledge. The goal of this paper is to compile existing microstructure modeling methods and clarify the challenges, progress, and limitations of current research. It also concludes with future research directions that may improve and/or complement current methods, such as compressive and generative microstructure representations. By doing so, the paper sheds light on what has already been made possible for microstructure modeling, what developments can be expected in the near future, and which topics remain problematic.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103834"},"PeriodicalIF":3.0,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177625","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 3D structural design in virtual reality using preference-based topology optimization","authors":"Zhi Li,&nbsp;Ting-Uei Lee,&nbsp;Yi Min Xie","doi":"10.1016/j.cad.2024.103826","DOIUrl":"10.1016/j.cad.2024.103826","url":null,"abstract":"<div><div>Innovative load-bearing structures often emerge from a fine balance between creative forms and engineering principles. While preference-based topology optimization methods have advanced structural design by considering designers’ geometric preferences, they struggle with visualizing and editing complex 3D details crucial for diverse design options. To overcome this bottleneck, here we propose the improved bidirectional evolutionary structural optimization considering subjective preferences (ISP-BESO) method. This method introduces a similarity constraint that enables precise control over subjective preferences in optimized structures. Then, a design exploration strategy is proposed by integrating virtual reality (VR) with topology optimization for the interactive creation of desirable 3D structures. The strategy employs VR sculpting to offer immersive visualization and real-time feedback, guiding material redistribution during optimization. This workflow can iteratively produce innovative and efficient structures. Adjusting target similarity in ISP-BESO steers designs toward performance-driven or preference-driven outcomes. A museum design example demonstrates the practical potential of this strategy.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103826"},"PeriodicalIF":3.0,"publicationDate":"2024-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177712","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":"Plate Manufacturing Constraint in Topology Optimization Using Anisotropic Filter","authors":"Yuji Wada ,&nbsp;Tokimasa Shimada ,&nbsp;Koji Nishiguchi ,&nbsp;Shigenobu Okazawa ,&nbsp;Makoto Tsubokura","doi":"10.1016/j.cad.2024.103823","DOIUrl":"10.1016/j.cad.2024.103823","url":null,"abstract":"<div><div>The manufacturing constraint of topology optimization for finding structures composed primarily of plate cross sections with an automatically decided surface normal is discussed. The anisotropic partial differential equation filter for the sensitivity of the objective function is designed such that the eigenvalue-resolved stress tensor is converted to the anisotropic filter tensor. The user can obtain an optimal shape proposal with different degrees of plate formation by changing the influence radius of the ellipsoidal filter. Plate structure formation and stiffness compliance performance are discussed through three sample problems: a solid bar subjected to torsional loads, an L-shaped member subjected to multiple loads, and a vehicle body frame intended to be a complex frame. The finite element analysis with 3–300 million degrees of freedom is required to form a shell plate structure from a large ingot with a volume fraction constraint of 1%–5%. A voxel topology optimization software that utilizes the building cube method framework available in massively parallel environments is developed, and the parallel performance of the optimization routine, including the plate filtering, is measured.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103823"},"PeriodicalIF":3.0,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722617","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":"Fast algorithm for extracting domains and regions from three-dimensional triangular surface meshes","authors":"Sebastian Bohm,&nbsp;Erich Runge","doi":"10.1016/j.cad.2024.103824","DOIUrl":"10.1016/j.cad.2024.103824","url":null,"abstract":"<div><div>Correct mesh handling and in particular domain extraction is an important step of many simulation workflows. In the boundary element method, for example, only the surfaces of arbitrarily shaped domains have to be meshed. Here, an algorithm is presented that extracts all distinct spatial regions and domains from a given non-manifold three-dimensional surface triangulation without the need for a volume mesh. Only the coordinates of the mesh vertices and the connectivity matrix of the triangulation need to be given. The process is robust, easy to implement, and efficient. No geometric features such as edges or faces need to be detected or specified for the method to work. Thus, the method is suitable for mesh formats that do not contain information about the geometry partitioning. The algorithm is presented in detail, test cases are discussed, and an exemplary implementation is given.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103824"},"PeriodicalIF":3.0,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722618","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}