Saarcor at SIGGRAPH 2005

nAo said:
RT complexity is logarthmic if an implementation make use of some spatial subdivision schemes as octrees, kdtree...
The setup time for the subdivision structure is going to be (at least) linear so, at some point, the log time must be overtaken by the linear :D
 
Back
Top