SDSM Sample Distribution Shadow Maps - Alex Tardif

SDSM Sample Distribution Shadow Maps - Alex Tardif

SDSM SAMPLE DISTRIBUTION SHADOW MAPS The Evolution Of PSSM QUICKIE OVERVIEW OF PSSM http://alextardif.com/ShadowMapping.html Goal is to hide artifacts resulting from wasted texture space Stable CSM

Scene-dependent cascade divisions (smoother transitions from one cascade to another) Increase Texture Resolution Blur the shit out of it GOAL OF SDSM Instead of hiding artifacts, lets make them borderline non-existent. How? By making sure we get the most out of our texture resolution. Focus on reducing

the waste, and youll no longer have to worry about hiding artifacts, because in most cases youll get sub-pixel shadow resolution. WHAT DOES IT LOOK LIKE? Well damn, Alex, that looks amazing! Yes, yes it does. SO HOW DO WE MAKE IT GO?

SDSM operates similarly to PSSM, but with a few key differences As always, either start with a depth prepass for forward renderers, or your depth/stencil from your gbuffer pass Next, we apply a min/max reduction of our depth buffer using a compute shader by finding our samples and clamping our z-min and z-max to them. Why? Were going to partition that space logarithmically

Its been proven by several wicked-smart CS researchers that logarithmic distribution of shadow partitions produces the least chance of scene-independent error (and smoother transitions), but only if the entire space is covered. By doing this z-reduction, were ensuring that our bounds are clamped to covered space. It reduces the wasted space where we arent drawing anything. As mentioned, the next step is to get the logarithmic split bounds based on the reduced z-depth.

Can be done CPU or GPU-side. In my case Im doing it GPU-side. Once we have our splits, we do a reduction on the bounds of each to confine them to our sample space, kind of like we did with the depth buffer. This is where we save the most quality, as you can see below Then, we create light view-projection matrices to wrap around these bounds just like we do in PSSM, and render shadow maps with them too. From there you just apply those shadow maps like you normally would.

You can optionally convert them to EVSM (exponential variance shadow maps), or do some PCF, etc. You can also add a blur pass Most remaining artifacts seem to come from hard edges meeting curved edges In my experience, a little blur cleans up 98% of these You can apply a stable CSM algorithm like I mentioned before, but you shouldnt need it because crawling should be almost non-existent. Youd probably just end up wasting texture space which would reduce your quality anyway.

BENEFITS Shadows that look amazing Smoother cascade transitions Roughly the same or better performance when compared to PSSM Tighter bound frusta allow for more aggressive culling Better quality for your texture space allows you to use smaller shadow maps

Worst-case scenario is PSSM quality if the entire camera space is covered in shadow Never happens, so. yeah. Youre basically guaranteed to get better quality. Scene-independent DOWNSIDES Because your light-space partition calculations are done on the GPU, you need to be a little conservative with your CPU-side frustum culling to ensure you see everything in your scene. Can be solved by stalling the CPU until the GPU is done and read back the partition information to do culling.

Not as expensive as it sounds, but its still perf that you might not want to lose. Use predictive culling based on the previous frames results Can lead to issues for moving objects or a moving camera (obviously not a good solution for games) SDSM has a somewhat tricky implementation when compared to other techniques. CONCLUSION This is the new standard that either not many people know about, or not many people use (at the time of writing this). Some games that use SDSM

include: Destiny The Order: 1886 Everyone should consider this shadow option in the future in place of standard PSSM. The end! RESOURCE AND CODE IMPLEMENTATION

http://visual-computing.intel-research.net/art/publications/sdsm/ ^ This guy, Andrew Lauritzen, is the man when it comes to shadows. Credit for this presentations resources is entirely his, so be sure to check out his research for more details. Source code for this will depend heavily on your renderer implementation, so I have not added my own code samples. However, his source is included in the link above so you can adapt it to your engine as well.

Recently Viewed Presentations

  • Diapositive 1

    Diapositive 1

    Nuclear Physics
  • Systems Thinking and the Theory of Constraints

    Systems Thinking and the Theory of Constraints

    "Under absorption costing, building inventories tends to reduce the apparent average COGS. When production exceeds sales, fixed costs are spread across more units, and some of the fixed costs are reported on the balance sheet as part of additional inventories...
  • Outcome: Soviet Imperialism and the Fall of Communism

    Outcome: Soviet Imperialism and the Fall of Communism

    Soviet Imperialism and The Fall of Communism. Communism falls apart at the end of the Cold War and in 1991, Boris Yeltsin is elected as a democratic leader. Soviet Union goes back to being called . Russia. or Russian Federation....
  • 슬라이드 1 - cfile7.uf.tistory.com

    슬라이드 1 - cfile7.uf.tistory.com

    iPhone 3GS 단말기능소개
  • Ethics for Financial Counselors

    Ethics for Financial Counselors

    Metaethics: Concerned with the meaning of and origin of ethical concepts. Not concerned with practical application, but rather fundamental meaning; are they a product of human society or exist independent of it. ... Ethics for Financial Counselors
  • 1. Complex Knowledge: demonstrations of learning that go

    1. Complex Knowledge: demonstrations of learning that go

    Understand how our view of the solar system has changed over time and how discoveries made have led to our changing our view of the solar system. Learn planetary characteristics such as number of moons, size, composition, type of atmosphere,...
  • Section 8.1 - Murrieta Valley Unified School District

    Section 8.1 - Murrieta Valley Unified School District

    2 e 2x + Ce x - 1e 2x- Ce x = e 2xdistribute & put in coeff. 1 1e 2x + 0 = e 2xcombine like terms On a given interval, a solution of a differential equation from which...
  • Unconscious Bias - Boston University

    Unconscious Bias - Boston University

    "Implicit and Explicit Anti-Fat Bias among a Large Sample of Medical Doctors by BMI, Race/Ethnicity and Gender." PLoS. One, 7(11): e48448. Abstract available in Additional Resources section of this Facilitator Guide.