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

MidSurfer: Efficient Mid-Surface Abstraction from Variable Thin-Walled Models 中冲浪者：从可变薄壁模型中高效提取中表面

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-22 DOI: 10.1016/j.cad.2025.103965

Li Ye , Xinhang Zhou , Peng Fan , Ruofeng Tong , Hailong Li , Peng Du , Min Tang

This paper addresses the challenge of efficiently abstracting mid-surfaces from complex variable thin-walled models, a critical task in computer-aided design (CAD) and finite element analysis (FEA) for simplifying thin-walled structures. Traditional methods often require manual specification of pairing faces, which can be time-consuming and error-prone. Alternatively, automatic face pairing methods fail to meet the actual needs of variable thin-walled models, resulting in the accumulation of topological errors. Additionally, existing algorithms struggle to extract mid-surfaces from models with varying wall thickness or produce mid-surfaces with poor accuracy, leading to geometric errors. Furthermore, the computational efficiency of these methods is often inadequate for large-scale models. To overcome these challenges, we propose an automated face-pairing mechanism that eliminates the need for manual intervention, enhancing the algorithm’s robustness and enabling it to handle cases that the commercial CAD modeling engine, Parasolid, cannot process. Our approach accurately processes variable thin-walled models, with results closely aligning with the ground truth, as demonstrated by the provided error distribution tables. Moreover, our algorithm achieves a

4 - 12

times improvement in efficiency than previous methods over the geometry extraction stage and supports multi-threaded acceleration, significantly reducing computation time. Experimental results demonstrate that our algorithm surpasses existing methods in both accuracy and efficiency, offering a promising solution for mid-surface extraction in complex, variable thin-walled models.

本文解决了从复杂的可变薄壁模型中有效地抽象中间曲面的挑战，这是简化薄壁结构的计算机辅助设计（CAD）和有限元分析（FEA）中的关键任务。传统方法通常需要手动指定配对面，这既耗时又容易出错。另一方面，自动人脸配对方法无法满足变薄壁模型的实际需要，导致拓扑误差的积累。此外，现有算法难以从不同壁厚的模型中提取中间面，或者产生精度较差的中间面，从而导致几何误差。此外，这些方法的计算效率往往不适合大规模模型。为了克服这些挑战，我们提出了一种自动人脸配对机制，消除了人工干预的需要，增强了算法的鲁棒性，并使其能够处理商业CAD建模引擎Parasolid无法处理的情况。我们的方法精确地处理可变薄壁模型，结果与地面事实紧密一致，如所提供的误差分布表所示。此外，我们的算法在几何提取阶段的效率比以前的方法提高了4 - 12倍，并支持多线程加速，显著减少了计算时间。实验结果表明，该算法在精度和效率上均优于现有方法，为复杂、可变薄壁模型的中表面提取提供了一种有希望的解决方案。

{"title":"MidSurfer: Efficient Mid-Surface Abstraction from Variable Thin-Walled Models","authors":"Li Ye , Xinhang Zhou , Peng Fan , Ruofeng Tong , Hailong Li , Peng Du , Min Tang","doi":"10.1016/j.cad.2025.103965","DOIUrl":"10.1016/j.cad.2025.103965","url":null,"abstract":"<div><div>This paper addresses the challenge of efficiently abstracting mid-surfaces from complex variable thin-walled models, a critical task in computer-aided design (CAD) and finite element analysis (FEA) for simplifying thin-walled structures. Traditional methods often require manual specification of pairing faces, which can be time-consuming and error-prone. Alternatively, automatic face pairing methods fail to meet the actual needs of variable thin-walled models, resulting in the accumulation of topological errors. Additionally, existing algorithms struggle to extract mid-surfaces from models with varying wall thickness or produce mid-surfaces with poor accuracy, leading to geometric errors. Furthermore, the computational efficiency of these methods is often inadequate for large-scale models. To overcome these challenges, we propose an automated face-pairing mechanism that eliminates the need for manual intervention, enhancing the algorithm’s robustness and enabling it to handle cases that the commercial CAD modeling engine, Parasolid, cannot process. Our approach accurately processes variable thin-walled models, with results closely aligning with the ground truth, as demonstrated by the provided error distribution tables. Moreover, our algorithm achieves a <span><math><mrow><mn>4</mn><mo>−</mo><mn>12</mn></mrow></math></span> times improvement in efficiency than previous methods over the geometry extraction stage and supports multi-threaded acceleration, significantly reducing computation time. Experimental results demonstrate that our algorithm surpasses existing methods in both accuracy and efficiency, offering a promising solution for mid-surface extraction in complex, variable thin-walled models.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103965"},"PeriodicalIF":3.1,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Interactive design of developable surfaces by patch-based learning 基于补丁学习的可展开曲面交互设计

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-22 DOI: 10.1016/j.cad.2025.103970

Chaoyun Wang , Jianlei Wang , Chengcheng Tang , Nanning Zheng , Caigui Jiang

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.

本文介绍了一种可展表面的交互式设计方法，以数据驱动的方法为中心，优化表面斑块的可展性。表面斑块是整个表面的基本组成部分，通常由三角形网格表示。我们提出了一种新的基于学习的方法，有效地将具有任意边界的斑块转换为其最近的可展开曲面。基于这种方法，我们的工具可以实现可展开曲面的实时拖放设计，并通过交互式输入支持分段可展开近似。实验结果表明，该方法为可展开曲面的交互设计提供了快速的计算基础，提高了设计的灵活性，同时具有良好的鲁棒性和通用性。在人机协同分割的指导下，该模型的分段可开发近似实现了更高的整体近似精度，更少的补丁和逼真的纸工艺结果。这为满足复杂现实场景的应用需求提供了更大的灵活性，并为将深度学习与交互式几何设计集成提供了新的范例。

{"title":"Interactive design of developable surfaces by patch-based learning","authors":"Chaoyun Wang , Jianlei Wang , Chengcheng Tang , Nanning Zheng , 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}

引用次数: 0

On design, analysis, and hybrid manufacturing of microstructured blade-like geometries 微结构叶片状几何形状的设计、分析和混合制造

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-20 DOI: 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.

随着新制造技术的发展，如多材料3D打印，人们可以想到由更少，但异质的材料组成的新型物体，因此多孔，更轻，更便宜，同时具有与原始物体完全相同的功能，当由单一固体材料制造时。我们的目标是质疑五十年来几何CAD的传统范式，并专注于新一代的CAD对象，这些对象不是固体的，而是包含异质自由形式的内部微观结构。我们提出了一个统一的制造管道，涉及所有阶段，即设计，优化，制造和检查微结构的自由形状几何。我们在一个工业测试案例中展示了我们的管道，该管道可以维持所需的压力限制，但与固体叶片相比，所需的材料要少得多。

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

引用次数: 0

Size-controlled quadrilateral meshing using integrable odeco fields 使用可积odeco域的尺寸控制四边形网格

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-19 DOI: 10.1016/j.cad.2025.103974

Mattéo Couplet , Alexandre Chemin , Jean-François Remacle

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 integrable orthogonal frame fields, whose symmetries are implicitly represented using orthogonally decomposable (odeco) 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.

提出了一种符合边界和特征曲线尺寸规定的平面四边形网格计算新方法。该方法依赖于计算可积正交框架域，其对称性用正交可分解张量隐式表示。为了构造一个可积准则，我们用张量表示来表示坐标系场的李括号；这可以通过研究坐标系对张量扰动的灵敏度来实现。我们构造了一个计算各向同性和各向异性设置下光滑和可积框架场的能量公式。求解器创建并放置所需的奇异点，以便用正确的拓扑来适应大小约束。将计算得到的帧域集成到与帧域对齐的无缝参数化中，提出了一种依赖于参数化贪婪量化的网格提取方法。

引用次数: 0

Robust and fast local repair for intersecting triangle meshes 鲁棒和快速局部修复相交三角形网格

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-18 DOI: 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":"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}

引用次数: 0

Unfolding 3D shape convolutional networks for aerodynamic drag prediction in vehicle design 展开三维形状卷积网络用于飞行器气动阻力预测

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-16 DOI: 10.1016/j.cad.2025.103971

Yangchen Liu , Yubin Tang , Xiaomeng Tong , Qinglei Cao , Zichuan Fan

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

^{2}

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.

气动阻力系数在车辆设计中是至关重要的，特别是在外形设计阶段，外观几何形状直接影响到阻力系数。降低阻力系数可以提高燃油效率，降低排放，并改善车辆的动力学和稳定性。然而，现有的计算流体动力学（CFD）等方法耗时且计算量大，不适合实时反馈。为了解决这个问题，我们提出了一种创新的深度学习模型——未折叠卷积神经网络（UFConv）。UFConv中的ABTrans和距离映射方法通过将3D结构展开为低维表示来降低复杂性。这加速了训练，同时通过提取关键特征和避免冗余信息保持高准确性。在DrivAerNet和DrivAerNet++数据集上，UFConv模型的R2值分别为0.941和0.829，特定车型的峰值为0.952。与其他方法相比，训练时间也明显缩短。结果表明，UFConv在预测汽车阻力方面优于现有方法，提供了更高的精度和更快的训练速度。

{"title":"Unfolding 3D shape convolutional networks for aerodynamic drag prediction in vehicle design","authors":"Yangchen Liu , Yubin Tang , Xiaomeng Tong , Qinglei Cao , 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}

引用次数: 0

A computational framework for simulating accurate deployment motion paths of rigid foldable origami tessellations 一种模拟刚性可折叠折纸镶嵌精确展开运动路径的计算框架

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-15 DOI: 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.

折纸镶嵌在机器人、空间结构和机械超材料等领域得到了广泛的应用。其中，刚性可折叠折纸由于其理想的特性，包括控制运动，可扩展性和在不变形面板的情况下折叠的能力，已经引起了极大的关注。然而，用广义方法评估折叠运动和折叠形状仍然是其设计中关键但具有挑战性的一步。为了解决这个问题，我们提出了一个计算框架，利用袋鼠求解器来实现精确的运动路径和刚性可折叠折纸镶嵌的折叠构型。该框架扩展了Kangaroo插件的功能，支持可展开和不可展开模式、绑定和连接模型以及顺序折叠运动的精确运动路径模拟。它还支持广泛的几何形状，从折纸和kirigami复合材料和超材料。通过提供先进的工具来模拟复杂的折叠行为，提出的方法可以促进创新的折纸设计的发展，跨越各种应用。

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

引用次数: 0

Mesh generation of curvilinear polygons for the high-order virtual element method (VEM) 基于高阶虚元法的曲线多边形网格生成

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-15 DOI: 10.1016/j.cad.2025.103966

Kaloyan S. Kirilov , Jingtian Zhou , Joaquim Peiró , Mashy Green , David Moxey , Lourenço Beirão da Veiga , Alessandro Russo , Franco Dassi

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 a posteriori 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.

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.

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.

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.

我们提出了一种概念验证方法，用于通过虚拟元法（VEM）生成适合高阶离散的曲线多边形网格。VEM离散化需要定义一组边界点和内部点，用于定义基函数和计算多项式的积分。在边界上定位这些点的过程借鉴了先前在后验高阶网格生成工作的思想，其中对计算域的B-rep模型的几何查询是通过CAD库的接口执行的。在这里，我们描述了将使用第三方软件生成的直边多边形网格转换为符合边界的曲线网格的步骤。我们讨论了确保和验证网格有效性的标准。利用具有Dirichlet边界条件的椭圆型偏微分方程作为模型问题，我们证明了随着网格分辨率的增加，这种网格上的VEM离散达到了预期的收敛率。这是随后的一个说明性应用的方法，以生成一个曲线多边形网格的翼型几何。我们讨论多边形曲线网格质量及其增强，并使用单元顶点的运动来评估三个基本质量指标，即凸性，规则性和各向同性，并强调在网格质量优化中使用它们的一些困难。利用一种无导数优化方法，通过最大化适当的网格质量度量来增强曲线多边形网格。我们提出这样的措施，作为三个质量指标的组合，并应用它来优化一个扭曲的初始网格的环形几何。我们证明了一种合适的凸度度量在解缠无效网格方面是有效的。在环形几何中，变形网格和优化网格的误差较小，得到了模型椭圆方程的VEM解，表明VEM具有鲁棒性，对网格畸变相对不敏感，并且优化网格的误差减小。最后，我们使用了一个更复杂的几何结构，一个翼型的计算域，作为基准，进一步说明了凹凸度度量解缠网格的能力，并评估了两种质量度量作为优化目标的适用性，以提高曲线多边形网格的整体质量。

{"title":"Mesh generation of curvilinear polygons for the high-order virtual element method (VEM)","authors":"Kaloyan S. Kirilov , Jingtian Zhou , Joaquim Peiró , Mashy Green , David Moxey , Lourenço Beirão da Veiga , Alessandro Russo , 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}

引用次数: 0

Heat method extensions for distance function estimation in planar and space domains 平面和空间域距离函数估计的热方法扩展

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-15 DOI: 10.1016/j.cad.2025.103968

Alexander Belyaev , Pierre-Alain Fayolle

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.

给定一个有界域，我们处理域内点到域边界的距离函数估计问题。介绍了热法在距离计算中的两个简单推广，并对其进行了评价。扩展是基于一阶和二阶泰勒级数外推。数值实验表明，该扩展提供了更准确和鲁棒的距离函数估计。

引用次数: 0

Quadrilateral mesh generation based on foliation and meromorphic quadratic differential 基于叶理和亚纯二次微分的四边形网格生成

IF 3.1 3区计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Computer-Aided Design

Pub Date : 2025-09-13 DOI: 10.1016/j.cad.2025.103953

Xiaopeng Zheng, Hao Wang, Na Lei, Zhongxuan Luo

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.

由叶理和二次微分导出的四边形网格具有高度的结构规律性。然而，对于复杂的模型，由叶理直接生成的网格及其引起的全纯二次微分在面积畸变、角点保存和单元尺寸均匀分布等方面面临着显著的挑战。为了克服这些限制，我们引入了一套基于表面叶理和亚纯二次微分的增强技术。具体地说，我们引入极点约束叶理来计算亚纯二次微分，显著减少了面积畸变。此外，进一步引入了一种改进的双覆盖策略，通过改变模型的拓扑结构来保留拐角特征。最后，采用自适应度量图优化，保证网格元素均匀分布。实验验证了该方法的有效性。

引用次数: 0