Pub Date : 2026-02-01Epub Date: 2025-10-16DOI: 10.1016/j.cad.2025.103972
Lu He, Na Lei, Ziliang Wang, Chen Wang, Xiaopeng Zheng, Zhongxuan Luo
Polycube-maps play a critical role in computer graphics, especially for generating high-quality hexahedral meshes. Existing polycube validity conditions, primarily based on Steinitz and Eppstein’s approach, are limited to 3-connected graphs. Extending polycube-maps to handle higher connectivity graphs is crucial for practical applications. In this work, we introduce Validity-Augmented Topological Conditions (VAT conditions) based on the Gauss–Bonnet theorem. These conditions offer both global and local topological criteria, enabling the solvability of k-connected graphs, non-manifold structures, and meshes with voids. Our VAT conditions allow models that do not meet traditional polycube validity criteria but are still valid polycube polyhedra in practice. Additionally, we propose an Immune Genetic Algorithm (ImGA) tailored to our VAT conditions to enhance the robustness of polycube-map generation. We evaluate our method using the Thingi10k and ABC datasets. Results demonstrate that our VAT conditions expands the solvable space of polycubes and achieves higher quality all-hexahedral meshing for higher-connectivity or more complex models. Furthermore, we discuss the limitations associated with our proposed method.
{"title":"High-connectivity polycube-maps: Solvable space expansion through validity-augmented topological conditions","authors":"Lu He, Na Lei, Ziliang Wang, Chen Wang, Xiaopeng Zheng, Zhongxuan Luo","doi":"10.1016/j.cad.2025.103972","DOIUrl":"10.1016/j.cad.2025.103972","url":null,"abstract":"<div><div>Polycube-maps play a critical role in computer graphics, especially for generating high-quality hexahedral meshes. Existing polycube validity conditions, primarily based on Steinitz and Eppstein’s approach, are limited to 3-connected graphs. Extending polycube-maps to handle higher connectivity graphs is crucial for practical applications. In this work, we introduce <em>Validity-Augmented Topological Conditions</em> (VAT conditions) based on the Gauss–Bonnet theorem. These conditions offer both global and local topological criteria, enabling the solvability of k-connected graphs, non-manifold structures, and meshes with voids. Our VAT conditions allow models that do not meet traditional polycube validity criteria but are still valid polycube polyhedra in practice. Additionally, we propose an Immune Genetic Algorithm (ImGA) tailored to our VAT conditions to enhance the robustness of polycube-map generation. We evaluate our method using the Thingi10k and ABC datasets. Results demonstrate that our VAT conditions expands the solvable space of polycubes and achieves higher quality all-hexahedral meshing for higher-connectivity or more complex models. Furthermore, we discuss the limitations associated with our proposed method.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"191 ","pages":"Article 103972"},"PeriodicalIF":3.1,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145364941","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 : 2026-01-01Epub Date: 2025-09-29DOI: 10.1016/j.cad.2025.103973
Jinsong Zhang , Xiongzheng Li , Hailong Jia , Jin Li , Zhuo Su , Guidong Wang , Kun Li
Avatar reconstruction from monocular videos plays a pivotal role in various virtual and augmented reality applications. Recent methods have utilized 3D Gaussian Splatting (GS) to model human avatars, achieving fast rendering speeds with high visual quality. However, due to the independent nature of GS primitives, existing approaches often struggle to capture high-fidelity details and lack the ability to edit the reconstructed avatars effectively. To address these limitations, we propose Local Gaussian Splatting Avatar (LoGAvatar), a novel framework designed to enhance both geometry and texture modeling of human avatars. Specifically, we introduce a hierarchical Gaussian splatting framework, where local GS primitives are predicted based on sampled points from a human template model, such as SMPL. For texture modeling, we design a convolution-based texture atlas that preserves spatial continuity and enriches fine details. By aggregating local information for both geometry and texture, our approach reconstructs high-fidelity avatars while maintaining real-time rendering efficiency. Experimental results on two public datasets demonstrate the superior performance of our method in terms of avatar fidelity and rendering quality. Moreover, based on our LoGAvatar, we can edit the shape and texture of the reconstructed avatar, which inspires more customized avatar applications. The code is available at http://cic.tju.edu.cn/faculty/likun/projects/LoGAvatar.
{"title":"LoGAvatar: Local Gaussian Splatting for human avatar modeling from monocular video","authors":"Jinsong Zhang , Xiongzheng Li , Hailong Jia , Jin Li , Zhuo Su , Guidong Wang , Kun Li","doi":"10.1016/j.cad.2025.103973","DOIUrl":"10.1016/j.cad.2025.103973","url":null,"abstract":"<div><div>Avatar reconstruction from monocular videos plays a pivotal role in various virtual and augmented reality applications. Recent methods have utilized 3D Gaussian Splatting (GS) to model human avatars, achieving fast rendering speeds with high visual quality. However, due to the independent nature of GS primitives, existing approaches often struggle to capture high-fidelity details and lack the ability to edit the reconstructed avatars effectively. To address these limitations, we propose Local Gaussian Splatting Avatar (LoGAvatar), a novel framework designed to enhance both geometry and texture modeling of human avatars. Specifically, we introduce a hierarchical Gaussian splatting framework, where local GS primitives are predicted based on sampled points from a human template model, such as SMPL. For texture modeling, we design a convolution-based texture atlas that preserves spatial continuity and enriches fine details. By aggregating local information for both geometry and texture, our approach reconstructs high-fidelity avatars while maintaining real-time rendering efficiency. Experimental results on two public datasets demonstrate the superior performance of our method in terms of avatar fidelity and rendering quality. Moreover, based on our LoGAvatar, we can edit the shape and texture of the reconstructed avatar, which inspires more customized avatar applications. The code is available at <span><span>http://cic.tju.edu.cn/faculty/likun/projects/LoGAvatar</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103973"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269414","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}
Implicit Neural Representations (INRs), characterized by neural network-encoded signed distance fields, provide a powerful means to represent complex geometries continuously and efficiently. While successful in computer vision and generative modeling, integrating INRs into computational analysis workflows, such as finite element simulations, remains underdeveloped, primarily due to the necessity of explicit geometry representations (meshes). Conventional mesh-based finite element methods (FEM) introduce computational overhead, discretization errors, and manual effort, particularly for intricate or dynamically evolving geometries. Although immersed boundary methods partially address these issues, they are susceptible to numerical artifacts from explicit boundary treatments. In this work, we propose an innovative computational framework that seamlessly combines INRs with the Shifted Boundary Method (SBM) for performing high-fidelity linear elasticity simulations without explicit geometry transformations. By directly querying the neural implicit geometry, we obtain the surrogate boundaries and distance vectors essential for SBM, effectively eliminating the intermediate meshing step. We demonstrate the efficacy and robustness of our approach through elasticity simulations on complex geometries sourced from diverse representations, including triangle soup and point cloud reconstructions (Stanford Bunny, Eiffel Tower, gyroids). Our method showcases significant computational advantages and accuracy, underscoring its potential in biomedical, geophysical, and advanced manufacturing applications, thus offering a versatile tool for geometric and physical modeling aligned with contemporary design and analysis workflows.
{"title":"Mechanics simulation with Implicit Neural Representations of complex geometries","authors":"Samundra Karki, Ming-Chen Hsu, Adarsh Krishnamurthy, Baskar Ganapathysubramanian","doi":"10.1016/j.cad.2025.103978","DOIUrl":"10.1016/j.cad.2025.103978","url":null,"abstract":"<div><div>Implicit Neural Representations (INRs), characterized by neural network-encoded signed distance fields, provide a powerful means to represent complex geometries continuously and efficiently. While successful in computer vision and generative modeling, integrating INRs into computational analysis workflows, such as finite element simulations, remains underdeveloped, primarily due to the necessity of explicit geometry representations (meshes). Conventional mesh-based finite element methods (FEM) introduce computational overhead, discretization errors, and manual effort, particularly for intricate or dynamically evolving geometries. Although immersed boundary methods partially address these issues, they are susceptible to numerical artifacts from explicit boundary treatments. In this work, we propose an innovative computational framework that seamlessly combines INRs with the Shifted Boundary Method (SBM) for performing high-fidelity linear elasticity simulations without explicit geometry transformations. By directly querying the neural implicit geometry, we obtain the surrogate boundaries and distance vectors essential for SBM, effectively eliminating the intermediate meshing step. We demonstrate the efficacy and robustness of our approach through elasticity simulations on complex geometries sourced from diverse representations, including triangle soup and point cloud reconstructions (Stanford Bunny, Eiffel Tower, gyroids). Our method showcases significant computational advantages and accuracy, underscoring its potential in biomedical, geophysical, and advanced manufacturing applications, thus offering a versatile tool for geometric and physical modeling aligned with contemporary design and analysis workflows.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103978"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145321805","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}
Gaps are prevalent defects in triangular meshes, often arising from various sources such as surface scanning and CAD model generation. Despite their significance, the automatic repair of complex gaps has received limited attention compared to other mesh imperfections. This study presents a novel surface-based gap-closing method for triangular mesh repair, leveraging both local geometric and topological characteristics to robustly match and merge gap boundaries. The proposed approach first employs a global–local vertex merging procedure with adaptive tolerances to eliminate duplicate vertices and simplify complex gaps. Subsequently, gaps are identified and classified into connected and disconnected types based on their topological and geometric features. For each detected gap, a non-iterative closing procedure is applied, simultaneously matching and merging all boundary vertices. An adaptive scheme is introduced to determine the geometric tolerance for vertex matching, ensuring the effective preservation of the original geometric shape. Extensive numerical experiments on a large dataset of discrete models demonstrate the effectiveness and robustness of the proposed method in closing both connected and disconnected gaps.
{"title":"Adaptive gap closing for complex triangular mesh repair using geometric and topological characteristics","authors":"Shuwei Shen , Shuai Zhou , Zhoufang Xiao , Jingchen Gao , Chenhao Xu","doi":"10.1016/j.cad.2025.103981","DOIUrl":"10.1016/j.cad.2025.103981","url":null,"abstract":"<div><div>Gaps are prevalent defects in triangular meshes, often arising from various sources such as surface scanning and CAD model generation. Despite their significance, the automatic repair of complex gaps has received limited attention compared to other mesh imperfections. This study presents a novel surface-based gap-closing method for triangular mesh repair, leveraging both local geometric and topological characteristics to robustly match and merge gap boundaries. The proposed approach first employs a global–local vertex merging procedure with adaptive tolerances to eliminate duplicate vertices and simplify complex gaps. Subsequently, gaps are identified and classified into connected and disconnected types based on their topological and geometric features. For each detected gap, a non-iterative closing procedure is applied, simultaneously matching and merging all boundary vertices. An adaptive scheme is introduced to determine the geometric tolerance for vertex matching, ensuring the effective preservation of the original geometric shape. Extensive numerical experiments on a large dataset of discrete models demonstrate the effectiveness and robustness of the proposed method in closing both connected and disconnected gaps.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103981"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222450","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 : 2026-01-01Epub Date: 2025-10-03DOI: 10.1016/j.cad.2025.103991
Rizwan Abbas , Hua Gao , Xi Li
Text-to-motion generation has made significant progress in recent years. However, existing approaches struggle to generate high-quality 3D human motions that effectively capture pose estimation. These limitations are due to weak pose estimation and limited skeletal modeling. To address these limitations, we propose DT3DPE (Dual-Transformer for 3D Pose Estimation), a framework that integrates pose estimation to generate text-aligned, realistic 3D human motions. The proposed approach introduces residual vector quantization with additional layers for encoding pose tokens, enabling the capture of fine-grained details in body dynamics. Furthermore, DT3DPE employs a dual-transformer architecture, consisting of a masked transformer for motion token prediction and a residual transformer for refining motion details. This dual-transformer architecture allows the model to generate high-fidelity 3D human poses with precise body joint positioning and smooth temporal transitions. The experimental results on HumanML3D and KIT-ML datasets demonstrate that DT3DPE outperforms existing state-of-the-art methods in text-driven 3D human motion generation. Our code is available at https://github.com/swerizwan/DT3DPE.
{"title":"Text-driven 3D human motion generation for pose estimation using dual-transformer architecture","authors":"Rizwan Abbas , Hua Gao , Xi Li","doi":"10.1016/j.cad.2025.103991","DOIUrl":"10.1016/j.cad.2025.103991","url":null,"abstract":"<div><div>Text-to-motion generation has made significant progress in recent years. However, existing approaches struggle to generate high-quality 3D human motions that effectively capture pose estimation. These limitations are due to weak pose estimation and limited skeletal modeling. To address these limitations, we propose DT3DPE (Dual-Transformer for 3D Pose Estimation), a framework that integrates pose estimation to generate text-aligned, realistic 3D human motions. The proposed approach introduces residual vector quantization with additional layers for encoding pose tokens, enabling the capture of fine-grained details in body dynamics. Furthermore, DT3DPE employs a dual-transformer architecture, consisting of a masked transformer for motion token prediction and a residual transformer for refining motion details. This dual-transformer architecture allows the model to generate high-fidelity 3D human poses with precise body joint positioning and smooth temporal transitions. The experimental results on HumanML3D and KIT-ML datasets demonstrate that DT3DPE outperforms existing state-of-the-art methods in text-driven 3D human motion generation. Our code is available at <span><span>https://github.com/swerizwan/DT3DPE</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103991"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269413","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 : 2026-01-01Epub Date: 2025-09-20DOI: 10.1016/j.cad.2025.103967
Pablo Antolin , Michael Bartoň , Georges-Pierre Bonneau , Annalisa Buffa , Amaia Calleja-Ochoa , Gershon Elber , Stefanie Elgeti , Gaizka Gómez Escudero , Alicia Gonzalez , Haizea González Barrio , Stefanie Hahmann , Thibaut Hirschler , Q Youn Hong , Konstantin Key , Myung-Soo Kim , Michael Kofler , Norberto Lopez de Lacalle , Silvia de la Maza , Kanika Rajain , Jacques Zwar
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.
{"title":"On design, analysis, and hybrid manufacturing of microstructured blade-like geometries","authors":"Pablo Antolin , Michael Bartoň , Georges-Pierre Bonneau , Annalisa Buffa , Amaia Calleja-Ochoa , Gershon Elber , Stefanie Elgeti , Gaizka Gómez Escudero , Alicia Gonzalez , Haizea González Barrio , Stefanie Hahmann , Thibaut Hirschler , Q Youn Hong , Konstantin Key , Myung-Soo Kim , Michael Kofler , Norberto Lopez de Lacalle , Silvia de la Maza , Kanika Rajain , 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":"2026-01-01","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}
Pub Date : 2026-01-01Epub Date: 2025-09-22DOI: 10.1016/j.cad.2025.103982
Zhong Tian, Xu Xubing
This study presents a novel framework for real-time cloth wrinkle detection and optimisation, combining physics-based modelling with LSTM-Reinforcement Learning (LSTM-RL) and advanced computer vision techniques. A curated dataset of 45,876 annotated static garment images was used, featuring wrinkle attributes such as location, depth, width, and geometry. CNNs were employed for feature extraction, enhanced by Mask R-CNN to handle occlusions and RGBD data for depth-aware wrinkle modelling. A mass-spring system simulated fabric dynamics under environmental forces, while LSTM networks predicted the temporal evolution of wrinkles. Reinforcement learning dynamically adjusted fabric parameters, improving adaptability. The proposed RGBD model achieved a wrinkle detection accuracy of 96.4 %, outperforming the 2D model by over 9 %. Key metrics include an MSE of 0.0246, drift of 0.0187, and a reward value of -0.13543, with low policy and value loss confirming the RL agent’s learning stability. These results demonstrate high accuracy, real-time performance, and robustness, with strong implications for virtual fashion, robotics, and AR/VR applications.
{"title":"Research on dynamic simulation and optimization of garment wrinkles combining computer vision and image processing","authors":"Zhong Tian, Xu Xubing","doi":"10.1016/j.cad.2025.103982","DOIUrl":"10.1016/j.cad.2025.103982","url":null,"abstract":"<div><div>This study presents a novel framework for real-time cloth wrinkle detection and optimisation, combining physics-based modelling with LSTM-Reinforcement Learning (LSTM-RL) and advanced computer vision techniques. A curated dataset of 45,876 annotated static garment images was used, featuring wrinkle attributes such as location, depth, width, and geometry. CNNs were employed for feature extraction, enhanced by Mask R-CNN to handle occlusions and RGBD data for depth-aware wrinkle modelling. A mass-spring system simulated fabric dynamics under environmental forces, while LSTM networks predicted the temporal evolution of wrinkles. Reinforcement learning dynamically adjusted fabric parameters, improving adaptability. The proposed RGBD model achieved a wrinkle detection accuracy of 96.4 %, outperforming the 2D model by over 9 %. Key metrics include an MSE of 0.0246, drift of 0.0187, and a reward value of -0.13543, with low policy and value loss confirming the RL agent’s learning stability. These results demonstrate high accuracy, real-time performance, and robustness, with strong implications for virtual fashion, robotics, and AR/VR applications.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103982"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222448","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 : 2026-01-01Epub Date: 2025-09-15DOI: 10.1016/j.cad.2025.103975
Marco Meloni, Qian Zhang, Jianguo Cai
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.
{"title":"A computational framework for simulating accurate deployment motion paths of rigid foldable origami tessellations","authors":"Marco Meloni, Qian Zhang, 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":"2026-01-01","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}
Pub Date : 2026-01-01Epub Date: 2025-09-10DOI: 10.1016/j.cad.2025.103951
Juan Zaragoza Chichell , Michal Bizzarri , Judith Echevarrieta Ibarra , Aritz Pérez , Michael Bartoň
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.
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.
{"title":"Evolution-based tool path and motion planning optimization for 5-axis CNC machining of free-form surfaces","authors":"Juan Zaragoza Chichell , Michal Bizzarri , Judith Echevarrieta Ibarra , Aritz Pérez , 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":"2026-01-01","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}
Pub Date : 2026-01-01Epub Date: 2025-09-18DOI: 10.1016/j.cad.2025.103963
Taoran Liu , Hongfei Ye , Xiangqiao Meng , Zhiwei Liu , Jianjun Chen
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.
{"title":"Robust and fast local repair for intersecting triangle meshes","authors":"Taoran Liu , Hongfei Ye , Xiangqiao Meng , Zhiwei Liu , 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":"2026-01-01","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}