Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes.pdf

Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes.pdf

  1. 1、本文档共12页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes

Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes Sungyul Choe, Minsu Ahn, and Seungyong Lee Dept. of Computer Science and Engineering Pohang University of Science and Technology (POSTECH) San 31, Hyoja-dong, Pohang, 790-784, Korea {ggalssam, atom, leesy}@postech.ac.kr Abstract. Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel fea- ture sensitive mesh chartification technique that can handle huge meshes with limited main memory. Our technique adapts the mesh chartification approach using Lloyd-Max quantization to out-of-core processing. While the previous approach updates chartification globally at each iteration of Lloyd-Max quantization, we propose a local update algorithm where only a part of the chartification is processed at a time. By repeating the local updates, we can obtain a chartification of a huge mesh that cannot fit into the main memory. We verify the accuracy of the serialized local updates by comparing the results with the global update approach. We demon- strate that our technique can successfully process huge meshes for appli- cations, such as mesh compression, shape approximation, and remeshing. 1 Introduction Recently large polygonal meshes acquired by 3D scanning devices have become widely available. Processing these large meshes may be difficult or even impos- sible with existing mesh processing tools running on a fixed-size main memory. To handle large meshes, out-of-core algorithms have been introduced, where the whole mesh is not loaded into the main memory at the same time. A simple but effective approach for out-of-core processing is to divide a huge mesh into several small pieces that can fit into the main memory. Then a mesh processing tool can be applied to each piece with a small memory footprint. Out-of-core algorithms based on mesh cutting or clustering have been proposed for mesh simplification [1, 2, 3] and mesh compression [4, 5]. Mesh pa

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档