Plane-Tree Low-Bitrate Mesh Compression

Luke Lincoln, R. González
{"title":"Plane-Tree Low-Bitrate Mesh Compression","authors":"Luke Lincoln, R. González","doi":"10.1109/DICTA.2015.7371295","DOIUrl":null,"url":null,"abstract":"In this paper we present a novel low-bitrate 3D model compression algorithm called the Plane-Tree. This algorithm is based on octree subdivision and stores a plane at each leaf node which better approximates the surface within the node. Quantitative evaluations show that this method is competitive with state of the art transform based methods and outperforms them at low-bitrates.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DICTA.2015.7371295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we present a novel low-bitrate 3D model compression algorithm called the Plane-Tree. This algorithm is based on octree subdivision and stores a plane at each leaf node which better approximates the surface within the node. Quantitative evaluations show that this method is competitive with state of the art transform based methods and outperforms them at low-bitrates.
平面树低比特率网格压缩
在本文中,我们提出了一种新的低比特率的三维模型压缩算法,称为平面树。该算法基于八叉树细分,在每个叶节点上存储一个更接近节点内表面的平面。定量评估表明,该方法与目前基于变换的方法具有竞争力,并且在低比特率下优于它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信