Fast Many-Lights Rendering with Temporal Shadow Maps

Boning Zhang; Nian Li; Lili Wang

doi:doi:10.11648/j.sd.20160401.18

| Peer-Reviewed

Fast Many-Lights Rendering with Temporal Shadow Maps

Boning Zhang, Nian Li, Lili Wang

Published in Science Discovery (Volume 4, Issue 1)

Received: 17 April 2016 Published: 18 April 2016

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

We present an effcient method for computing shadows of many light sources (e.g. 1,024). Our work is based on the observation that conventional shadow mapping becomes redundant as the number of lights increases. First, we sample the scene with a constant number of depth images (e.g. 10), which we call temporal shadow maps. Then the shadow map for each light is approximated through rendering triangles reconstructed from all the temporal shadow maps. The cost of rendering the triangles reconstructed from the temporal shadow maps is much smaller than rendering the entire scene when the geometry is complex. The algorithm supports fully dynamic scenes. The experiment results show that our method can produce comparable soft shadows with much higher speed than ray tracing and shadow mapping methods.

Published in	Science Discovery (Volume 4, Issue 1)
DOI	10.11648/j.sd.20160401.18
Page(s)	45-51
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2016. Published by Science Publishing Group

Keywords

Many Lights, Visibility, Shadow Mapping

References

[1]	WILLIAMS L. Casting curved shadows on curved surfaces[J]. Acm Siggraph Computer Graphics, 1978, 12(12):270–274.
[2]	WARD G J. Adaptive Shadow Testing for Ray Tracing[M].[S.l.]: Springer Berlin Heidelberg, 1991: 11–20.
[3]	ITSCHEL T, ENGELHARDT T, GROSCH T, et al. Micro-rendering for scalable, parallel final gathering[J]. Acm Transactions on Graphics, 2009, 28(5):89–97.
[4]	NICHOLS G, PENMATSA R, WYMAN C. Interactive, Multiresolution Image-Space Rendering for Dynamic Area Lighting[C]//Computer Graphics Forum..[S.l.]: [s.n.], 2010，29:1279–1288.
[5]	PAQUETTE E, POULIN P, DRETTAKIS G. A Light Hierarchy for Fast Rendering of Scenes with Many Lights[J]. Computer Graphics Forum, 1998, 17(3):63–74.
[6]	KRISTENSEN A W, AKENINE-M?LLER T, JENSEN H W. Precomputed local radiance transfer for real-time lighting design[J]. Acm Transactions on Graphics, 2005, 24(3):1208–1215.
[7]	WALTER B, FERNANDEZ S, ARBREE A, et al. Lightcuts: A Scalable Approach to Illumination[J]. Acm Transactions on Graphics, 2005, 24(3):págs. 1098–1107.
[8]	王光伟,谢国富,王文成.基于空间聚类增强lightcuts的光照计算[C]//第十一届中国虚拟现实大会(ICVRV2011). [S.l.]: [s.n.], 2011:2364–2370。
[9]	KERLUND O, UNGER M, WANG R. Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs.[C]//Conference on Computer Graphics & Applications.[S.l.]: [s.n.], 2007:161–170.
[10]	CHESLACK-POSTAVA E, WANG R, AKERLUND O, et al. Fast, realistic lighting and material design using nonlinear cut approximation.[J]. Acm Transactions on Graphics, 2008, 27(5):32–39.
[11]	WALTER B, KHUNGURN P, BALA K. Bidirectional lightcuts[J]. Acm Transactions on Graphics, 2012, 31(4):13–15.
[12]	WU Y T, CHUANG Y Y. VisibilityCluster: Average directional visibility for many-light rendering[J]. Visualization and Computer Graphics, IEEE Transactions on, 2013, 19(9):1566–1578.
[13]	RITSCHEL T, GROSCH T, KAUTZ J, et al. Interactive global illumination based on coherent surface shadow maps[C]//Graphics Interface..[S.l.]: [s.n.], 2008:87–96.
[14]	DONG Z, GROSCH T, RITSCHEL T, et al. Real-time Indirect Illumination with Clustered Visibility.[C]//VMV..[S.l.]: [s.n.], 2009:187–196.
[15]	RITSCHEL T, GROSCH T, KIM M H, et al. Imperfect shadow maps for efficient computation of indirect illumination[J]. Acm Transactions on Graphics, 2008, 27(5):32–39.
[16]	HOLLANDER M, RITSCHEL T, EISEMANN E, et al. ManyLoDs: Parallel Many-View Level-of-Detail Selection for Real-Time Global Illumination[C]//Computer Graphics Forum..[S.l.]: [s.n.], 2011:1233–1240.
[17]	OLA O, MARKUS B, ERIK S, et al. More Efficient Virtual Shadow Maps for Many Lights.[C]//Meeting of the ACM SIGGRAPH Symposium on Interactive 3d Graphics and Games..[S.l.]: [s.n.], 2014:701–713.
[18]	OLSSON O, SINTORN E, KÄMPE V, et al. Efficient virtual shadow maps for many lights[C]//Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games..[S.l.]: [s.n.], 2014:87–96.
[19]	HAŠAN M, PELLACINI F, BALA K. Matrix row-column sampling for the many-light problem[C]//ACM Transactions on Graphics (TOG).[S.l.]: [s.n.], 2007，26:26.
[20]	DAVIDOVIC T, KRIVÁNEK J, HAŠAN M, et al. Combining global and local virtual lights for detailed glossy illumination[C]//ACM Transactions on Graphics (TOG)..[S.l.]: [s.n.], 2010，29:143.
[21]	WANG R, HUO Y, YUAN Y, et al. GPU-based Out-of-Core Many-Lights Rendering[J]. Acm Transactions on Graphics, 2013, 32(6):2504–2507.
[22]	YANG T, HUI-ZHONG W, FU X, et al. Inverse image warping without searching[C]//International Conference on Control, Automation, Robotics and Vision..[S.l.]: [s.n.], 2004:386–390.
[23]	OLIVEIRA M M, BISHOP G, MCALLISTER D. Relief Texture Mapping[C]//Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques.2000.NewYork,NY,USA:ACM Press/Addison-Wesley Publishing Co., SIGGRAPH ’00, http://-dx.doi.org/¬10.1145/¬344779.344947.
[24]	FERIS R, RASKAR R, TAN K H, et al. Specular Reflection Reduction with Multi-Flash Imaging[C]//Proceedings of the Computer Graphics and Image Processing, XVII Brazilian Symposium. 2004. Washington, DC, USA: IEEE Computer Society, SIBGRAPI’04, http://¬dl.acm.org/-citation.cfm?id=1025131.1026268.
[25]	Ola O, Markus B, Erik S, et al. More Efficient Virtual Shadow Maps for Many Lights.[J]. Proceedings of the Acm Siggraph Symposium on Interactived Graphics & Games, 2015, 21(6):701-13.
[26]	Bárbara G M. Fiscal state aid: lights and shadowx in the 2013 commission decision on teh Sapnish tax lease system[J]. European Taxation, 2015, 55:págs. 69-77.
[27]	Pagano E, Sobrero S, Cavallero C, et al. Economic Considerations on the Follow-Up Practice in Gynecologic Cancers: Few Lights and Many Shadows From a Literature Review.[J]. International Journal of Gynecological Cancer, 2015, 25.
[28]	Addison D M, Stewart B. Nighttime Lights Revisited: The Use of Nighttime Lights Data as a Proxy for Economic Variables[J]. Social Science Electronic Publishing, 2015, 53(1):86-87.

Cite This Article

Plain Text BibTeX RIS

APA Style

Boning Zhang, Nian Li, Lili Wang. (2016). Fast Many-Lights Rendering with Temporal Shadow Maps. Science Discovery, 4(1), 45-51. https://doi.org/10.11648/j.sd.20160401.18

Copy | Download

ACS Style

Boning Zhang; Nian Li; Lili Wang. Fast Many-Lights Rendering with Temporal Shadow Maps. Sci. Discov. 2016, 4(1), 45-51. doi: 10.11648/j.sd.20160401.18

Copy | Download

AMA Style

Boning Zhang, Nian Li, Lili Wang. Fast Many-Lights Rendering with Temporal Shadow Maps. Sci Discov. 2016;4(1):45-51. doi: 10.11648/j.sd.20160401.18

Copy | Download

@article{10.11648/j.sd.20160401.18,
  author = {Boning Zhang and Nian Li and Lili Wang},
  title = {Fast Many-Lights Rendering with Temporal Shadow Maps},
  journal = {Science Discovery},
  volume = {4},
  number = {1},
  pages = {45-51},
  doi = {10.11648/j.sd.20160401.18},
  url = {https://doi.org/10.11648/j.sd.20160401.18},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sd.20160401.18},
  abstract = {We present an effcient method for computing shadows of many light sources (e.g. 1,024). Our work is based on the observation that conventional shadow mapping becomes redundant as the number of lights increases. First, we sample the scene with a constant number of depth images (e.g. 10), which we call temporal shadow maps. Then the shadow map for each light is approximated through rendering triangles reconstructed from all the temporal shadow maps. The cost of rendering the triangles reconstructed from the temporal shadow maps is much smaller than rendering the entire scene when the geometry is complex. The algorithm supports fully dynamic scenes. The experiment results show that our method can produce comparable soft shadows with much higher speed than ray tracing and shadow mapping methods.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Fast Many-Lights Rendering with Temporal Shadow Maps
AU  - Boning Zhang
AU  - Nian Li
AU  - Lili Wang
Y1  - 2016/04/18
PY  - 2016
N1  - https://doi.org/10.11648/j.sd.20160401.18
DO  - 10.11648/j.sd.20160401.18
T2  - Science Discovery
JF  - Science Discovery
JO  - Science Discovery
SP  - 45
EP  - 51
PB  - Science Publishing Group
SN  - 2331-0650
UR  - https://doi.org/10.11648/j.sd.20160401.18
AB  - We present an effcient method for computing shadows of many light sources (e.g. 1,024). Our work is based on the observation that conventional shadow mapping becomes redundant as the number of lights increases. First, we sample the scene with a constant number of depth images (e.g. 10), which we call temporal shadow maps. Then the shadow map for each light is approximated through rendering triangles reconstructed from all the temporal shadow maps. The cost of rendering the triangles reconstructed from the temporal shadow maps is much smaller than rendering the entire scene when the geometry is complex. The algorithm supports fully dynamic scenes. The experiment results show that our method can produce comparable soft shadows with much higher speed than ray tracing and shadow mapping methods.
VL  - 4
IS  - 1
ER  -

Copy | Download

Author Information

Boning Zhang

School of Computer Science and Engineering, Beihang University, Beijing, China
Nian Li

School of Computer Science and Engineering, Beihang University, Beijing, China
Lili Wang

School of Computer Science and Engineering, Beihang University, Beijing, China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Boning Zhang, Nian Li, Lili Wang. (2016). Fast Many-Lights Rendering with Temporal Shadow Maps. Science Discovery, 4(1), 45-51. https://doi.org/10.11648/j.sd.20160401.18

Copy | Download

ACS Style

Boning Zhang; Nian Li; Lili Wang. Fast Many-Lights Rendering with Temporal Shadow Maps. Sci. Discov. 2016, 4(1), 45-51. doi: 10.11648/j.sd.20160401.18

Copy | Download

AMA Style

Boning Zhang, Nian Li, Lili Wang. Fast Many-Lights Rendering with Temporal Shadow Maps. Sci Discov. 2016;4(1):45-51. doi: 10.11648/j.sd.20160401.18

Copy | Download

@article{10.11648/j.sd.20160401.18,
  author = {Boning Zhang and Nian Li and Lili Wang},
  title = {Fast Many-Lights Rendering with Temporal Shadow Maps},
  journal = {Science Discovery},
  volume = {4},
  number = {1},
  pages = {45-51},
  doi = {10.11648/j.sd.20160401.18},
  url = {https://doi.org/10.11648/j.sd.20160401.18},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sd.20160401.18},
  abstract = {We present an effcient method for computing shadows of many light sources (e.g. 1,024). Our work is based on the observation that conventional shadow mapping becomes redundant as the number of lights increases. First, we sample the scene with a constant number of depth images (e.g. 10), which we call temporal shadow maps. Then the shadow map for each light is approximated through rendering triangles reconstructed from all the temporal shadow maps. The cost of rendering the triangles reconstructed from the temporal shadow maps is much smaller than rendering the entire scene when the geometry is complex. The algorithm supports fully dynamic scenes. The experiment results show that our method can produce comparable soft shadows with much higher speed than ray tracing and shadow mapping methods.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Fast Many-Lights Rendering with Temporal Shadow Maps
AU  - Boning Zhang
AU  - Nian Li
AU  - Lili Wang
Y1  - 2016/04/18
PY  - 2016
N1  - https://doi.org/10.11648/j.sd.20160401.18
DO  - 10.11648/j.sd.20160401.18
T2  - Science Discovery
JF  - Science Discovery
JO  - Science Discovery
SP  - 45
EP  - 51
PB  - Science Publishing Group
SN  - 2331-0650
UR  - https://doi.org/10.11648/j.sd.20160401.18
AB  - We present an effcient method for computing shadows of many light sources (e.g. 1,024). Our work is based on the observation that conventional shadow mapping becomes redundant as the number of lights increases. First, we sample the scene with a constant number of depth images (e.g. 10), which we call temporal shadow maps. Then the shadow map for each light is approximated through rendering triangles reconstructed from all the temporal shadow maps. The cost of rendering the triangles reconstructed from the temporal shadow maps is much smaller than rendering the entire scene when the geometry is complex. The algorithm supports fully dynamic scenes. The experiment results show that our method can produce comparable soft shadows with much higher speed than ray tracing and shadow mapping methods.
VL  - 4
IS  - 1
ER  -

Copy | Download