can something explain to me how worked octree traversal algorithm ?
which is An Efficient Parametric Algorithm for Octree Traversal .
I can't understand - why we use such as 1^a for selecting new node ?
is ray.dir must be normalized ?
how much INF cases we must provide ?
0
can something explain to me how worked octree traversal algorithm ?
Started by itmanager85, Dec 21 2011 06:10 PM
1 reply to this topic
#2
-
- Moderators
-
- 1716 posts
DevMaster Staff
Posted 22 December 2011 - 02:29 PM
Hyperbole is, like, the absolute best, most wonderful thing ever! However, you'd be an idiot to not think dogmatism is always bad.
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users
