德劳内四面体化的后优化

P. Maur, I. Kolingerová
{"title":"德劳内四面体化的后优化","authors":"P. Maur, I. Kolingerová","doi":"10.1109/SCCG.2001.945334","DOIUrl":null,"url":null,"abstract":"The paper brings results of post-optimization of Delaunay tetrahedrization. Delaunay triangulation is a very popular method to create 2D meshes, but in 3D its properties are not as good as in 2D and can be improved. For this improvement an already existing method was used: local transformations, so called flips, performed in order to improve different geometrical properties of tetrahedra and applied to the finished 3D Delaunay triangulation. We examined this method by using various criteria to compare their benefits and losses in the area of the tetrahedra shape or time demand. We found out that the greatest benefit comes from the so called compound criteria and from the criterion which minimizes the numbers of tetrahedra. Other criteria have no positive influence on mesh improvement, they rather degrade the quality of the Delaunay mesh. The question of time is not so important, because all criteria are fast enough (they take at most 10 percent of time needed to construct a Delaunay mesh).","PeriodicalId":331436,"journal":{"name":"Proceedings Spring Conference on Computer Graphics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Post-optimization of Delaunay tetrahedrization\",\"authors\":\"P. Maur, I. Kolingerová\",\"doi\":\"10.1109/SCCG.2001.945334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper brings results of post-optimization of Delaunay tetrahedrization. Delaunay triangulation is a very popular method to create 2D meshes, but in 3D its properties are not as good as in 2D and can be improved. For this improvement an already existing method was used: local transformations, so called flips, performed in order to improve different geometrical properties of tetrahedra and applied to the finished 3D Delaunay triangulation. We examined this method by using various criteria to compare their benefits and losses in the area of the tetrahedra shape or time demand. We found out that the greatest benefit comes from the so called compound criteria and from the criterion which minimizes the numbers of tetrahedra. Other criteria have no positive influence on mesh improvement, they rather degrade the quality of the Delaunay mesh. The question of time is not so important, because all criteria are fast enough (they take at most 10 percent of time needed to construct a Delaunay mesh).\",\"PeriodicalId\":331436,\"journal\":{\"name\":\"Proceedings Spring Conference on Computer Graphics\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Spring Conference on Computer Graphics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCG.2001.945334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Spring Conference on Computer Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCG.2001.945334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

给出了德劳内四面体化后优化的结果。Delaunay三角剖分是一种非常流行的创建2D网格的方法,但在3D中其属性不如在2D中那么好,并且可以改进。对于这种改进,我们使用了一种已经存在的方法:局部转换,即所谓的翻转,以改善四面体的不同几何特性,并将其应用于完成的3D Delaunay三角剖分。我们通过使用各种标准来比较其在四面体形状或时间需求方面的收益和损失来检查这种方法。我们发现最大的好处来自于所谓的复合标准和最小化四面体数量的标准。其他准则对网格改进没有积极影响,反而降低了Delaunay网格的质量。时间问题并不那么重要,因为所有的标准都足够快(它们最多只需要构建Delaunay网格所需时间的10%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Post-optimization of Delaunay tetrahedrization
The paper brings results of post-optimization of Delaunay tetrahedrization. Delaunay triangulation is a very popular method to create 2D meshes, but in 3D its properties are not as good as in 2D and can be improved. For this improvement an already existing method was used: local transformations, so called flips, performed in order to improve different geometrical properties of tetrahedra and applied to the finished 3D Delaunay triangulation. We examined this method by using various criteria to compare their benefits and losses in the area of the tetrahedra shape or time demand. We found out that the greatest benefit comes from the so called compound criteria and from the criterion which minimizes the numbers of tetrahedra. Other criteria have no positive influence on mesh improvement, they rather degrade the quality of the Delaunay mesh. The question of time is not so important, because all criteria are fast enough (they take at most 10 percent of time needed to construct a Delaunay mesh).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Some new challenging research topics in human animation High precision non-binary voxelization of geometric objects View-dependent information theory quality measures for pixel sampling and scene discretization in flatland A colour reindexing algorithm for lossless compression of digital images Parallel triangular mesh decimation without sorting
×
引用
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