NURBS曲面的拟各向同性初始三角剖分

IF 1.5 Q3 MECHANICS
Daniel Herrero Adan, R. Cardoso
{"title":"NURBS曲面的拟各向同性初始三角剖分","authors":"Daniel Herrero Adan, R. Cardoso","doi":"10.13052/EJCM2642-2085.2912","DOIUrl":null,"url":null,"abstract":"Isotropic triangulation of NURBS surfaces provides high quality triangular meshes, where all triangles are equilateral. This isotropy increases representation quality and analysis accuracy. We introduce a new algorithm to generate quasi-isotropic triangulation on NURBS surfaces at once, with no prior meshing. The procedure consists of one front made of vertexes that advances in a divergence manner avoiding front collision. Vertexes are calculated by intersecting arcs whose radius is estimated by trapezoidal rule integration of directional derivatives. The parameter space is discretized in partitions such that the error of trapezoidal rule is controlled efficiently. A new space, called pattern space, is used to infer the direction of the arcs’ intersection. Derivatives, whose analytical computation is expensive, are estimated by NURBS surface fitting procedures, which increases the speed of the process. The resultant algorithm is robust and efficient. The mesh achieved possesses most of the triangles equilateral and with high uniformity of sizes. The performance is evaluated by measuring angles, vertex valences and size uniformity in different numerical examples.","PeriodicalId":45463,"journal":{"name":"European Journal of Computational Mechanics","volume":"1 1","pages":"27–82-27–82"},"PeriodicalIF":1.5000,"publicationDate":"2020-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Quasi-Isotropic Initial Triangulation of NURBS Surfaces\",\"authors\":\"Daniel Herrero Adan, R. Cardoso\",\"doi\":\"10.13052/EJCM2642-2085.2912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Isotropic triangulation of NURBS surfaces provides high quality triangular meshes, where all triangles are equilateral. This isotropy increases representation quality and analysis accuracy. We introduce a new algorithm to generate quasi-isotropic triangulation on NURBS surfaces at once, with no prior meshing. The procedure consists of one front made of vertexes that advances in a divergence manner avoiding front collision. Vertexes are calculated by intersecting arcs whose radius is estimated by trapezoidal rule integration of directional derivatives. The parameter space is discretized in partitions such that the error of trapezoidal rule is controlled efficiently. A new space, called pattern space, is used to infer the direction of the arcs’ intersection. Derivatives, whose analytical computation is expensive, are estimated by NURBS surface fitting procedures, which increases the speed of the process. The resultant algorithm is robust and efficient. The mesh achieved possesses most of the triangles equilateral and with high uniformity of sizes. The performance is evaluated by measuring angles, vertex valences and size uniformity in different numerical examples.\",\"PeriodicalId\":45463,\"journal\":{\"name\":\"European Journal of Computational Mechanics\",\"volume\":\"1 1\",\"pages\":\"27–82-27–82\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2020-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Computational Mechanics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13052/EJCM2642-2085.2912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MECHANICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Computational Mechanics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/EJCM2642-2085.2912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MECHANICS","Score":null,"Total":0}
引用次数: 2

摘要

NURBS曲面的各向同性三角剖分提供了高质量的三角形网格,其中所有三角形都是等边的。这种各向同性提高了表示质量和分析精度。我们介绍了一种新的算法,在NURBS曲面上一次生成准各向同性三角剖分,无需事先进行网格划分。该程序包括一个由顶点组成的前部,该前部以发散的方式前进,以避免前部碰撞。顶点是通过相交弧来计算的,其半径是通过方向导数的梯形规则积分来估计的。通过对参数空间进行分区离散,有效地控制了梯形规则的误差。一个称为模式空间的新空间用于推断圆弧相交的方向。导数的分析计算是昂贵的,通过NURBS曲面拟合程序来估计,这提高了过程的速度。所得到的算法是稳健和高效的。所获得的网格具有大多数等边三角形,并且具有高度的尺寸均匀性。通过测量不同数值示例中的角度、顶点化合价和尺寸均匀性来评估性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Quasi-Isotropic Initial Triangulation of NURBS Surfaces
Isotropic triangulation of NURBS surfaces provides high quality triangular meshes, where all triangles are equilateral. This isotropy increases representation quality and analysis accuracy. We introduce a new algorithm to generate quasi-isotropic triangulation on NURBS surfaces at once, with no prior meshing. The procedure consists of one front made of vertexes that advances in a divergence manner avoiding front collision. Vertexes are calculated by intersecting arcs whose radius is estimated by trapezoidal rule integration of directional derivatives. The parameter space is discretized in partitions such that the error of trapezoidal rule is controlled efficiently. A new space, called pattern space, is used to infer the direction of the arcs’ intersection. Derivatives, whose analytical computation is expensive, are estimated by NURBS surface fitting procedures, which increases the speed of the process. The resultant algorithm is robust and efficient. The mesh achieved possesses most of the triangles equilateral and with high uniformity of sizes. The performance is evaluated by measuring angles, vertex valences and size uniformity in different numerical examples.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.70
自引率
8.30%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信