Measuring errors for massive triangle meshes

Anis Meftah, Arnaud Roquel, F. Payan, M. Antonini
{"title":"Measuring errors for massive triangle meshes","authors":"Anis Meftah, Arnaud Roquel, F. Payan, M. Antonini","doi":"10.1109/MMSP.2010.5662050","DOIUrl":null,"url":null,"abstract":"Our proposal is a method for computing the distance between two surfaces modeled by massive triangle meshes which can not be both loaded entirely in memory. The method consists in loading at each step a small part of the two meshes and computing the symmetrical distance for these areas. These areas are chosen in such a way as the orthogonal projection, used to compute this distance, have to be in it. For this, one of the two meshes is simplified and then a correspondence between the simplified mesh and the triangles of the input meshes is done. The experiments show that the proposed method is very efficient in terms of memory cost, while producing results comparable to the existent tools for the small and medium size meshes. Moreover, the proposed method enables us to compute the distance for massive meshes.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","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.5662050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Our proposal is a method for computing the distance between two surfaces modeled by massive triangle meshes which can not be both loaded entirely in memory. The method consists in loading at each step a small part of the two meshes and computing the symmetrical distance for these areas. These areas are chosen in such a way as the orthogonal projection, used to compute this distance, have to be in it. For this, one of the two meshes is simplified and then a correspondence between the simplified mesh and the triangles of the input meshes is done. The experiments show that the proposed method is very efficient in terms of memory cost, while producing results comparable to the existent tools for the small and medium size meshes. Moreover, the proposed method enables us to compute the distance for massive meshes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模三角形网格的测量误差
我们提出了一种计算两个表面之间的距离的方法,这些表面是由大量三角形网格建模的,它们不能全部加载到内存中。该方法包括在每一步加载两个网格的一小部分,并计算这些区域的对称距离。这些区域的选择方法是用正交投影,用来计算这个距离,必须在其中。为此,对两个网格中的一个进行简化,然后在简化网格和输入网格的三角形之间进行对应。实验表明,该方法在存储成本方面是非常有效的,并且在中小型网格上产生的结果与现有工具相当。此外,所提出的方法使我们能够计算大量网格的距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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