A New Triangle Mesh Simplification Method with Sharp Feature

Zhuo Shi, Kong Qian, Ke Yu, Xiaonan Luo
{"title":"A New Triangle Mesh Simplification Method with Sharp Feature","authors":"Zhuo Shi, Kong Qian, Ke Yu, Xiaonan Luo","doi":"10.1109/ICDH.2018.00063","DOIUrl":null,"url":null,"abstract":"In this paper, a mesh simplification method with Sharp Feature based on a reverse interpolation loop subdivision (RILSP) 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. RILSP performs the loss-less and reversible simplification and reconstruction for the vertex compensation in reconstruction process. Compared to Luo's Reverse Butterfly Subdivision Process (RBSP), RILSP cancels the offsets compensation of even vertex in the update process of vertexes, and significantly increased speed of mesh simplification. Compared to Luo's Reverse Loop Subdivision Process (RLSP), RILSP's vertex offset error is obviously less. It faithfully resembles the shape of the original mesh well due to it considers more control vertexes (its mask of regular vertex concludes 14 vertexes). The experiments show that RILSP with sharp feature detection and implementation gets the better mesh quality and low offset compensation compared to above others simplification methods. In addition, in future, it can be applied to the large-scale point cloud model simplification and other fields.","PeriodicalId":117854,"journal":{"name":"2018 7th International Conference on Digital Home (ICDH)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th International Conference on Digital Home (ICDH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDH.2018.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, a mesh simplification method with Sharp Feature based on a reverse interpolation loop subdivision (RILSP) 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. RILSP performs the loss-less and reversible simplification and reconstruction for the vertex compensation in reconstruction process. Compared to Luo's Reverse Butterfly Subdivision Process (RBSP), RILSP cancels the offsets compensation of even vertex in the update process of vertexes, and significantly increased speed of mesh simplification. Compared to Luo's Reverse Loop Subdivision Process (RLSP), RILSP's vertex offset error is obviously less. It faithfully resembles the shape of the original mesh well due to it considers more control vertexes (its mask of regular vertex concludes 14 vertexes). The experiments show that RILSP with sharp feature detection and implementation gets the better mesh quality and low offset compensation compared to above others simplification methods. In addition, in future, it can be applied to the large-scale point cloud model simplification and other fields.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的带有尖锐特征的三角网格简化方法
提出了一种基于逆插值环细分(RILSP)的锐特征网格化简方法。结合改进的蝴蝶细分中异常顶点的处理,扩展了环路细分掩模,从而将传统的环路细分算法改进为插值细分。利用插值环细分的逆操作,简化了复杂的三维网格;渐进网格是由初始网格和一系列顶点偏移生成的。该算法减少了正则点相对逆蝶细分的补偿运算,大大减少了简化和重构。同样,反向蝴蝶细分算法通过考虑更多的控制顶点,减少了常规的点补偿操作,与现有的反向环路细分相比,大大减少了简化和重构。此外,通过牺牲少量的时间来计算较小的顶点偏移量来补偿边缘点相对于中心点的偏移量,该方法具有高传输速度和低偏移量的优点。对重构过程中的顶点补偿进行无损可逆的简化和重构。与Luo的反向蝴蝶细分过程(Reverse Butterfly Subdivision Process, RBSP)相比,RILSP在顶点更新过程中取消了偶顶点的偏移补偿,显著提高了网格化简速度。与Luo的逆环细分过程(RLSP)相比,RILSP的顶点偏移误差明显减小。由于它考虑了更多的控制顶点(它的规则顶点掩码共有14个顶点),它忠实地类似于原始网格的形状。实验表明,与上述几种简化方法相比,采用锐利特征检测和实现的RILSP方法获得了更好的网格质量和较低的偏移补偿。此外,在未来,它还可以应用于大规模点云模型简化等领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Weighted Deformable Part Model for Object Detection A Wifi Positioning Method Based on Stack Auto Encoder Design and Implementation of Web-Based Dynamic Mathematics Intelligence Education Platform Domain Knowledge Driven Deep Unrolling for Rain Removal from Single Image A New Image Block Encryption Method Based on Chaotic Map and DNA Encoding
×
引用
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