Timeline for Ray Tracing concers: Efficient Data Structure and Photon Mapping
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2012 at 2:07 | vote | accept | Grieverheart | ||
| Nov 16, 2012 at 18:19 | comment | added | Chewy Gumball | I think a KD tree is going to be hard to beat. The benefit of knowing the scene before hand is that you can heavily preprocess it for your ray intersection tests (remove unseen geometry, etc), but the photon mapping is a stochastic process so you probably won't be finding any good improvements to the algorithm in the photon gathering phase. For the bounces, you are calculating the indirect light. This may very well be a small contribution. You add this to the direct contribution to get the final colour. | |
| Nov 15, 2012 at 16:42 | comment | added | Grieverheart | Thank you very much for your answer. What structure do you believe would be fastest for my situation? Also, sorry for adding one more question, but do you know in the original paper how the power changes after each bounce? I tried multiplying by the object's color but the photons end up with very small power and that's without scaling them by 1/n. | |
| Nov 14, 2012 at 22:27 | history | answered | Chewy Gumball | CC BY-SA 3.0 |