Computer-Aided Design最新文献

{"title":"Interactive design of developable surfaces by patch-based learning","authors":"Chaoyun Wang ,&nbsp;Jianlei Wang ,&nbsp;Chengcheng Tang ,&nbsp;Nanning Zheng ,&nbsp;Caigui Jiang","doi":"10.1016/j.cad.2025.103970","DOIUrl":"10.1016/j.cad.2025.103970","url":null,"abstract":"<div><div>This paper introduces an interactive design method for developable surfaces, centered on a data-driven approach to optimize surface patches for developability. Surface patches are the fundamental components of an entire surface, typically represented by triangular meshes. We propose a novel learning-based method that effectively transforms patches with arbitrary boundaries into their closest developable surfaces. Based on this method, our tools enable real-time, drag-and-drop design of developable surfaces and support piecewise developable approximation through interactive inputs. Experimental results demonstrate that this method provides a fast computational foundation for the interactive design of developable surfaces, enhancing design flexibility while exhibiting excellent robustness and generalization. The piecewise developable approximation of the model, guided by human–computer collaborative segmentation, achieved higher overall approximation accuracy, fewer patches, and lifelike papercraft outcomes. This offers greater flexibility to meet the application requirements of complex real-world scenarios and provides a new paradigm for integrating deep learning with interactive geometry design.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103970"},"PeriodicalIF":3.1,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159992","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":"On design, analysis, and hybrid manufacturing of microstructured blade-like geometries","authors":"Pablo Antolin ,&nbsp;Michael Bartoň ,&nbsp;Georges-Pierre Bonneau ,&nbsp;Annalisa Buffa ,&nbsp;Amaia Calleja-Ochoa ,&nbsp;Gershon Elber ,&nbsp;Stefanie Elgeti ,&nbsp;Gaizka Gómez Escudero ,&nbsp;Alicia Gonzalez ,&nbsp;Haizea González Barrio ,&nbsp;Stefanie Hahmann ,&nbsp;Thibaut Hirschler ,&nbsp;Q Youn Hong ,&nbsp;Konstantin Key ,&nbsp;Myung-Soo Kim ,&nbsp;Michael Kofler ,&nbsp;Norberto Lopez de Lacalle ,&nbsp;Silvia de la Maza ,&nbsp;Kanika Rajain ,&nbsp;Jacques Zwar","doi":"10.1016/j.cad.2025.103967","DOIUrl":"10.1016/j.cad.2025.103967","url":null,"abstract":"<div><div>With the evolution of new manufacturing technologies such as multi-material 3D printing, one can think of new type of objects that consist of considerably less, yet heterogeneous, material, consequently being porous, lighter and cheaper, while having the very same functionality as the original object when manufactured from one single solid material. We aim at questioning five decades of traditional paradigms in geometric CAD and focus at new generation of CAD objects that are not solid, but contain heterogeneous free-form internal microstructures. We propose a unified manufacturing pipeline that involves all stages, namely design, optimization, manufacturing, and inspection of microstructured free-form geometries. We demonstrate our pipeline on an industrial test case of a blisk blade that sustains the desired pressure limits, yet requires significantly less material when compared to the solid counterpart.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103967"},"PeriodicalIF":3.1,"publicationDate":"2025-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145120121","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":"Size-controlled quadrilateral meshing using integrable odeco fields","authors":"Mattéo Couplet ,&nbsp;Alexandre Chemin ,&nbsp;Jean-François Remacle","doi":"10.1016/j.cad.2025.103974","DOIUrl":"10.1016/j.cad.2025.103974","url":null,"abstract":"<div><div>This paper proposes a novel approach for computing planar quadrilateral meshes complying with sizing prescriptions on boundary and feature curves. The method relies on computing <em>integrable</em> orthogonal frame fields, whose symmetries are implicitly represented using orthogonally decomposable (<em>odeco</em>) tensors. To formulate an integrability criterion, we express the frame field’s Lie bracket solely in terms of the tensor representation; this is made possible by studying the sensitivity of the frame with respect to perturbations in the tensor. We construct an energy formulation that computes smooth and integrable frame fields in both isotropic and anisotropic settings. The solver creates and places the singularities required to fit the sizing constraints with the correct topology. The computed frame field is integrated to a seamless parametrization that is aligned with the frame field, and we propose a mesh extraction method that relies on a greedy quantization of the parametrization.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103974"},"PeriodicalIF":3.1,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159993","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":"Robust and fast local repair for intersecting triangle meshes","authors":"Taoran Liu ,&nbsp;Hongfei Ye ,&nbsp;Xiangqiao Meng ,&nbsp;Zhiwei Liu ,&nbsp;Jianjun Chen","doi":"10.1016/j.cad.2025.103963","DOIUrl":"10.1016/j.cad.2025.103963","url":null,"abstract":"<div><div>Triangle meshes frequently exhibit defects such as self-intersections and low-quality elements. Existing intersection resolution methods either lack robustness due to floating-point inaccuracies or incur high computational costs by processing meshes globally. We propose a robust and efficient method for repairing meshes with intersecting triangles that combines localized processing with rational number computations. The core challenge we address is converting exact intersection repair results to stable floating-point representation without reintroducing intersections. Our solution embeds intersecting regions into tetrahedral meshes for constrained optimization, naturally preventing surface intersections during the conversion process. Our approach begins with a preprocessing step that refines the mesh and localizes intersection issues by separating intersecting and intersection-free regions. For each intersecting region, we ensure the robustness of intersection calculations by using rational numbers. Subsequently, the intersection repair results are stably converted from rational to floating-point representation using a constrained boundary tetrahedral mesh optimization method. The repaired local meshes are then stitched back into the intersection-free mesh, followed by a remeshing step to enhance overall mesh quality. Experimental results on complex models demonstrate that our method significantly reduces computational overhead while producing high-quality, intersection-free meshes suitable for downstream applications.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103963"},"PeriodicalIF":3.1,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160125","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":"Unfolding 3D shape convolutional networks for aerodynamic drag prediction in vehicle design","authors":"Yangchen Liu ,&nbsp;Yubin Tang ,&nbsp;Xiaomeng Tong ,&nbsp;Qinglei Cao ,&nbsp;Zichuan Fan","doi":"10.1016/j.cad.2025.103971","DOIUrl":"10.1016/j.cad.2025.103971","url":null,"abstract":"<div><div>The aerodynamic drag coefficient is crucial in vehicle design, especially during the shape design phase, where the exterior geometry directly affects the drag coefficient. Reducing the drag coefficient enhances fuel efficiency, lowers emissions, and improves vehicle dynamics and stability. Nevertheless, existing methods like Computational Fluid Dynamics (CFD) are time-consuming and computationally intensive, making them unsuitable for real-time feedback. To address this, we propose an innovative deep learning model — the Unfolded Convolutional Neural Network (UFConv). The ABTrans and Distance Mapping method within UFConv reduces complexity by unfolding the 3D structure into a lower-dimensional representation. This accelerates training while maintaining high accuracy by extracting key features and avoiding redundant information. The R<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span> values for the UFConv model are 0.941 and 0.829 on the DrivAerNet and DrivAerNet++ datasets, respectively, with a peak of 0.952 for a specific vehicle type. The training time is also significantly lower compared to other methods. The results indicate that UFConv outperforms existing methods, providing superior accuracy and faster training speed in predicting automotive drag.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103971"},"PeriodicalIF":3.1,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145120119","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 computational framework for simulating accurate deployment motion paths of rigid foldable origami tessellations","authors":"Marco Meloni,&nbsp;Qian Zhang,&nbsp;Jianguo Cai","doi":"10.1016/j.cad.2025.103975","DOIUrl":"10.1016/j.cad.2025.103975","url":null,"abstract":"<div><div>Origami tessellations have found widespread applications in fields such as robotics, space structures, and mechanical metamaterials. Among these, rigid foldable origami has garnered significant attention due to its desirable characteristics, including controlled motion, scalability, and the ability to fold without deforming panels. However, assessing folding motions and folded shapes with generalized approaches remains a critical yet challenging step in their design. To address this, we present a computational framework that leverages the Kangaroo solver to achieve accurate motion paths and folded configurations of rigid foldable origami tessellations. This framework extends beyond the capabilities of the Kangaroo plug-in alone, enabling the accurate motion path simulation of developable and non-developable patterns, bound and joined models, and sequential folding motions. It also supports a wide range of geometries, from origami and kirigami to composites and metamaterials. By providing advanced tools for simulating complex folding behaviours, the proposed method could foster the development of innovative origami-based designs across diverse applications.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103975"},"PeriodicalIF":3.1,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145120120","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":"Mesh generation of curvilinear polygons for the high-order virtual element method (VEM)","authors":"Kaloyan S. Kirilov ,&nbsp;Jingtian Zhou ,&nbsp;Joaquim Peiró ,&nbsp;Mashy Green ,&nbsp;David Moxey ,&nbsp;Lourenço Beirão da Veiga ,&nbsp;Alessandro Russo ,&nbsp;Franco Dassi","doi":"10.1016/j.cad.2025.103966","DOIUrl":"10.1016/j.cad.2025.103966","url":null,"abstract":"<div><div>We present a proof-of-concept methodology for generating curvilinear polygonal meshes suitable for high-order discretisations by the Virtual Element Method (VEM). A VEM discretisation requires the definition of a set of boundary and internal points used to define basis functions and compute integrals of polynomials. The procedure to locate these points on the boundary borrows ideas from previous work on <em>a posteriori</em> high-order mesh generation in which the geometrical inquiries to a B-rep model of the computational domain are performed via an interface to CAD libraries.</div><div>Here we describe the steps of the procedure that transforms a straight-sided polygonal mesh, generated using third-party software, into a curvilinear boundary-conforming mesh. We discuss criteria for ensuring and verifying the validity of the mesh. Using an elliptic partial differential equation with Dirichlet boundary conditions as a model problem, we show that VEM discretisations on such meshes achieve the expected rates of convergence as the mesh resolution is increased. This is followed by an illustrative application of the method to the generation of a curvilinear polygonal mesh for an aerofoil geometry.</div><div>We discuss polygonal curvilinear mesh quality and its enhancement, and use the motion of a cell vertex to appraise three elemental quality metrics, namely convexity, regularity and isotropy, and highlight some of the difficulties associated in their use for mesh quality optimisation. A derivative-free optimisation method is utilised to enhance curvilinear polygonal meshes by maximising a suitable measure of mesh quality. We propose such measure as a combination of the three quality metrics and apply it to optimise a distorted initial mesh for a ring geometry. We show that a suitable version of the convexity metric is effective in untangling invalid meshes. The VEM solution of a model elliptic equation is obtained for a ring geometry where a distorted and an optimised mesh show low errors, indicating that the VEM is robust and relatively insensitive to mesh distortion, and a reduction of the error in the optimised mesh.</div><div>Finally, we use a more complex geometry, a computational domain for an aerofoil, as a benchmark to further illustrate the ability of the convexity metric to untangle meshes, and also to assess the suitability of two quality measures as optimisation targets to improve the overall quality of curvilinear polygonal meshes.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103966"},"PeriodicalIF":3.1,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145099147","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":"Heat method extensions for distance function estimation in planar and space domains","authors":"Alexander Belyaev ,&nbsp;Pierre-Alain Fayolle","doi":"10.1016/j.cad.2025.103968","DOIUrl":"10.1016/j.cad.2025.103968","url":null,"abstract":"<div><div>Given a bounded domain, we deal with the problem of estimating the distance function from the internal points of the domain to the boundary of the domain. Two simple extensions of the heat method for distance computation are introduced and evaluated. The extensions are based on first- and second-order Taylor series extrapolations. Numerical experiments demonstrate that the extensions deliver more accurate and robust estimates of the distance function.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103968"},"PeriodicalIF":3.1,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145099142","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":"Quadrilateral mesh generation based on foliation and meromorphic quadratic differential","authors":"Xiaopeng Zheng,&nbsp;Hao Wang,&nbsp;Na Lei,&nbsp;Zhongxuan Luo","doi":"10.1016/j.cad.2025.103953","DOIUrl":"10.1016/j.cad.2025.103953","url":null,"abstract":"<div><div>Quadrilateral meshes derived from foliations and quadratic differentials possess a high structural regularity. However, for complex models, meshes directly generated by foliation and its induced holomorphic quadratic differentials face notable challenges regarding area distortion, corner preservation, and uniform cell size distribution. To overcome these limitations, we introduce a set of enhanced techniques grounded in surface foliation and meromorphic quadratic differentials. Specifically, we introduce pole-constrained foliations to compute meromorphic quadratic differentials, significantly reducing area distortion. Additionally, a modified double cover strategy is further introduced to preserve corner features by altering the model’s topology. Finally, adaptive metric graph optimization is utilized to ensure a uniform distribution of mesh elements. Experiments validate the effectiveness of the proposed approach.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103953"},"PeriodicalIF":3.1,"publicationDate":"2025-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145099143","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":"Evolution-based tool path and motion planning optimization for 5-axis CNC machining of free-form surfaces","authors":"Juan Zaragoza Chichell ,&nbsp;Michal Bizzarri ,&nbsp;Judith Echevarrieta Ibarra ,&nbsp;Aritz Pérez ,&nbsp;Michael Bartoň","doi":"10.1016/j.cad.2025.103951","DOIUrl":"10.1016/j.cad.2025.103951","url":null,"abstract":"<div><div>Manufacturing of free-form geometries using 5-axis Computer Numerically Controlled (CNC) machining brings challenges in path- and motion-planning as one typically wants to minimize the manufacturing time of the object under consideration, while keeping the machining error within fine machining tolerances that ranges in tens of microns. We propose an optimization-based pipeline that, for a given toroidal and/or cylindrical flat-end cutter, simultaneously optimizes its milling paths together with its local positioning represented by the rotation and tilt functions.</div><div>The proposed strategy is validated on a variety of benchmark surfaces, with different hyperparameters for the objective function and initial conditions, showing that our results provide high-quality approximations of free-form geometries using by-construction non-colliding motions of the given tool.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103951"},"PeriodicalIF":3.1,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145099141","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}