Clustered deferred and forward shading

Ola Olsson, M. Billeter, Ulf Assarsson
{"title":"Clustered deferred and forward shading","authors":"Ola Olsson, M. Billeter, Ulf Assarsson","doi":"10.2312/EGGH/HPG12/087-096","DOIUrl":null,"url":null,"abstract":"This paper presents and investigates Clustered Shading for deferred and forward rendering. In Clustered Shading, view samples with similar properties (e.g. 3D-position and/or normal) are grouped into clusters. This is comparable to tiled shading, where view samples are grouped into tiles based on 2D-position only. We show that Clustered Shading creates a better mapping of light sources to view samples than tiled shading, resulting in a significant reduction of lighting computations during shading. Additionally, Clustered Shading enables using normal information to perform per-cluster back-face culling of lights, again reducing the number of lighting computations. We also show that Clustered Shading not only outperforms tiled shading in many scenes, but also exhibits better worst case behaviour under tricky conditions (e.g. when looking at high-frequency geometry with large discontinuities in depth). Additionally, Clustered Shading enables real-time scenes with two to three orders of magnitudes more lights than previously feasible (up to around one million light sources).","PeriodicalId":294868,"journal":{"name":"EGGH-HPG'12","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"57","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EGGH-HPG'12","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/EGGH/HPG12/087-096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 57

Abstract

This paper presents and investigates Clustered Shading for deferred and forward rendering. In Clustered Shading, view samples with similar properties (e.g. 3D-position and/or normal) are grouped into clusters. This is comparable to tiled shading, where view samples are grouped into tiles based on 2D-position only. We show that Clustered Shading creates a better mapping of light sources to view samples than tiled shading, resulting in a significant reduction of lighting computations during shading. Additionally, Clustered Shading enables using normal information to perform per-cluster back-face culling of lights, again reducing the number of lighting computations. We also show that Clustered Shading not only outperforms tiled shading in many scenes, but also exhibits better worst case behaviour under tricky conditions (e.g. when looking at high-frequency geometry with large discontinuities in depth). Additionally, Clustered Shading enables real-time scenes with two to three orders of magnitudes more lights than previously feasible (up to around one million light sources).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
集群延迟和向前阴影
本文提出并研究了延迟渲染和前向渲染的聚类阴影。在聚类着色中,具有相似属性(例如3d位置和/或正常)的视图样本被分组到聚类中。这与平铺阴影相当,其中视图样本仅基于2d位置分组到平铺阴影中。我们表明,集群阴影创建了一个更好的光源映射,以查看样本比平铺阴影,导致在阴影期间照明计算显著减少。此外,集群阴影允许使用正常信息来执行每个集群的背面灯光剔除,再次减少照明计算的数量。我们还表明,聚类着色不仅在许多场景中优于平铺着色,而且在棘手的条件下也表现出更好的最差情况行为(例如,当观察具有深度大不连续的高频几何形状时)。此外,集群阴影使实时场景具有比以前可行的多两到三个数量级的光(多达100万个光源)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithm and VLSI architecture for real-time 1080p60 video retargeting Maximizing parallelism in the construction of BVHs, octrees, and k-d trees kANN on the GPU with shifted sorting Reducing aliasing artifacts through resampling Design and novel uses of higher-dimensional rasterization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1