A MultiresolutionPoint Rendering Systemfor Large Meshes.pptVIP

下载本文档

7
0
约5.51千字
约 29页
2017-03-25 发布于上海
举报
版权申诉

A MultiresolutionPoint Rendering Systemfor Large Meshes.ppt

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

A MultiresolutionPoint Rendering Systemfor Large Meshes

A MultiresolutionPoint Rendering Systemfor Large Meshes Szymon RusinkiewiczMarc Levoy Stanford University Goals Sample Renderings of a127-million-sample Model Goals An interactive viewer for large models(108 – 109 samples) Fast startup and progressive loading Maintains interactive frame rate Compact data structure Fast preprocessing Previous Systems forRendering Large Models Level of detail control in architectural walkthrough, terrain rendering systems [Funkhouser 93, Duchaineau 97] Progressive meshes [Hoppe 96, Hoppe 97] These systems often have expensive data structures or high preprocessing costs Outline Data structure: bounding sphere hierarchy Rendering algorithm: traverse tree and splat Point rendering: when is it appropriate? QSplat Data Structure Key observation: a single bounding sphere hierarchy can be used for Hierarchical frustum and backface culling Level of detail control Splat rendering [Westover 89] Creating the Data Structure Start with a triangle mesh produced by aligning and integrating scans [Curless 96] Creating the Data Structure Place a sphere at each node, large enough to touch neighbor spheres Creating the Data Structure Build up hierarchy QSplat Node Structure QSplat Node Structure Position and radius encoded relative to parent node Hierarchical coding vs. delta coding along a path for vertex positions QSplat Node Structure QSplat Node Structure QSplat Node Structure QSplat Node Structure Number of children (0, 2, 3, or 4) – 2 bits Presence of grandchildren – 1 bit QSplat Node Structure Normal quantized to gridon faces of a cube QSplat Node Structure Each node contains bounding cone ofchildren’s normals Hierarchical backface culling [Kumar 96] QSplat Node Structure QSplat Node Structure Per-vertex color is quantized 5-6-5 (R-G-B) QSplat Rendering Algorithm Traverse hierarchy recursively Frame Rate Control Feedback-driven frame rate control During motion: adjust recursion threshold based on time to render previous frame On mouse up: