#include <ray_kdtree.h>

Public Member Functions | |
| kdTree_t (const T **v, int np, int depth=-1, int leafSize=2, float cost_ratio=0.35, float emptyBonus=0.33) | |
| bool | Intersect (const ray_t &ray, PFLOAT dist, T **tr, PFLOAT &Z, void *udat) const |
| bool | IntersectS (const ray_t &ray, PFLOAT dist, T **tr) const |
| bool | IntersectTS (renderState_t &state, const ray_t &ray, int maxDepth, PFLOAT dist, T **tr, color_t &filt) const |
| bound_t | getBound () |
| ~kdTree_t () | |
This class holds a complete kd-tree with building and traversal funtions
Definition at line 80 of file ray_kdtree.h.
| kdTree_t< T >::kdTree_t | ( | const T ** | v, | |
| int | np, | |||
| int | depth = -1, |
|||
| int | leafSize = 2, |
|||
| float | cost_ratio = 0.35, |
|||
| float | emptyBonus = 0.33 | |||
| ) | [inline] |
Definition at line 66 of file ray_kdtree.cc.
Definition at line 154 of file ray_kdtree.cc.
Definition at line 90 of file ray_kdtree.h.
| bool kdTree_t< T >::Intersect | ( | const ray_t & | ray, | |
| PFLOAT | dist, | |||
| T ** | tr, | |||
| PFLOAT & | Z, | |||
| void * | udat | |||
| ) | const [inline] |
The standard intersect function, returns the closest hit within dist
Definition at line 691 of file ray_kdtree.cc.
| bool kdTree_t< T >::IntersectS | ( | const ray_t & | ray, | |
| PFLOAT | dist, | |||
| T ** | tr | |||
| ) | const [inline] |
Definition at line 836 of file ray_kdtree.cc.
| bool kdTree_t< T >::IntersectTS | ( | renderState_t & | state, | |
| const ray_t & | ray, | |||
| int | maxDepth, | |||
| PFLOAT | dist, | |||
| T ** | tr, | |||
| color_t & | filt | |||
| ) | const [inline] |
Definition at line 977 of file ray_kdtree.cc.
1.6.1