基于蒙特卡罗算法的网格简化方法

Ce Ding, Lizhen Yang, Ruoming Zhang, Yuechen Zhao, Han Wang, Yuxuan Li, Hai Lin
{"title":"基于蒙特卡罗算法的网格简化方法","authors":"Ce Ding, Lizhen Yang, Ruoming Zhang, Yuechen Zhao, Han Wang, Yuxuan Li, Hai Lin","doi":"10.1109/PIERS59004.2023.10221527","DOIUrl":null,"url":null,"abstract":"In order to grasp the operation law of aluminum electrolytic cell, it is necessary to conduct coupling simulation of thermodynamic field and hydrodynamics field, and obtain a grid with dielectric constant parameters through a series of processing results. In electromagnetic computation, the calculation platform is unable to calculate if the mesh is too dense and the tetrahedral elements are not uniform, hence the mesh must be simplified. This work proposes a Monte Carlo stochastic algorithm-based method for mesh simplification as a solution to the problem that the number of mesh is high relative to the computing platform and their distribution across scales is uneven. The octree was used to evaluate the mesh density in the region, the deletion probability of vertices was calculated, and the reserved points were utilized to renew a set of mesh using the Delaunay triangulation method. The most essential aspect of the Monte-Carlo algorithm is determining the deletion probability of each point to ensure that the freshly created mesh is sparse and uniform. Example of hemisphere will then be provided to demonstrate the mesh simplification effect of this strategy. Compared to previous mesh simplification methods in terms of time cost, memory cost, and calculation results, the outcomes are comparable, and the time and space costs are drastically decreased. Compared to previous simplification methods for tetrahedral mesh, this method is straightforward and user-friendly, with a time complexity of O(N) (where N is the number of vertices) and a space complexity of O(N).","PeriodicalId":354610,"journal":{"name":"2023 Photonics & Electromagnetics Research Symposium (PIERS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mesh Simplification Method Based on Monte-Carlo Algorithm\",\"authors\":\"Ce Ding, Lizhen Yang, Ruoming Zhang, Yuechen Zhao, Han Wang, Yuxuan Li, Hai Lin\",\"doi\":\"10.1109/PIERS59004.2023.10221527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to grasp the operation law of aluminum electrolytic cell, it is necessary to conduct coupling simulation of thermodynamic field and hydrodynamics field, and obtain a grid with dielectric constant parameters through a series of processing results. In electromagnetic computation, the calculation platform is unable to calculate if the mesh is too dense and the tetrahedral elements are not uniform, hence the mesh must be simplified. This work proposes a Monte Carlo stochastic algorithm-based method for mesh simplification as a solution to the problem that the number of mesh is high relative to the computing platform and their distribution across scales is uneven. The octree was used to evaluate the mesh density in the region, the deletion probability of vertices was calculated, and the reserved points were utilized to renew a set of mesh using the Delaunay triangulation method. The most essential aspect of the Monte-Carlo algorithm is determining the deletion probability of each point to ensure that the freshly created mesh is sparse and uniform. Example of hemisphere will then be provided to demonstrate the mesh simplification effect of this strategy. Compared to previous mesh simplification methods in terms of time cost, memory cost, and calculation results, the outcomes are comparable, and the time and space costs are drastically decreased. Compared to previous simplification methods for tetrahedral mesh, this method is straightforward and user-friendly, with a time complexity of O(N) (where N is the number of vertices) and a space complexity of O(N).\",\"PeriodicalId\":354610,\"journal\":{\"name\":\"2023 Photonics & Electromagnetics Research Symposium (PIERS)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 Photonics & Electromagnetics Research Symposium (PIERS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIERS59004.2023.10221527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Photonics & Electromagnetics Research Symposium (PIERS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIERS59004.2023.10221527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了掌握铝电解槽的运行规律,需要对热力学场和流体力学场进行耦合模拟,并通过一系列处理结果得到具有介电常数参数的网格。在电磁计算中,如果网格过于密集,四面体单元不均匀,则计算平台无法进行计算,因此必须对网格进行简化。本文提出了一种基于蒙特卡罗随机算法的网格简化方法,以解决网格数量相对于计算平台较高且网格在尺度上分布不均匀的问题。利用八叉树评估区域内的网格密度,计算顶点的删除概率,利用Delaunay三角剖分方法利用保留点更新一组网格。蒙特卡罗算法最重要的方面是确定每个点的删除概率,以确保新创建的网格是稀疏和均匀的。然后以半球为例,演示该策略的网格简化效果。与以往的网格简化方法相比,在时间成本、内存成本和计算结果上具有可比性,大大降低了时间和空间成本。与以往的四面体网格化简方法相比,该方法简单易用,时间复杂度为O(N) (N为顶点数),空间复杂度为O(N)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mesh Simplification Method Based on Monte-Carlo Algorithm
In order to grasp the operation law of aluminum electrolytic cell, it is necessary to conduct coupling simulation of thermodynamic field and hydrodynamics field, and obtain a grid with dielectric constant parameters through a series of processing results. In electromagnetic computation, the calculation platform is unable to calculate if the mesh is too dense and the tetrahedral elements are not uniform, hence the mesh must be simplified. This work proposes a Monte Carlo stochastic algorithm-based method for mesh simplification as a solution to the problem that the number of mesh is high relative to the computing platform and their distribution across scales is uneven. The octree was used to evaluate the mesh density in the region, the deletion probability of vertices was calculated, and the reserved points were utilized to renew a set of mesh using the Delaunay triangulation method. The most essential aspect of the Monte-Carlo algorithm is determining the deletion probability of each point to ensure that the freshly created mesh is sparse and uniform. Example of hemisphere will then be provided to demonstrate the mesh simplification effect of this strategy. Compared to previous mesh simplification methods in terms of time cost, memory cost, and calculation results, the outcomes are comparable, and the time and space costs are drastically decreased. Compared to previous simplification methods for tetrahedral mesh, this method is straightforward and user-friendly, with a time complexity of O(N) (where N is the number of vertices) and a space complexity of O(N).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Calibration of Radar and Camera Images A Microwave Reflection-Based Measurement System for Moisture Detection in Textiles Design and Simulation of a Flood Forecasting and Alerting System: A Focus on Rwanda Localized Bessel Beams for Near-Field Focused Antenna Arrays in Biomedical Contexts Design and Analysis of a Compact Frequency Beam-scanning Leaky-wave Antenna Based on Slow-wave Half-mode Substrate Integrated Waveguide and Spoof Surface Plasmon Polaritons
×
引用
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