Stochastic Progressive Photon Mapping

It has been implemented. Also, the hashmap, which got me twice as many samples per second. The multithreading is broken with a race condition.

Unfortunitely, I can't seem to get the same results as the paper, with the glossy reflections converging even quicker than the diffuse surfaces. It seems as though my glossy reflections are converging really slow (but actually converging)

I do have a few new ideas which seem much simpler to implement than my previous voronoi cell based method (which was too complicated for me to bother spending the time not studying for school implementing) and thus fairly publishable.

I multiplied the speed by 10. now I get 15mill samples within half an hour.

Also some bugfixes

7 hours, 150mill samples:

Progressive Photon Mapping 2.

(After about 15 million samples and 7 hours)


The code for the progressive photon mapping is finally written. For the same number of samples, the algorithm does look better than path tracing, but the sample speed is far worse. While I am not quite doing it in the same way as the paper describes, my method has the same, if not better big-O time per sample. A proof has yet to be done for that. Right off the bat I can think of a couple of optimizations: the first two nodes on the photon can be ignored and not added to the map, and the direct lighting can be computed explicitly. I say this because it seems as though this algorithm is much slower for direct lighting, where graininess and complex lighting is not a problem, and fails completely for antialiasing, which is only really important under direct lighting.

4000 samples:

17000 samples:

1million samples:

DOF!!! (and new matts)

path traced

note: checker pattern+ improved glossy+glossy refraction

The dragon

FINALY AVAILABLE!

http://people.brandeis.edu/~mirman/

yay- 4000 spp

I fixed boolean opperations, and I have a webpage.

http://people.brandeis.edu/~mirman/

anybody who can, can yall try to open tlrcam's jar and see if you can read the source?