.png){kind=icon}
返回
Guided visibility sampling
.png){kind=icon}
PRE
AI
DOI：10.1145/1141911.1141914.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of computing the triangles visible from a region in space. The proposed aggressive visibility solution is based on stochastic ray shooting and can take any triangular model as input. We do not rely on connectivity information, volumetric occluders, or the availability of large occluders, and can therefore process any given input scene. The proposed algorithm is practically memoryless, thereby alleviating the large memory consumption problems prevalent in several previous algorithms. The strategy of our algorithm is to use ray mutations in ray space to cast rays that are likely to sample new triangles. Our algorithm improves the sampling efficiency of previous work by over two orders of magnitude.
Keyword:
visibility
occlusion culling
PVS
visibility sampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
暂无机构信息
引用论文
Erythropoietin Decreases the Occurrence of Myocardial Fibrosis by Inhibiting the NADPH-ERK-NF-κB Pathway.png)
Cardiology
OAAI
CardiologyIF0
OAAI分享收藏分享收藏
查看更多内容