Mesh Simplification Method Based on Reverse Interpolation Loop Subdivision

Zhuo Shi, Y. An, Songhua Xu, Zhongshuai Wang, K. Yu, Xiaonan Luo
{"title":"Mesh Simplification Method Based on Reverse Interpolation Loop Subdivision","authors":"Zhuo Shi, Y. An, Songhua Xu, Zhongshuai Wang, K. Yu, Xiaonan Luo","doi":"10.1145/3036331.3036356","DOIUrl":null,"url":null,"abstract":"In this paper, a mesh simplification method based on a reverse interpolation loop subdivision is proposed. Combined with the treatment of extraordinary vertex in the improved butterfly subdivision, the loop subdivision mask is expanded, thereby improving the traditional loop subdivision algorithm into interpolation subdivision. The reverse operation of the interpolation loop subdivision is used to simplify the complex 3D mesh; a progressive mesh is generated by an initial mesh and a series of vertex offsets. The algorithm reduces the regular point relative reverse butterfly subdivision of compensation operation and greatly reduces simplification and reconstruction. Likewise, the reverse butterfly subdivision algorithm reduces the regular point compensation operation and greatly reduces simplification and reconstruction compared with the existing reverse loop subdivision by considering more control vertices. Furthermore, the edge point with respect to the center point is compensated by sacrificing a small amount of time to calculate the smaller vertex offset, this method gives high transmission speed and low offset. In addition, in future, it can be applied to the large-scale point cloud model simplification and other fields.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"24 1","pages":"141-145"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3036331.3036356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, a mesh simplification method based on a reverse interpolation loop subdivision is proposed. Combined with the treatment of extraordinary vertex in the improved butterfly subdivision, the loop subdivision mask is expanded, thereby improving the traditional loop subdivision algorithm into interpolation subdivision. The reverse operation of the interpolation loop subdivision is used to simplify the complex 3D mesh; a progressive mesh is generated by an initial mesh and a series of vertex offsets. The algorithm reduces the regular point relative reverse butterfly subdivision of compensation operation and greatly reduces simplification and reconstruction. Likewise, the reverse butterfly subdivision algorithm reduces the regular point compensation operation and greatly reduces simplification and reconstruction compared with the existing reverse loop subdivision by considering more control vertices. Furthermore, the edge point with respect to the center point is compensated by sacrificing a small amount of time to calculate the smaller vertex offset, this method gives high transmission speed and low offset. In addition, in future, it can be applied to the large-scale point cloud model simplification and other fields.
基于逆插值环细分的网格简化方法
提出了一种基于逆插值环细分的网格化简方法。结合改进的蝴蝶细分中异常顶点的处理,扩展了环路细分掩模,从而将传统的环路细分算法改进为插值细分。利用插值环细分的逆操作,简化了复杂的三维网格;渐进网格是由初始网格和一系列顶点偏移生成的。该算法减少了正则点相对逆蝶细分的补偿运算,大大减少了简化和重构。同样,反向蝴蝶细分算法通过考虑更多的控制顶点,减少了常规的点补偿操作,与现有的反向环路细分相比,大大减少了简化和重构。此外,通过牺牲少量的时间来计算较小的顶点偏移量来补偿边缘点相对于中心点的偏移量,该方法具有高传输速度和低偏移量的优点。此外,在未来,它还可以应用于大规模点云模型简化等领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信