Spherical Gaussian‐based Lightcuts for Glossy Interreflections
It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gat...
Gespeichert in:
Veröffentlicht in: | Computer graphics forum 2020-09, Vol.39 (6), p.192-203 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 203 |
---|---|
container_issue | 6 |
container_start_page | 192 |
container_title | Computer graphics forum |
container_volume | 39 |
creator | Huo, Y.C. Jin, S.H. Liu, T. Hua, W. Wang, R. Bao, H.J. |
description | It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.
It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method. |
doi_str_mv | 10.1111/cgf.14011 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2444118265</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2444118265</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2971-ff1330bc12009877cf1c424565c779d430e637fef537c687aa7b951fd0ce19343</originalsourceid><addsrcrecordid>eNp1kL9OwzAQhy0EEqUw8AaRmBjS3sX_kg1U0VCpEgMwW65rt6lCUuxEqBuP0GfkSTCElVvuhu_ufvoIuUaYYKyp2bgJMkA8ISNkQqa54MUpGQHGWQLn5-QihB0AMCn4iNw977fWV0bXSan7ECrdfH0eVzrYdbKsNtvO9F1IXOuTsm5DOCSLprPeW1db01VtEy7JmdN1sFd_fUxe5w8vs8d0-VQuZvfL1GSFxNQ5pBRWBjOAIpfSODQsY1xwI2WxZhSsoNJZx6k0Ipday1XB0a3BWCwoo2NyM9zd-_a9t6FTu7b3TXypMsYYYp4JHqnbgTI-po0x1d5Xb9ofFIL6EaSiIPUrKLLTgf2oanv4H1Szcj5sfANxjWbo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2444118265</pqid></control><display><type>article</type><title>Spherical Gaussian‐based Lightcuts for Glossy Interreflections</title><source>Wiley Online Library Journals Frontfile Complete</source><source>Business Source Complete</source><creator>Huo, Y.C. ; Jin, S.H. ; Liu, T. ; Hua, W. ; Wang, R. ; Bao, H.J.</creator><creatorcontrib>Huo, Y.C. ; Jin, S.H. ; Liu, T. ; Hua, W. ; Wang, R. ; Bao, H.J.</creatorcontrib><description>It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.
It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.</description><identifier>ISSN: 0167-7055</identifier><identifier>EISSN: 1467-8659</identifier><identifier>DOI: 10.1111/cgf.14011</identifier><language>eng</language><publisher>Oxford: Blackwell Publishing Ltd</publisher><subject>Adaptive algorithms ; global illumination ; Hierarchies ; Pixels ; ray tracing ; rendering</subject><ispartof>Computer graphics forum, 2020-09, Vol.39 (6), p.192-203</ispartof><rights>2020 The Authors Computer Graphics Forum © 2020 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd</rights><rights>2020 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2971-ff1330bc12009877cf1c424565c779d430e637fef537c687aa7b951fd0ce19343</citedby><cites>FETCH-LOGICAL-c2971-ff1330bc12009877cf1c424565c779d430e637fef537c687aa7b951fd0ce19343</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fcgf.14011$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fcgf.14011$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Huo, Y.C.</creatorcontrib><creatorcontrib>Jin, S.H.</creatorcontrib><creatorcontrib>Liu, T.</creatorcontrib><creatorcontrib>Hua, W.</creatorcontrib><creatorcontrib>Wang, R.</creatorcontrib><creatorcontrib>Bao, H.J.</creatorcontrib><title>Spherical Gaussian‐based Lightcuts for Glossy Interreflections</title><title>Computer graphics forum</title><description>It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.
It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.</description><subject>Adaptive algorithms</subject><subject>global illumination</subject><subject>Hierarchies</subject><subject>Pixels</subject><subject>ray tracing</subject><subject>rendering</subject><issn>0167-7055</issn><issn>1467-8659</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp1kL9OwzAQhy0EEqUw8AaRmBjS3sX_kg1U0VCpEgMwW65rt6lCUuxEqBuP0GfkSTCElVvuhu_ufvoIuUaYYKyp2bgJMkA8ISNkQqa54MUpGQHGWQLn5-QihB0AMCn4iNw977fWV0bXSan7ECrdfH0eVzrYdbKsNtvO9F1IXOuTsm5DOCSLprPeW1db01VtEy7JmdN1sFd_fUxe5w8vs8d0-VQuZvfL1GSFxNQ5pBRWBjOAIpfSODQsY1xwI2WxZhSsoNJZx6k0Ipday1XB0a3BWCwoo2NyM9zd-_a9t6FTu7b3TXypMsYYYp4JHqnbgTI-po0x1d5Xb9ofFIL6EaSiIPUrKLLTgf2oanv4H1Szcj5sfANxjWbo</recordid><startdate>202009</startdate><enddate>202009</enddate><creator>Huo, Y.C.</creator><creator>Jin, S.H.</creator><creator>Liu, T.</creator><creator>Hua, W.</creator><creator>Wang, R.</creator><creator>Bao, H.J.</creator><general>Blackwell Publishing Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>202009</creationdate><title>Spherical Gaussian‐based Lightcuts for Glossy Interreflections</title><author>Huo, Y.C. ; Jin, S.H. ; Liu, T. ; Hua, W. ; Wang, R. ; Bao, H.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2971-ff1330bc12009877cf1c424565c779d430e637fef537c687aa7b951fd0ce19343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Adaptive algorithms</topic><topic>global illumination</topic><topic>Hierarchies</topic><topic>Pixels</topic><topic>ray tracing</topic><topic>rendering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huo, Y.C.</creatorcontrib><creatorcontrib>Jin, S.H.</creatorcontrib><creatorcontrib>Liu, T.</creatorcontrib><creatorcontrib>Hua, W.</creatorcontrib><creatorcontrib>Wang, R.</creatorcontrib><creatorcontrib>Bao, H.J.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer graphics forum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huo, Y.C.</au><au>Jin, S.H.</au><au>Liu, T.</au><au>Hua, W.</au><au>Wang, R.</au><au>Bao, H.J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Spherical Gaussian‐based Lightcuts for Glossy Interreflections</atitle><jtitle>Computer graphics forum</jtitle><date>2020-09</date><risdate>2020</risdate><volume>39</volume><issue>6</issue><spage>192</spage><epage>203</epage><pages>192-203</pages><issn>0167-7055</issn><eissn>1467-8659</eissn><abstract>It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.
It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.</abstract><cop>Oxford</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/cgf.14011</doi><tpages>12</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0167-7055 |
ispartof | Computer graphics forum, 2020-09, Vol.39 (6), p.192-203 |
issn | 0167-7055 1467-8659 |
language | eng |
recordid | cdi_proquest_journals_2444118265 |
source | Wiley Online Library Journals Frontfile Complete; Business Source Complete |
subjects | Adaptive algorithms global illumination Hierarchies Pixels ray tracing rendering |
title | Spherical Gaussian‐based Lightcuts for Glossy Interreflections |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T11%3A56%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Spherical%20Gaussian%E2%80%90based%20Lightcuts%20for%20Glossy%20Interreflections&rft.jtitle=Computer%20graphics%20forum&rft.au=Huo,%20Y.C.&rft.date=2020-09&rft.volume=39&rft.issue=6&rft.spage=192&rft.epage=203&rft.pages=192-203&rft.issn=0167-7055&rft.eissn=1467-8659&rft_id=info:doi/10.1111/cgf.14011&rft_dat=%3Cproquest_cross%3E2444118265%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2444118265&rft_id=info:pmid/&rfr_iscdi=true |