ABSTRACT Early-Split Coding of Triangle Mesh Connectivity.pdf

ABSTRACT Early-Split Coding of Triangle Mesh Connectivity.pdf

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

Early-Split Coding of Triangle Mesh Connectivity Martin Isenburg UC Berkeley isenburg@ Jack Snoeyink UNC Chapel Hill snoeyink@ ABSTRACT The two main schemes for coding triangle mesh connectivity tra- verse a mesh with similar region-growing operations. Rossignac’s Edgebreaker uses triangle labels to encode the traversal whereas the coder of Touma and Gotsman uses vertex degrees. Although both schemes are guided by the same spiraling spanning tree, they pro- cess triangles in a different order, making it difficult to understand their similarities and to explain their varying compression success. We describe a coding scheme that can operate like a label-based coder similar to Edgebreaker or like a degree-based coder similar to the TG coder. In either mode our coder processes vertices and triangles in the same order by performing the so-called “split op- erations” earlier than previous schemes. The main insights offered by this unified view are (a) that compression rates depend mainly on the choice of decoding strategy and less on whether labels or degrees are used and (b) how to do degree coding without storing “split” offsets. Furthermore we describe a new heuristic that allows the TG coder’s bit-rates to drop below the vertex degree entropy. CR Categories: I.3.5 [Computational Geometry and Object Mod- eling]: Boundary representations Keywords: Connectivity compression, label coding, degree cod- ing, split offsets, Edgebreaker, TG coder, Cut-border Machine. 1 INTRODUCTION A number of schemes for coding the connectivity of triangular meshes have been proposed [3, 11, 14]. All these schemes grow a region on the mesh by including triangle after triangle into a bound- ary and encode a sequence of symbols that documents this process. The Edgebreaker scheme [11] and the Cut-border Machine [3] are label-based approaches. They encode for each triangle how its in- clusion changes the boundary using one of five labels. The TG coder [14] is a degree-based approach. It only enco

文档评论(0)

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

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

1亿VIP精品文档

相关文档