Progressive Lightcuts for GPU

1 / 35

# Progressive Lightcuts for GPU - PowerPoint PPT Presentation

Progressive Lightcuts for GPU. Tom áš Davidovič I. Georgiev , P. Slusallek Saarland University, Intel VCI. Direct illumination. Direct illumination. VPL Rendering. VPL Rendering. VPL Rendering. Bruteforce : 11s. VPL Rendering. Lightcuts : 2s. VPL Rendering. VPL Rendering.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Progressive Lightcuts for GPU' - borka

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Progressive Lightcuts for GPU

Tomáš Davidovič

I. Georgiev, P. Slusallek

Saarland University, Intel VCI

VPL Rendering
• Bruteforce: 11s
VPL Rendering
• Lightcuts: 2s
Lightcuts – progressive #2

Lightcuts, 20s

Reference

Lightcuts – progressive #2

Lightcuts, 20s

Bruteforce, 2400s

Lightcuts – Heapless

Lightcuts, 10s

Cut size

Heapless

Clamping

Contrib. ≈ k / (d^2)

Clamping
• Contrib. ≈ k / (d^2)
Clamping

m

• Contrib. ≈ k / (max(d, m)^2)

m

Clamping

b

• Contrib. ≈min( k / d^2, b)

b

Clamping – some math

Contribution ≈ k / d^2

P( ray.length ) ≈ ray.length^2

Mathematica happens

Variance ≈ sqrt( b)

Bias ≈ 1 / sqrt( b)

MSE = Variance + Bias^2 = sqrt( b) + 1 / b

Optimal convergence:

b= base * iteration ^ 0.66

Conclusion

GPU Lightcuts work

• Limited by memory

Progressive – averaging images

• Needs clamping

Can relax clamping – #VPLs ^ 0.66

• Works for any VPL method

Look into Multidimensional Lightcuts