【24h】

A Method of Visibility Preprocessing for Urban Walkthrough

机译:城市演练的可见性预处理方法

获取原文

摘要

In the scope of rendering complex models with high depth complexity, it is of great importance to design output-sensitive algorithms, i.e., algorithms with the time complexity proportional to the number of visible graphic primitives in the resulting image. In this paper an algorithm allowing efficient culling of the invisible portion of the rendered model is presented. Our main contributions are presenting a new data structure named occlusion binary tree(OBT) to represent the set of occluders of a given viewpoint and the algorithm for constructing occlusion volumes based on the OBT. The advantages of the OBT are that it is favor of constructing the occlusion fusion and exploiting temporal coherence. In our algorithm, quadtree is also used for organizing the whole scene and accelerating visibility determination. Our algorithm is well-suited for complex models where large occluders are present.
机译:在具有高深度复杂度的复杂模型的范围内,设计输出敏感算法,即具有与所得图像中的可见图形基元数成比例的时间复杂性的算法非常重要。在本文中,呈现了一种允许有效剔除渲染模型的不可见部分的算法。我们的主要贡献正在呈现一个名为遮挡二叉树(Obs)的新数据结构,以表示给定视点的一组封闭仪和基于机构构建遮挡卷的算法。该措施的优点是它有利于构建闭塞融合和利用时间相干性。在我们的算法中,Quadtree还用于组织整个场景并加速可见性确定。我们的算法非常适合于存在大型封闭仪的复杂模型。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号