TRIANGULATION BY THE ADVANCED FRONT METHOD WITH SOME ADDITIONS

Temirbekov, Kanagatov, Tamabay
{"title":"TRIANGULATION BY THE ADVANCED FRONT METHOD WITH SOME ADDITIONS","authors":"Temirbekov, Kanagatov, Tamabay","doi":"10.32523/2306-6172-2023-11-1-147-162","DOIUrl":null,"url":null,"abstract":"The article describes an algorithm for constructing unstructured triangulation mesh using the advanced front method. The method of correcting errors of intersection of edges, which usually occurs while constructing triangular mesh, is presented. The errors and their correction are demonstrated in the form of diagrams. Also, in order to compare the parameters at certain nodes before and after changing the boundary of the elastic domain, the article considers the possibility of constructing an additional mesh when a certain part of the boundary of the domain changes in the direction of increase, while the original mesh in the remaining parts of the domain is not changed. The article contains the results of triangulation of certain examples in the form of diagrams. Taking into account that the triangulation code by the method of advanced front was not found in the open access, the approximate code of triangulation including the above methods was written in the Python programming language and posted on the Internet (the link is provided). The article includes a general description of the code. The matplotlib package was used to visualize the results.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32523/2306-6172-2023-11-1-147-162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The article describes an algorithm for constructing unstructured triangulation mesh using the advanced front method. The method of correcting errors of intersection of edges, which usually occurs while constructing triangular mesh, is presented. The errors and their correction are demonstrated in the form of diagrams. Also, in order to compare the parameters at certain nodes before and after changing the boundary of the elastic domain, the article considers the possibility of constructing an additional mesh when a certain part of the boundary of the domain changes in the direction of increase, while the original mesh in the remaining parts of the domain is not changed. The article contains the results of triangulation of certain examples in the form of diagrams. Taking into account that the triangulation code by the method of advanced front was not found in the open access, the approximate code of triangulation including the above methods was written in the Python programming language and posted on the Internet (the link is provided). The article includes a general description of the code. The matplotlib package was used to visualize the results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
采用先进的前沿法进行三角剖分,并进行了一些补充
本文介绍了一种利用先进前沿法构造非结构化三角网格的算法。提出了在构造三角形网格时经常出现的边相交误差的修正方法。用图表的形式说明了误差及其修正。此外,为了比较改变弹性域边界前后某些节点的参数,本文考虑了当区域边界的某一部分沿增加方向发生变化,而区域其余部分的原始网格不变时,构建额外网格的可能性。文章以图表的形式给出了某些实例的三角测量结果。考虑到先进前沿方法的三角测量代码在公开获取中找不到,用Python编程语言编写了包含上述方法的三角测量近似代码,并发布在互联网上(提供链接)。本文包括对代码的一般描述。使用matplotlib包将结果可视化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
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