Adaptive semi-regular remeshing: A Voronoi-based approach

Aymen Kammoun, F. Payan, M. Antonini
{"title":"Adaptive semi-regular remeshing: A Voronoi-based approach","authors":"Aymen Kammoun, F. Payan, M. Antonini","doi":"10.1109/MMSP.2010.5662045","DOIUrl":null,"url":null,"abstract":"We propose an adaptive semi-regular remeshing algorithm for surface meshes. Our algorithm uses Voronoi tessellations during both simplification and refinement stages. During simplification, the algorithm constructs a first centroidal Voronoi tessellation of the vertices of the input mesh. The sites of the Voronoi cells are the vertices of the base mesh of the semi-regular output. During refinement, the new vertices added at each resolution level by regular subdivision are considered as new Voronoi sites. We then use the Lloyd relaxation algorithm to update their position, and finally we obtain uniform semi-regular meshes. Our algorithm also enables adaptive remeshing by tuning a threshold based on the mass probability of the Voronoi sites added by subdivision. Experimentation shows that our technique produces semi-regular meshes of high quality, with significantly less triangles than state of the art techniques.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Workshop on Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2010.5662045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We propose an adaptive semi-regular remeshing algorithm for surface meshes. Our algorithm uses Voronoi tessellations during both simplification and refinement stages. During simplification, the algorithm constructs a first centroidal Voronoi tessellation of the vertices of the input mesh. The sites of the Voronoi cells are the vertices of the base mesh of the semi-regular output. During refinement, the new vertices added at each resolution level by regular subdivision are considered as new Voronoi sites. We then use the Lloyd relaxation algorithm to update their position, and finally we obtain uniform semi-regular meshes. Our algorithm also enables adaptive remeshing by tuning a threshold based on the mass probability of the Voronoi sites added by subdivision. Experimentation shows that our technique produces semi-regular meshes of high quality, with significantly less triangles than state of the art techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应半规则网格:基于voronoi的方法
提出了一种曲面网格的自适应半规则重划分算法。我们的算法在简化和细化阶段都使用了Voronoi镶嵌。在简化过程中,算法构建输入网格顶点的第一个质心Voronoi镶嵌。Voronoi细胞的位置是半规则输出的基本网格的顶点。在细化过程中,通过规则细分在每个分辨率级别上添加的新顶点被视为新的Voronoi站点。然后使用Lloyd松弛算法更新它们的位置,最后得到均匀的半规则网格。我们的算法还通过根据细分添加的Voronoi站点的质量概率调整阈值来实现自适应重网格划分。实验表明,我们的技术产生高质量的半规则网格,与最先进的技术相比,三角形明显减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Probabilistic framework for template-based chord recognition A comparative study between different pre-whitening decorrelation based acoustic feedback cancellers Efficient error control in 3D mesh coding An improved foresighted resource reciprocation strategy for multimedia streaming applications Fusion of active and passive sensors for fast 3D capture
×
引用
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