Research on Fast Soft Shadow Algorithm Based on 4D Rasterization

Zhao Qi; Wang Lili

doi:doi:10.11648/j.sd.20170501.17

| Peer-Reviewed

Research on Fast Soft Shadow Algorithm Based on 4D Rasterization

Zhao Qi, Wang Lili

Published in Science Discovery (Volume 5, Issue 1)

Received: 11 April 2017 Accepted: Published: 12 April 2017

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

This paper introduces an algorithm that extends traditional 2D projection and rasterization to 4D space for fast soft shadow rendering. First, the rectangular area light source is seen as a point light source that translates with two degrees of freedom. As the point light source moving, the projections of the triangles and the output image samples on the projection plane are also moving. The locus of the projection is called the 4D projection. 4D projections are rasterized, and a conservative set of output image sample/triangle pairs can be obtained. The set is then examined to derive light mask for each sample. Since all potentially blocking triangles are considered, the algorithm is an accurate algorithm. And, the algorithm does not require any type of precomputation, so it supports fully dynamic scene. We have tested our algorithm on several scenes to render complex soft shadows accurately at interactive rates.

Published in	Science Discovery (Volume 5, Issue 1)
DOI	10.11648/j.sd.20170501.17
Page(s)	40-47
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), 2024. Published by Science Publishing Group

Keywords

Photorealistic Rendering, Soft Shadow, Three-Dimensional Graphics

References

[1]	Haines E. Real-time shadows [J]. Silicon Graphics Inc, 2011.
[2]	Hasenfratz J M, Lapierre M, Holzschuch N, et al. A Survey of Real-time Soft Shadows Algorithms [J]. Computer Graphics Forum, 2003, 22(4):753–774.
[3]	Akenine-Möller T, Assarsson U. Approximate soft shadows on arbitrary surfaces using penumbra wedges [C]// Eurographics Workshop on Rendering. Eurographics Association, 2002:297-306.
[4]	Brabec S, Seidel H P, Mccool M, et al. Single Sample Soft Shadows Using Depth Maps [J]. Graphics Interface, 2002(2002).
[5]	Arvo J, Hirvikorpi M, Tyystjärvi J. Approximate Soft Shadows with an Image-Space Flood-Fill Algorithm [J]. Computer Graphics Forum, 2004, 23(3):271-279.
[6]	Fernando R. Percentage-closer soft shadows[C]// ACM SIGGRAPH 2005 Sketches. ACM, 2005:35.
[7]	Mohammadbagher M, Kautz J, Holzschuch N, et al. Screen-Space Percentage-Closer Soft Shadows [J]. Acm Siggraph Posters, 2010:1-1.
[8]	Gaël Guennebaud, Paulin M. Real-time soft shadow mapping by backprojection [C]// Eurographics Symposium on Rendering Techniques, Nicosia, Cyprus. DBLP, 2006:227-234.
[9]	Guennebaud G, Barthe L, Paulin M. High-Quality Adaptive Soft Shadow Mapping[C]// Computer Graphics Forum. 2007:525–533.
[10]	Schwarz M, Stamminger M. Microquad Soft Shadow Mapping Revisited[C]// Eurographics 2008 Annex to the Conference Proceedings Short Papers. 2008:295–298.
[11]	Yang B, Feng J, Guennebaud G, et al. Packet-based hierarchal soft shadow mapping[J]. Computer Graphics Forum, 2009, 28(4):1121-1130.
[12]	Shen L, Feng J, Yang B. Exponential Soft Shadow Mapping[J]. Computer Graphics Forum, 2013, 32(4):107-116.
[13]	Selgrad K, Dachsbacher C, Meyer Q, et al. Filtering Multi-Layer Shadow Maps for Accurate Soft Shadows[J]. Computer Graphics Forum, 2014, 34(1):205–215.
[14]	Liktor G, Spassov S, Ckl G, et al. Stochastic Soft Shadow Mapping [J]. Computer Graphics Forum, 2015, 34(4):1-11.
[15]	Whitted T. An improved illumination model for shaded display [J]. Communications of the ACM, 1980, 23(6):343-349.
[16]	Mehta S U, Wang B, Ramamoorthi R. Axis-aligned filtering for interactive sampled soft shadows[J]. Acm Transactions on Graphics, 2012, 31(6):163.
[17]	Yan L Q, Mehta S U, Ramamoorthi R, et al. Fast 4D Sheared Filtering for Interactive Rendering of Distribution Effects[J]. Acm Transactions on Graphics, 2015, 35(1):1-13.
[18]	Samuli L, Timo A. Hierarchical Penumbra Casting[C]// Computer Graphics Forum. 2005:313–322.
[19]	Laine S, Aila T, Assarsson U, et al. Soft Shadow Volumes for Ray Tracing[J]. Acm Transactions on Graphics, 2005, 24(3):1156-1165.
[20]	Forest V, Barthe L, Paulin M. Accurate Shadows by Depth Complexity Sampling [J]. Computer Graphics Forum, 2008, 27(27):663-674.
[21]	Mora F, Aveneau L, Apostu O, et al. Lazy Visibility Evaluation for Exact Soft Shadows[J]. Computer Graphics Forum, 2012, 31(1):132-145.
[22]	Eisemann E, Décoret X. Visibility Sampling on GPU and Applications [J]. Computer Graphics Forum, 2007, 26(3):535-544.
[23]	Johnson G S, Hunt W A, Hux A, et al. Soft irregular shadow mapping: fast, high-quality, and robust soft shadows[C]// Symposium on Interactive 3d Graphics, Si3d 2009, February 27 - March 1, 2009, Boston, Massachusetts, Usa. DBLP, 2009:57-66.
[24]	Benthin C, Wald I. Efficient ray traced soft shadows using multi-frusta tracing[C]// ACM Siggraph/eurographics Conference on High PERFORMANCE Graphics 2009, New Orleans, Louisiana, Usa, August. DBLP, 2009:135-144.
[25]	Nabata K, Iwasaki K, Dobashi Y, et al. Efficient divide-and-conquer ray tracing using ray sampling[C]// High-Performance Graphics Conference. 2013:129-135.
[26]	Aila T, Laine S. Alias-Free Shadow Maps.[C]// Eurographics Workshop on Rendering Techniques, Norköping, Sweden, June. DBLP, 2004:161-166.
[27]	Sintorn E, Eisemann E, Assarsson U. Sample Based Visibility for Soft Shadows using Alias-free Shadow Maps[J]. Computer Graphics Forum, 2008, 27(4):1285-1292.
[28]	Wang L, Zhou S, Ke W, et al. GEARS: A General and Efficient Algorithm for Rendering Shadows[C]// 2014:264-275.
[29]	Lecocq P, Gautron P, Marvie J E, et al. Sub-pixel shadow mapping[C]// ACM SIGGRAPH. ACM, 2013:1.
[30]	Akenine-M, Ller T, Munkberg J, et al. Stochastic rasterization using time-continuous triangles[C]// ACM Siggraph/eurographics Conference on Graphics Hardware 2007, San Diego, California, Usa, August. DBLP, 2007:7-16.
[31]	NVIDIA: Nvidia optix ray tracing engine.http://developer.nvidia.com/optix (2016)

Cite This Article

Plain Text BibTeX RIS

APA Style

Zhao Qi, Wang Lili. (2017). Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Science Discovery, 5(1), 40-47. https://doi.org/10.11648/j.sd.20170501.17

Copy | Download

ACS Style

Zhao Qi; Wang Lili. Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Sci. Discov. 2017, 5(1), 40-47. doi: 10.11648/j.sd.20170501.17

Copy | Download

AMA Style

Zhao Qi, Wang Lili. Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Sci Discov. 2017;5(1):40-47. doi: 10.11648/j.sd.20170501.17

Copy | Download

@article{10.11648/j.sd.20170501.17,
  author = {Zhao Qi and Wang Lili},
  title = {Research on Fast Soft Shadow Algorithm Based on 4D Rasterization},
  journal = {Science Discovery},
  volume = {5},
  number = {1},
  pages = {40-47},
  doi = {10.11648/j.sd.20170501.17},
  url = {https://doi.org/10.11648/j.sd.20170501.17},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sd.20170501.17},
  abstract = {This paper introduces an algorithm that extends traditional 2D projection and rasterization to 4D space for fast soft shadow rendering. First, the rectangular area light source is seen as a point light source that translates with two degrees of freedom. As the point light source moving, the projections of the triangles and the output image samples on the projection plane are also moving. The locus of the projection is called the 4D projection. 4D projections are rasterized, and a conservative set of output image sample/triangle pairs can be obtained. The set is then examined to derive light mask for each sample. Since all potentially blocking triangles are considered, the algorithm is an accurate algorithm. And, the algorithm does not require any type of precomputation, so it supports fully dynamic scene. We have tested our algorithm on several scenes to render complex soft shadows accurately at interactive rates.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Research on Fast Soft Shadow Algorithm Based on 4D Rasterization
AU  - Zhao Qi
AU  - Wang Lili
Y1  - 2017/04/12
PY  - 2017
N1  - https://doi.org/10.11648/j.sd.20170501.17
DO  - 10.11648/j.sd.20170501.17
T2  - Science Discovery
JF  - Science Discovery
JO  - Science Discovery
SP  - 40
EP  - 47
PB  - Science Publishing Group
SN  - 2331-0650
UR  - https://doi.org/10.11648/j.sd.20170501.17
AB  - This paper introduces an algorithm that extends traditional 2D projection and rasterization to 4D space for fast soft shadow rendering. First, the rectangular area light source is seen as a point light source that translates with two degrees of freedom. As the point light source moving, the projections of the triangles and the output image samples on the projection plane are also moving. The locus of the projection is called the 4D projection. 4D projections are rasterized, and a conservative set of output image sample/triangle pairs can be obtained. The set is then examined to derive light mask for each sample. Since all potentially blocking triangles are considered, the algorithm is an accurate algorithm. And, the algorithm does not require any type of precomputation, so it supports fully dynamic scene. We have tested our algorithm on several scenes to render complex soft shadows accurately at interactive rates.
VL  - 5
IS  - 1
ER  -

Copy | Download

Author Information

Zhao Qi

State Key Laboratory of Virtual Reality Technology and Systems, Bei Hang University, Beijing, China
Wang Lili

State Key Laboratory of Virtual Reality Technology and Systems, Bei Hang University, Beijing, China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Zhao Qi, Wang Lili. (2017). Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Science Discovery, 5(1), 40-47. https://doi.org/10.11648/j.sd.20170501.17

Copy | Download

ACS Style

Zhao Qi; Wang Lili. Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Sci. Discov. 2017, 5(1), 40-47. doi: 10.11648/j.sd.20170501.17

Copy | Download

AMA Style

Zhao Qi, Wang Lili. Research on Fast Soft Shadow Algorithm Based on 4D Rasterization. Sci Discov. 2017;5(1):40-47. doi: 10.11648/j.sd.20170501.17

Copy | Download

@article{10.11648/j.sd.20170501.17,
  author = {Zhao Qi and Wang Lili},
  title = {Research on Fast Soft Shadow Algorithm Based on 4D Rasterization},
  journal = {Science Discovery},
  volume = {5},
  number = {1},
  pages = {40-47},
  doi = {10.11648/j.sd.20170501.17},
  url = {https://doi.org/10.11648/j.sd.20170501.17},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sd.20170501.17},
  abstract = {This paper introduces an algorithm that extends traditional 2D projection and rasterization to 4D space for fast soft shadow rendering. First, the rectangular area light source is seen as a point light source that translates with two degrees of freedom. As the point light source moving, the projections of the triangles and the output image samples on the projection plane are also moving. The locus of the projection is called the 4D projection. 4D projections are rasterized, and a conservative set of output image sample/triangle pairs can be obtained. The set is then examined to derive light mask for each sample. Since all potentially blocking triangles are considered, the algorithm is an accurate algorithm. And, the algorithm does not require any type of precomputation, so it supports fully dynamic scene. We have tested our algorithm on several scenes to render complex soft shadows accurately at interactive rates.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Research on Fast Soft Shadow Algorithm Based on 4D Rasterization
AU  - Zhao Qi
AU  - Wang Lili
Y1  - 2017/04/12
PY  - 2017
N1  - https://doi.org/10.11648/j.sd.20170501.17
DO  - 10.11648/j.sd.20170501.17
T2  - Science Discovery
JF  - Science Discovery
JO  - Science Discovery
SP  - 40
EP  - 47
PB  - Science Publishing Group
SN  - 2331-0650
UR  - https://doi.org/10.11648/j.sd.20170501.17
AB  - This paper introduces an algorithm that extends traditional 2D projection and rasterization to 4D space for fast soft shadow rendering. First, the rectangular area light source is seen as a point light source that translates with two degrees of freedom. As the point light source moving, the projections of the triangles and the output image samples on the projection plane are also moving. The locus of the projection is called the 4D projection. 4D projections are rasterized, and a conservative set of output image sample/triangle pairs can be obtained. The set is then examined to derive light mask for each sample. Since all potentially blocking triangles are considered, the algorithm is an accurate algorithm. And, the algorithm does not require any type of precomputation, so it supports fully dynamic scene. We have tested our algorithm on several scenes to render complex soft shadows accurately at interactive rates.
VL  - 5
IS  - 1
ER  -

Copy | Download