Abstract Fast and Effective Stripification of Polygonal Surface Models.pdfVIP

下载本文档

2
0
约4.88万字
约 9页
2017-04-06 发布于江苏
举报
版权申诉

Abstract Fast and Effective Stripification of Polygonal Surface Models.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Abstract Fast and Effective Stripification of Polygonal Surface Models

Fast and Effective Stripification of Polygonal Surface Models Xinyu Xiang Martin Held Joseph S. B. Mitchell Department of Applied Mathematics and Statistics State University of New York, Stony Brook, NY 11794-3600 Abstract A fundamental algorithmic problem in computer graphics is that of computing a succinct encoding of a triangulation of a polygonal sur- face model in order to be able to transmit and render it efficiently. The goal is to take a given polygonal surface model, whose facets are given by (possibly multiply-connected) polygons, triangulate its facets, and then decompose the triangulation into a small number of “tristrips,” each of which has its connectivity stored implicitly in the ordering of the data points. We develop methods that are effective in solving the stripification problem, both in theory (prov- ably good encodings) and in practice. Our methods are based on carefully constructed search trees in the dual graph, followed by al- gorithms to decompose dual trees into tristrips. One decomposition algorithm is provably optimal (based on dynamic programming), allowing us a sound basis of comparison among our other (heuris- tic) algorithms. We demonstrate the speed and effectiveness of our algorithms through a battery of experiments. In comparison with the recently released STRIPE system for stripification, we find that our stripifier, FTSG, produces comparable or better quality encod- ings, while requiring significantly less computing time on a large variety of datasets. Further, FTSG is carefully engineered and im- plemented to be robust, even in the face of highly degenerate and corrupted real-world data. CR Categories: I.3.3 [Computer Graphics]: Picture/Image Generation—displaying algorithms; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algo- rithm, languages, and systems. 1 Introduction We consider a problem of importance in graphics and visualization: computing a succinct encoding of a triangulation of