首页> 外文会议>Eurographics workshop on rendering techniques >Computing the Approximate Visibility Map, with Applications to Form Factors and Discontinuity Meshing
【24h】

Computing the Approximate Visibility Map, with Applications to Form Factors and Discontinuity Meshing

机译:计算近似可见性图,并将其应用于形状因数和不连续网格

获取原文

摘要

This paper describes a robust, hardware-accelerated algorithm to compute an approximate visibility map, which describes the visible scene from a particular viewpoint. The user can control the degree of approximation, choosing more accuracy at the cost of increased execution time. The algorithm exploits item buffer hardware to coarsely determine visibility, which is later refined. The paper also describes a conceptually simple algorithm to compute a subset of the discontinuity mesh using the visibility map.
机译:本文介绍了一种鲁棒的,硬件加速的算法,用于计算近似可见性图,该图描述了从特定视点看到的可见场景。用户可以控制近似度,以增加执行时间为代价选择更多精度。该算法利用项目缓冲区硬件来粗略确定可见性,然后对其进行完善。本文还描述了一种概念上简单的算法,可以使用可见性图来计算不连续网格的子集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号