Stochastic Rasterization - GPU Technology Conference 2012

More documents

Recommendations

Info

Deep Shadow Maps“Deep Shadow Maps”, Lokovic and Leach (Siggraph 2000)• How much light gets from camera to depth z == How much light gets from depth z to camera
Transparency without sortingPorter-Duff:Rearrange to find the contribution of each fragment:using our friendThe sum is order independent, given vis(z).Approximate vis(z) approximate sum.
Page 1 and 2:
Stochastic RasterizationEric Endert
Page 4 and 5:
60 fps on Geforce GT 280
Page 6 and 7:
Stochastic Rasterization• The sam
Page 8 and 9:
MSAA(Kayvon Fatahalian, “Beyond P
Page 10 and 11:
Motion Blur
Page 12 and 13:
(2+1)D2D RasterizationGeometry Shad
Page 14 and 15: Extending an Existing RendererC++ H
Page 16 and 17: Extreme Example of z = 0 Case16
Page 18 and 19: Extreme Example of z = 0 Case18
Page 20 and 21: Integration with MSAA• Perform ra
Page 22 and 23: Multisample Rate: 1x22
Page 29 and 30: AABBConvex Hull29Sample Test Effici
Page 31 and 32: New Bounding Geometry
Page 38 and 39: Stochastic Transparency
Page 40 and 41: Order dependent
Page 42 and 43: cf. [Fuchs et al 1995]
Page 44 and 45: Stochastic TransparencyScreen-door
Page 46 and 47: (Reference)
Page 48 and 49: 16 spp
Page 50 and 51: 64 spp
Page 53 and 54: Stochastic Shadow Map• Run Stocha
Page 55 and 56: Stochastic Shadow Map• Every pixe
Page 57: Depth-based Stochastic Transparency
Page 60 and 61: Advanced Topics• Stratified sampl
Page 63: Backup
show all

Stochastic Rasterization - GPU Technology Conference 2012

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?