buildTree(const PrimitiveList &list, const Box &bbox) | SAHKDTree | [virtual] |
buildTree(Node *node, const Box &bbox, EventList &events, unsigned int depth) const | SAHKDTree | [private] |
KDTree::buildTree(const PrimitiveList &list, const Box &bbox) | KDTree | [virtual] |
classifyAndSplice(EventList &eLeft, EventList &eRight, Node *node, const Box &bbox, const EventList &events, const SplitPlane &plane) const | SAHKDTree | [private] |
cost(float probability_left, float probability_right, unsigned int number_left, unsigned int number_right) const | SAHKDTree | [inline, private] |
EventList typedef | SAHKDTree | [private] |
findBestPlane(float &minCost, const Node *node, const Box &bbox, const EventList &events) const | SAHKDTree | [private] |
generateEvents(EventList &events, Primitive *primitive, const Box &bbox) const | SAHKDTree | [private] |
intersect(Ray &ray) const | KDTree | [virtual] |
intersect(const Node *node, Ray &ray, float min, float max) const | KDTree | [protected, virtual] |
KDTree(unsigned int min_primitives, unsigned int max_depth) | KDTree | [inline] |
maxDepth() const | KDTree | [inline] |
mBoundingBox | KDTree | [protected] |
minPrimitives() const | KDTree | [inline] |
mKIntersect | SAHKDTree | [private] |
mKTraversal | SAHKDTree | [private] |
mLambda | SAHKDTree | [private] |
mMaxDepth | KDTree | [protected] |
mMinPrimitives | KDTree | [protected] |
mRootNode | KDTree | [protected] |
PrimitiveList typedef | KDTree | |
SAH(Side &side, const Box &bbox, const SplitPlane &plane, unsigned int number_left, unsigned int number_right, unsigned int number_middle) const | SAHKDTree | [private] |
SAHKDTree(float lambda=0.8f, float kTraversal=5.0f, float kIntersect=1.0f) | SAHKDTree | [inline] |
setConstraints(unsigned int min_primitives, unsigned int max_depth) | KDTree | [inline] |
terminate(const Node *current, float minCost, unsigned int depth) const | SAHKDTree | [private, virtual] |
~KDTree() | KDTree | [virtual] |
~SAHKDTree() | SAHKDTree | [virtual] |