首页 > 最新文献

Computer-Aided Design最新文献

英文 中文
Generation of continuous and sparse space filling toolpath with tailored density for additive manufacturing of biomimetics 生成具有定制密度的连续稀疏空间填充工具路径,用于生物仿生增材制造
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-04-26 DOI: 10.1016/j.cad.2024.103718
Sadaival Singh , Ambrish Singh , Sajan Kapil, Manas Das

A method of generating a continuous toolpath that can be biased in a user-specified direction of travel is proposed for the fabrication of density-based functionally graded parts through Additive Manufacturing (AM). The methodology utilizes Lin Kernighan's (LK) Travelling Salesman Problem (TSP) solver over a digitized grid within the contour domain to generate a toolpath with minimal lifts and a common start and end point. Three force-based methods of digitization, namely rectangular, circular, and contour adaptive, are proposed in this work. Each of these methods initialize from a structured or an unstructured grid, where the grid points are assumed to be connected with either linear (rectangular digitization) or a combination of linear and torsional springs (circular and contour adaptive digitization). Enforcing an equilibrium amongst the spring forces and appropriately selecting the ideal spring length, the necessary configuration of grid points can be generated for a desired toolpath.

The density of grid points (consequently, part density) can be varied through the user-defined input function or an image-based density map imposed on the ideal spring length over the contour domain. The proposed toolpath, as a case study, was implemented for printing a bone with density prescribed through a CT scan image stack. The CT scan of the printed part qualitatively establishes the conformity of the toolpath to the user-specified density gradient.

本文提出了一种生成连续刀具路径的方法,该路径可偏向用户指定的移动方向,用于通过增材制造(AM)制造基于密度的功能分级零件。该方法利用 Lin Kernighan(LK)的旅行推销员问题(TSP)求解器,在轮廓域内的数字化网格上生成具有最小提升和共同起点与终点的刀具路径。本研究提出了三种基于力的数字化方法,即矩形、圆形和轮廓自适应。每种方法都从结构化或非结构化网格初始化,网格点之间假定由线性弹簧(矩形数字化)或线性弹簧和扭转弹簧组合(圆形和轮廓自适应数字化)连接。网格点的密度(即零件密度)可通过用户定义的输入函数或基于图像的密度图改变,该密度图施加在轮廓域的理想弹簧长度上。作为一项案例研究,所提出的工具路径用于打印通过 CT 扫描图像堆栈规定密度的骨骼。打印部件的 CT 扫描定性地确定了工具路径是否符合用户指定的密度梯度。
{"title":"Generation of continuous and sparse space filling toolpath with tailored density for additive manufacturing of biomimetics","authors":"Sadaival Singh ,&nbsp;Ambrish Singh ,&nbsp;Sajan Kapil,&nbsp;Manas Das","doi":"10.1016/j.cad.2024.103718","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103718","url":null,"abstract":"<div><p>A method of generating a continuous toolpath that can be biased in a user-specified direction of travel is proposed for the fabrication of density-based functionally graded parts through <em>Additive Manufacturing (AM)</em>. The methodology utilizes <em>Lin Kernighan's (LK) Travelling Salesman Problem (TSP)</em> solver over a digitized grid within the contour domain to generate a toolpath with minimal lifts and a common start and end point. Three force-based methods of digitization, namely rectangular, circular, and contour adaptive, are proposed in this work. Each of these methods initialize from a structured or an unstructured grid, where the grid points are assumed to be connected with either linear (rectangular digitization) or a combination of linear and torsional springs (circular and contour adaptive digitization). Enforcing an equilibrium amongst the spring forces and appropriately selecting the ideal spring length, the necessary configuration of grid points can be generated for a desired toolpath.</p><p>The density of grid points (consequently, part density) can be varied through the user-defined input function or an image-based density map imposed on the ideal spring length over the contour domain. The proposed toolpath, as a case study, was implemented for printing a bone with density prescribed through a CT scan image stack. The CT scan of the printed part qualitatively establishes the conformity of the toolpath to the user-specified density gradient.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"173 ","pages":"Article 103718"},"PeriodicalIF":4.3,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140894582","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
Newton Geometric Iterative Method for B-Spline Curve and Surface Approximation 用于 B 样条曲线和曲面逼近的牛顿几何迭代法
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-04-21 DOI: 10.1016/j.cad.2024.103716
Qiuyang Song, Pengbo Bo

We introduce a progressive and iterative method for B-spline curve and surface approximation, incorporating parameter correction based on the Newton iterative method. While parameter corrections have been used in existing Geometric Approximation (GA) methods to enhance approximation quality, they suffer from low computational efficiency. Our approach unifies control point updates and parameter corrections in a progressive and iterative procedure, employing a one-step strategy for parameter correction. We provide a theoretical proof of convergence for the algorithm, demonstrating its superior computational efficiency compared to current GA methods. Furthermore, the provided convergence proof offers a methodology for proving the convergence of existing GA methods with location parameter correction.

我们介绍了一种基于牛顿迭代法的渐进迭代 B-样条曲线和曲面逼近方法,其中包含参数修正。虽然现有的几何逼近(GA)方法中使用了参数修正来提高逼近质量,但它们的计算效率较低。我们的方法将控制点更新和参数修正统一在一个渐进的迭代过程中,采用一步参数修正策略。我们提供了该算法的理论收敛性证明,证明其计算效率优于当前的 GA 方法。此外,所提供的收敛性证明还为证明具有位置参数修正功能的现有 GA 方法的收敛性提供了一种方法。
{"title":"Newton Geometric Iterative Method for B-Spline Curve and Surface Approximation","authors":"Qiuyang Song,&nbsp;Pengbo Bo","doi":"10.1016/j.cad.2024.103716","DOIUrl":"10.1016/j.cad.2024.103716","url":null,"abstract":"<div><p>We introduce a progressive and iterative method for B-spline curve and surface approximation, incorporating parameter correction based on the Newton iterative method. While parameter corrections have been used in existing Geometric Approximation (GA) methods to enhance approximation quality, they suffer from low computational efficiency. Our approach unifies control point updates and parameter corrections in a progressive and iterative procedure, employing a one-step strategy for parameter correction. We provide a theoretical proof of convergence for the algorithm, demonstrating its superior computational efficiency compared to current GA methods. Furthermore, the provided convergence proof offers a methodology for proving the convergence of existing GA methods with location parameter correction.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"172 ","pages":"Article 103716"},"PeriodicalIF":4.3,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140795557","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
Neural PDE Solvers for Irregular Domains 不规则域的神经 PDE 求解器
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-04-14 DOI: 10.1016/j.cad.2024.103709
Biswajit Khara , Ethan Herron , Aditya Balu , Dhruv Gamdha , Chih-Hsuan Yang , Kumar Saurabh , Anushrut Jignasu , Zhanhong Jiang , Soumik Sarkar , Chinmay Hegde , Baskar Ganapathysubramanian , Adarsh Krishnamurthy

Neural network-based approaches for solving partial differential equations (PDEs) have recently received special attention. However, most neural PDE solvers only apply to rectilinear domains and do not systematically address the imposition of boundary conditions over irregular domain boundaries. In this paper, we present a neural framework to solve partial differential equations over domains with irregularly shaped (non-rectilinear) geometric boundaries. Given the shape of the domain as an input (represented as a binary mask), our network is able to predict the solution field, and can generalize to novel (unseen) irregular domains; the key technical ingredient to realizing this model is a physics-informed loss function that directly incorporates the interior-exterior information of the geometry. We also perform a careful error analysis which reveals theoretical insights into several sources of error incurred in the model-building process. Finally, we showcase various applications in 2D and 3D, along with favorable comparisons with ground truth solutions.

基于神经网络的偏微分方程(PDE)求解方法最近受到了特别关注。然而,大多数神经偏微分方程求解器只适用于直线域,并没有系统地解决在不规则域边界上施加边界条件的问题。在本文中,我们提出了一个神经框架,用于求解具有不规则形状(非直线)几何边界的域上的偏微分方程。给定域的形状作为输入(以二进制掩码表示),我们的网络就能预测解场,并能泛化到新的(未见过的)不规则域;实现这一模型的关键技术要素是一个物理信息损失函数,它直接包含了几何体的内部-外部信息。我们还进行了细致的误差分析,从理论上揭示了模型建立过程中产生误差的几个来源。最后,我们展示了二维和三维中的各种应用,以及与地面实况解决方案的有利比较。
{"title":"Neural PDE Solvers for Irregular Domains","authors":"Biswajit Khara ,&nbsp;Ethan Herron ,&nbsp;Aditya Balu ,&nbsp;Dhruv Gamdha ,&nbsp;Chih-Hsuan Yang ,&nbsp;Kumar Saurabh ,&nbsp;Anushrut Jignasu ,&nbsp;Zhanhong Jiang ,&nbsp;Soumik Sarkar ,&nbsp;Chinmay Hegde ,&nbsp;Baskar Ganapathysubramanian ,&nbsp;Adarsh Krishnamurthy","doi":"10.1016/j.cad.2024.103709","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103709","url":null,"abstract":"<div><p>Neural network-based approaches for solving partial differential equations (PDEs) have recently received special attention. However, most neural PDE solvers only apply to rectilinear domains and do not systematically address the imposition of boundary conditions over irregular domain boundaries. In this paper, we present a neural framework to solve partial differential equations over domains with irregularly shaped (non-rectilinear) geometric boundaries. Given the shape of the domain as an input (represented as a binary mask), our network is able to predict the solution field, and can generalize to novel (unseen) irregular domains; the key technical ingredient to realizing this model is a physics-informed loss function that directly incorporates the interior-exterior information of the geometry. We also perform a careful error analysis which reveals theoretical insights into several sources of error incurred in the model-building process. Finally, we showcase various applications in 2D and 3D, along with favorable comparisons with ground truth solutions.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"172 ","pages":"Article 103709"},"PeriodicalIF":4.3,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140633402","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
Denoising point clouds with fewer learnable parameters 用更少的可学习参数对点云进行去噪
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-03-30 DOI: 10.1016/j.cad.2024.103708
Huankun Sheng , Ying Li

Point cloud denoising is a crucial task in the field of geometric processing. Recent years have witnessed significant advancements in deep learning-based point cloud denoising algorithms. These methods, compared to traditional techniques, demonstrate enhanced robustness against noise and produce point cloud data of higher fidelity. Despite their impressive performance, achieving a balance between denoising efficacy and computational efficiency remains a formidable challenge in learning-based methods. To solve this problem, we introduce LPCDNet, a novel lightweight point cloud denoising network. LPCDNet consists of three main components: a lightweight feature extraction module utilizing trigonometric functions for relative position encoding; a non-parametric feature aggregation module to leverage semantic similarities for global context comprehension; and a decoder module designed to realign noise points with the underlying surface. The network is designed to capture both local details and non-local structures, thereby ensuring high-quality denoising outcomes with a minimal parameter count. Extensive experimental evaluations demonstrate that LPCDNet achieves comparable or superior performance to state-of-the-art methods, while significantly reducing the number of learnable parameters and the necessary running time.

点云去噪是几何处理领域的一项重要任务。近年来,基于深度学习的点云去噪算法取得了重大进展。与传统技术相比,这些方法具有更强的抗噪能力,并能生成保真度更高的点云数据。尽管这些方法的性能令人印象深刻,但在去噪效果和计算效率之间实现平衡仍然是基于学习的方法所面临的巨大挑战。为了解决这个问题,我们引入了一种新型轻量级点云去噪网络 LPCDNet。LPCDNet 由三个主要部分组成:利用三角函数进行相对位置编码的轻量级特征提取模块;利用语义相似性进行全局上下文理解的非参数特征聚合模块;以及旨在将噪声点与底层表面重新对齐的解码器模块。该网络旨在捕捉局部细节和非局部结构,从而确保以最小的参数数量实现高质量的去噪结果。广泛的实验评估表明,LPCDNet 的性能可与最先进的方法相媲美,甚至更胜一筹,同时显著减少了可学习参数的数量和必要的运行时间。
{"title":"Denoising point clouds with fewer learnable parameters","authors":"Huankun Sheng ,&nbsp;Ying Li","doi":"10.1016/j.cad.2024.103708","DOIUrl":"10.1016/j.cad.2024.103708","url":null,"abstract":"<div><p>Point cloud denoising is a crucial task in the field of geometric processing. Recent years have witnessed significant advancements in deep learning-based point cloud denoising algorithms. These methods, compared to traditional techniques, demonstrate enhanced robustness against noise and produce point cloud data of higher fidelity. Despite their impressive performance, achieving a balance between denoising efficacy and computational efficiency remains a formidable challenge in learning-based methods. To solve this problem, we introduce LPCDNet, a novel lightweight point cloud denoising network. LPCDNet consists of three main components: a lightweight feature extraction module utilizing trigonometric functions for relative position encoding; a non-parametric feature aggregation module to leverage semantic similarities for global context comprehension; and a decoder module designed to realign noise points with the underlying surface. The network is designed to capture both local details and non-local structures, thereby ensuring high-quality denoising outcomes with a minimal parameter count. Extensive experimental evaluations demonstrate that LPCDNet achieves comparable or superior performance to state-of-the-art methods, while significantly reducing the number of learnable parameters and the necessary running time.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"172 ","pages":"Article 103708"},"PeriodicalIF":4.3,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140401215","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
Latent Diffusion Models for Structural Component Design 用于结构组件设计的潜在扩散模型
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-03-22 DOI: 10.1016/j.cad.2024.103707
Ethan Herron, Jaydeep Rade, Anushrut Jignasu, Baskar Ganapathysubramanian, Aditya Balu, Soumik Sarkar, Adarsh Krishnamurthy

Recent advances in generative modeling, namely Diffusion models, have revolutionized generative modeling, enabling high-quality image generation tailored to user needs. This paper proposes a framework for the generative design of structural components. Specifically, we employ a Latent Diffusion model to generate potential designs of a component that can satisfy a set of problem-specific loading conditions. One of the distinct advantages our approach offers over other generative approaches is the editing of existing designs. We train our model using a dataset of geometries obtained from structural topology optimization utilizing the SIMP algorithm. Consequently, our framework generates inherently near-optimal designs. Our work presents quantitative results that support the structural performance of the generated designs and the variability in potential candidate designs. Furthermore, we provide evidence of the scalability of our framework by operating over voxel domains with resolutions varying from 323 to 1283. Our framework can be used as a starting point for generating novel near-optimal designs similar to topology-optimized designs.

生成模型(即扩散模型)的最新进展彻底改变了生成模型,使高质量的图像生成符合用户需求。本文提出了一个结构组件生成设计框架。具体来说,我们采用潜在扩散模型来生成组件的潜在设计,以满足特定问题的负载条件。与其他生成式方法相比,我们的方法的一个显著优势是可以编辑现有设计。我们使用利用 SIMP 算法从结构拓扑优化中获得的几何图形数据集来训练我们的模型。因此,我们的框架能生成接近最优的设计。我们的工作提供了定量结果,支持生成设计的结构性能和潜在候选设计的可变性。此外,我们通过在分辨率从 323 到 1283 不等的体素域上运行,证明了我们框架的可扩展性。我们的框架可以作为一个起点,用于生成类似拓扑优化设计的新型近优设计。
{"title":"Latent Diffusion Models for Structural Component Design","authors":"Ethan Herron,&nbsp;Jaydeep Rade,&nbsp;Anushrut Jignasu,&nbsp;Baskar Ganapathysubramanian,&nbsp;Aditya Balu,&nbsp;Soumik Sarkar,&nbsp;Adarsh Krishnamurthy","doi":"10.1016/j.cad.2024.103707","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103707","url":null,"abstract":"<div><p>Recent advances in generative modeling, namely Diffusion models, have revolutionized generative modeling, enabling high-quality image generation tailored to user needs. This paper proposes a framework for the generative design of structural components. Specifically, we employ a Latent Diffusion model to generate potential designs of a component that can satisfy a set of problem-specific loading conditions. One of the distinct advantages our approach offers over other generative approaches is the editing of existing designs. We train our model using a dataset of geometries obtained from structural topology optimization utilizing the SIMP algorithm. Consequently, our framework generates inherently near-optimal designs. Our work presents quantitative results that support the structural performance of the generated designs and the variability in potential candidate designs. Furthermore, we provide evidence of the scalability of our framework by operating over voxel domains with resolutions varying from <span><math><mrow><mn>3</mn><msup><mrow><mn>2</mn></mrow><mrow><mn>3</mn></mrow></msup></mrow></math></span> to <span><math><mrow><mn>12</mn><msup><mrow><mn>8</mn></mrow><mrow><mn>3</mn></mrow></msup></mrow></math></span>. Our framework can be used as a starting point for generating novel near-optimal designs similar to topology-optimized designs.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103707"},"PeriodicalIF":4.3,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140330715","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 study on the design method of multivariable control chalice-shaped columns considering horizontal forces based on multi-objective optimization 基于多目标优化的考虑水平力的多变量控制茶碗形支柱设计方法研究
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-03-15 DOI: 10.1016/j.cad.2024.103706
Han Zhang , Hang Dai , Wenjing Ren

This study proposes a design method to generate multivariable control chalice-shaped columns based on multi-objective optimization leveraging SubD modelling technology to smooth the geometric transition between slab and column. Taking horizontal force into consideration, the paper introduces total material usage as both an optimization objective and an important basis for final solution selection to gain a more elegant and dynamic form needed in architectural design. The paper applies the method to examples of both single-column and multi-column structures. The outcome is chalice-shaped columns balancing structural efficiency and aesthetic requirements.

本研究提出了一种设计方法,利用 SubD 建模技术,在多目标优化的基础上生成多变量控制的茶盏状支柱,以平滑板和柱之间的几何过渡。考虑到水平力,本文将材料总用量作为优化目标和最终方案选择的重要依据,以获得建筑设计所需的更优雅、更动感的外形。论文将该方法应用于单柱和多柱结构的实例中。其结果是在结构效率和美学要求之间实现了平衡。
{"title":"A study on the design method of multivariable control chalice-shaped columns considering horizontal forces based on multi-objective optimization","authors":"Han Zhang ,&nbsp;Hang Dai ,&nbsp;Wenjing Ren","doi":"10.1016/j.cad.2024.103706","DOIUrl":"10.1016/j.cad.2024.103706","url":null,"abstract":"<div><p>This study proposes a design method to generate multivariable control chalice-shaped columns based on multi-objective optimization leveraging SubD modelling technology to smooth the geometric transition between slab and column. Taking horizontal force into consideration, the paper introduces total material usage as both an optimization objective and an important basis for final solution selection to gain a more elegant and dynamic form needed in architectural design. The paper applies the method to examples of both single-column and multi-column structures. The outcome is chalice-shaped columns balancing structural efficiency and aesthetic requirements.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103706"},"PeriodicalIF":4.3,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140198554","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
Periodic implicit representation, design and optimization of porous structures using periodic B-splines 使用周期 B-样条对多孔结构进行周期隐式表示、设计和优化
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-03-11 DOI: 10.1016/j.cad.2024.103703
Depeng Gao, Yang Gao, Hongwei Lin

Porous structures are intricate solid materials with numerous small pores, extensively used in fields like medicine, chemical engineering, and aerospace. However, the design of such structures using computer-aided tools is a time-consuming and tedious process. In this study, we propose a novel representation method and design approach for porous units that can be infinitely spliced to form a porous structure. We use periodic B-spline functions to represent periodic or symmetric porous units. Starting from a voxel representation of a porous sample, the discrete distance field is computed. To fit the discrete distance field with a periodic B-spline, we introduce the constrained least squares progressive-iterative approximation algorithm, which results in an implicit porous unit. This unit can be subject to optimization to enhance connectivity and utilized for topology optimization, thereby improving the model’s stiffness while maintaining periodicity or symmetry. The experimental results demonstrate the potential of the designed complex porous units in enhancing the mechanical performance of the model. Consequently, this study has the potential to incorporate remarkable structures derived from artificial design or nature into the design of high-performing models, showing the promise for biomimetic applications.

多孔结构是一种具有无数小孔的复杂固体材料,广泛应用于医学、化学工程和航空航天等领域。然而,使用计算机辅助工具设计此类结构是一个耗时且繁琐的过程。在本研究中,我们为可无限拼接形成多孔结构的多孔单元提出了一种新颖的表示方法和设计方法。我们使用周期性 B-样条函数来表示周期性或对称性多孔单元。从多孔样本的体素表示开始,计算离散距离场。为了用周期 B-样条函数拟合离散距离场,我们引入了受约束最小二乘渐进迭代逼近算法,从而得到一个隐式多孔单元。该单元可进行优化以增强连通性,并可用于拓扑优化,从而在保持周期性或对称性的同时提高模型的刚度。实验结果表明,所设计的复杂多孔单元具有提高模型机械性能的潜力。因此,这项研究有可能将源自人工设计或自然界的非凡结构融入高性能模型的设计中,为生物仿生应用带来希望。
{"title":"Periodic implicit representation, design and optimization of porous structures using periodic B-splines","authors":"Depeng Gao,&nbsp;Yang Gao,&nbsp;Hongwei Lin","doi":"10.1016/j.cad.2024.103703","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103703","url":null,"abstract":"<div><p>Porous structures are intricate solid materials with numerous small pores, extensively used in fields like medicine, chemical engineering, and aerospace. However, the design of such structures using computer-aided tools is a time-consuming and tedious process. In this study, we propose a novel representation method and design approach for porous units that can be infinitely spliced to form a porous structure. We use periodic B-spline functions to represent periodic or symmetric porous units. Starting from a voxel representation of a porous sample, the discrete distance field is computed. To fit the discrete distance field with a periodic B-spline, we introduce the constrained least squares progressive-iterative approximation algorithm, which results in an implicit porous unit. This unit can be subject to optimization to enhance connectivity and utilized for topology optimization, thereby improving the model’s stiffness while maintaining periodicity or symmetry. The experimental results demonstrate the potential of the designed complex porous units in enhancing the mechanical performance of the model. Consequently, this study has the potential to incorporate remarkable structures derived from artificial design or nature into the design of high-performing models, showing the promise for biomimetic applications.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103703"},"PeriodicalIF":4.3,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140121990","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
Robust Hole-Detection in Triangular Meshes Irrespective of the Presence of Singular Vertices 无论是否存在奇异顶点,都能在三角形网格中进行可靠的孔检测
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-02-28 DOI: 10.1016/j.cad.2024.103696
Mauhing Yip , Annette Stahl , Christian Schellewald

In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of the mesh. The proposed automated hole-detection method is valuable to the computer-aided design (CAD) community as all boundary-edges within the mesh are utilized and for each boundary-edge the algorithm guarantees both the existence and the uniqueness of the boundary associated to it. As existing hole-detection approaches assume that singular vertices are absent or may require mesh modification, these methods are ill-equipped to detect boundaries/holes in real-world meshes that contain singular vertices. We demonstrate the method in an underwater autonomous robotic application, exploiting surface reconstruction methods based on point cloud data. In such a scenario the determined holes can be interpreted as information gaps, enabling timely corrective action during the data acquisition. However, the scope of our method is not confined to these two sectors alone; it is versatile enough to be applied on any edge-manifold triangle mesh. An evaluation of the method is performed on both synthetic and real-world data (including a triangle mesh from a point cloud obtained by a multibeam sonar). The source code of our reference implementation is available: https://github.com/Mauhing/hole-detection-on-triangle-mesh.

在这项工作中,我们提出了一种边界和孔洞检测方法,它可以遍历边-曲面三角形网格的所有边界,而不管是否存在奇异顶点,随后确定并标记网格的所有孔洞。所提出的自动孔洞检测方法对计算机辅助设计(CAD)领域非常有价值,因为网格中的所有边界边都会被利用,而且对于每个边界边,算法都能保证与其相关的边界的存在性和唯一性。由于现有的孔洞检测方法假定不存在奇异顶点或可能需要修改网格,因此这些方法不适合检测现实世界中包含奇异顶点的网格中的边界/孔洞。我们利用基于点云数据的表面重建方法,在水下自主机器人应用中演示了该方法。在这种情况下,确定的孔洞可以解释为信息差距,从而在数据采集过程中及时采取纠正措施。不过,我们的方法并不局限于这两个领域,它还可以应用于任何边缘-曲面三角形网格。我们在合成数据和实际数据(包括从多波束声纳获取的点云中得到的三角形网格)上对该方法进行了评估。我们的参考实现的源代码可在以下网站获取:https://github.com/Mauhing/hole-detection-on-triangle-mesh。
{"title":"Robust Hole-Detection in Triangular Meshes Irrespective of the Presence of Singular Vertices","authors":"Mauhing Yip ,&nbsp;Annette Stahl ,&nbsp;Christian Schellewald","doi":"10.1016/j.cad.2024.103696","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103696","url":null,"abstract":"<div><p>In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of the mesh. The proposed automated hole-detection method is valuable to the computer-aided design (CAD) community as all boundary-edges within the mesh are utilized and for each boundary-edge the algorithm guarantees both the existence and the uniqueness of the boundary associated to it. As existing hole-detection approaches assume that singular vertices are absent or may require mesh modification, these methods are ill-equipped to detect boundaries/holes in real-world meshes that contain singular vertices. We demonstrate the method in an underwater autonomous robotic application, exploiting surface reconstruction methods based on point cloud data. In such a scenario the determined holes can be interpreted as information gaps, enabling timely corrective action during the data acquisition. However, the scope of our method is not confined to these two sectors alone; it is versatile enough to be applied on any edge-manifold triangle mesh. An evaluation of the method is performed on both synthetic and real-world data (including a triangle mesh from a point cloud obtained by a multibeam sonar). The source code of our reference implementation is available: <span>https://github.com/Mauhing/hole-detection-on-triangle-mesh</span><svg><path></path></svg>.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103696"},"PeriodicalIF":4.3,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S001044852400023X/pdfft?md5=15189e6bb47b6319e85b8bbbfd406777&pid=1-s2.0-S001044852400023X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140024119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A computational implementation of Vector-based 3D Graphic Statics (VGS) for interactive and real-time structural design 用于交互式实时结构设计的基于矢量的 3D 图形静力学 (VGS) 的计算实现
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-02-20 DOI: 10.1016/j.cad.2024.103695
Jean-Philippe Jasienski , Yuchi Shen , Patrick Ole Ohlbrock , Denis Zastavni , Pierluigi D'Acunto

This article presents a computational implementation for the Vector-based Graphic Statics (VGS) framework making it an effective CAD tool for the design of spatial structures in static equilibrium (VGS-tool). The paper introduces several key features that convert a purely theoretical graph and geometry based framework into a fully automated computational procedure, including the following new contributions: a general algorithm for constructing 3-dimensional interdependent force and force diagrams; the implementation of a procedure that allows the interdependent transformation of both diagrams; an approach to apply specific constraints to the computationally generated diagrams; the integration of the algorithms as a plug-in for a CAD environment (Grasshopper3D of Rhino3D). The main features of the proposed framework are highlighted with a design case study developed using the newly introduced CAD plug-in (namely the VGS-tool). This plugin uses synthetic-oriented and intuitive graphical representation to allow the user to design spatial structures in equilibrium as three-dimensional trusses. The goal is to facilitate collaboration between structural engineers and architects during the conceptual phase of the design process.

本文介绍了基于矢量的图形静力学(VGS)框架的计算实现,使其成为设计静力平衡空间结构的有效 CAD 工具(VGS 工具)。本文介绍了将基于图形和几何的纯理论框架转换为全自动计算程序的几个关键特征,包括以下新贡献:构建三维相互依赖的力图和力图表的通用算法;实现允许这两种图表相互依赖转换的程序;对计算生成的图表应用特定约束的方法;将算法集成为 CAD 环境(Grasshopper3D 和 Rhino3D)的插件。通过使用新引入的 CAD 插件(即 VGS 工具)开发的设计案例研究,重点介绍了拟议框架的主要特点。该插件采用面向合成的直观图形表示法,允许用户以三维桁架的形式设计处于平衡状态的空间结构。其目的是促进结构工程师和建筑师在设计过程的概念阶段开展合作。
{"title":"A computational implementation of Vector-based 3D Graphic Statics (VGS) for interactive and real-time structural design","authors":"Jean-Philippe Jasienski ,&nbsp;Yuchi Shen ,&nbsp;Patrick Ole Ohlbrock ,&nbsp;Denis Zastavni ,&nbsp;Pierluigi D'Acunto","doi":"10.1016/j.cad.2024.103695","DOIUrl":"10.1016/j.cad.2024.103695","url":null,"abstract":"<div><p>This article presents a computational implementation for the Vector-based Graphic Statics (VGS) framework making it an effective CAD tool for the design of spatial structures in static equilibrium (VGS-tool). The paper introduces several key features that convert a purely theoretical graph and geometry based framework into a fully automated computational procedure, including the following new contributions: a general algorithm for constructing 3-dimensional interdependent force and force diagrams; the implementation of a procedure that allows the interdependent transformation of both diagrams; an approach to apply specific constraints to the computationally generated diagrams; the integration of the algorithms as a plug-in for a CAD environment (Grasshopper3D of Rhino3D). The main features of the proposed framework are highlighted with a design case study developed using the newly introduced CAD plug-in (namely the VGS-tool). This plugin uses synthetic-oriented and intuitive graphical representation to allow the user to design spatial structures in equilibrium as three-dimensional trusses. The goal is to facilitate collaboration between structural engineers and architects during the conceptual phase of the design process.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"171 ","pages":"Article 103695"},"PeriodicalIF":4.3,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139956210","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
Homotopy Based Skinning of Spheres 基于同调的球体蒙皮技术
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-02-17 DOI: 10.1016/j.cad.2024.103686
Marián Fabian, Pavel Chalmovianský, Martina Bátorová

This paper deals with surfaces covering a set of spheres, whose centers form polyhedra. We propose novel methods of skinning based on homotopic deformation for the considered case. A method starts with a regular surface with a simple construction which can be deformed in a many ways. We demonstrate some of them in a few examples. The method is compared to the existing solutions by the new approach implementation and the visualization of the obtained results.

本文讨论的是覆盖一组球面的曲面,这些球面的中心构成多面体。我们针对所考虑的情况,提出了基于同位变形的新型蒙皮方法。该方法从结构简单的规则曲面开始,可以通过多种方式对其进行变形。我们在几个例子中演示了其中的一些方法。通过新方法的实施和所获结果的可视化,我们将该方法与现有解决方案进行了比较。
{"title":"Homotopy Based Skinning of Spheres","authors":"Marián Fabian,&nbsp;Pavel Chalmovianský,&nbsp;Martina Bátorová","doi":"10.1016/j.cad.2024.103686","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103686","url":null,"abstract":"<div><p>This paper deals with surfaces covering a set of spheres, whose centers form polyhedra. We propose novel methods of skinning based on homotopic deformation for the considered case. A method starts with a regular surface with a simple construction which can be deformed in a many ways. We demonstrate some of them in a few examples. The method is compared to the existing solutions by the new approach implementation and the visualization of the obtained results.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"170 ","pages":"Article 103686"},"PeriodicalIF":4.3,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448524000137/pdfft?md5=8a10d41ad4d81b9aa8d4f06921111f99&pid=1-s2.0-S0010448524000137-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139907355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Computer-Aided Design
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1