Triangular mesh simplification using an adaptive subdivision

E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia
{"title":"Triangular mesh simplification using an adaptive subdivision","authors":"E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia","doi":"10.1109/ISSCS.2013.6651257","DOIUrl":null,"url":null,"abstract":"In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Signals, Circuits and Systems ISSCS2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2013.6651257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.
使用自适应细分的三角网格简化
在本文中,我们提出了一种三角网格简化算法,它可以产生原始模型的精确近似值。采用迭代边收缩实现简化。通过对称误差度量和在简化网格上生成样本点来获得精度。样本点是使用每个三角形的迭代1:4细分来生成的。每个三角形的细分数量取决于三角形的面积。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
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学术官方微信