|
|
I believe several posts identified world syncing with rasterization syncing.
I think stuff up the pipeline is replicated
and that is something like distributing openGL commands that chromium does.
A vague memory comes to mind about multicore raytracing
(as opposed to polygon rendering) using kd trees for occlusion.
I believe I cited this sci am article in a previous post and could check.
I imagine the kd trees are replicated and the rendering prunes them.
In cs everyone was afraid of the weeder course, algorithms.
After my Ph.D. in theoretical physics of lasers,
I didn't have to worry about failing a course and studied
Fraser on mutual information to follow a book on chaos.
He sent me some reassuring e mails on using his examples
that came with the paper.
One of the things I like about unix is
I can connect to scholars and their work like this.
I think the algorithm used something like kd trees.
I read up on them and found such were involved in googling.
So, I summarize, kd trees is readable, fun and good stuff
when not terrified about flunking a course used
to weed you out from a career!
|
Locked
