This is the complete list of members for KdtreeAccelerator, including all inherited members.
| Accelerator() | Accelerator | inline |
| Accelerator(std::vector< Shape * > *_shapes, BBox &_globalBox) | Accelerator | inline |
| Accelerator(const Accelerator &other) | Accelerator | inline |
| alreadyFail | KdtreeAccelerator | |
| build() | KdtreeAccelerator | virtual |
| defineLeafFunction() | Accelerator | inlineprotected |
| emptyBonus | KdtreeAccelerator | protected |
| generateMidKdTree(int currentProfondeur, BBox &localBox, unsigned int nbPrims, unsigned int *prims) | KdtreeAccelerator | protected |
| generateSAHKdTree(int currentProfondeur, BBox &localBox, TaBRecBoundEdge *edges[3], unsigned int nbPrims, unsigned int *prims) | KdtreeAccelerator | protected |
| getBBox() | KdtreeAccelerator | inline |
| getIntersectionChoice() | Accelerator | inline |
| getMaxPrimPerLeaf() | KdtreeAccelerator | inline |
| getMaxProfondeur() | KdtreeAccelerator | inline |
| globalBox | Accelerator | protected |
| initialMesh | KdtreeAccelerator | protected |
| intersectionChoice | Accelerator | protected |
| isectCost | KdtreeAccelerator | protected |
| KdtreeAccelerator(std::vector< Shape * > *_initialMesh=NULL, BBox _globalBox=BBox()) | KdtreeAccelerator | |
| maxPrimPerLeaf | KdtreeAccelerator | protected |
| maxProfondeur | KdtreeAccelerator | protected |
| nbFail | KdtreeAccelerator | |
| pLeafTreatmentFunction | Accelerator | protected |
| print() | KdtreeAccelerator | |
| r | KdtreeAccelerator | |
| realMaxProfondeur | KdtreeAccelerator | protected |
| setIntersectionChoice(leafTreatment::treatment _intersectionChoice=leafTreatment::FIRST) | Accelerator | inline |
| setMaxPrimPerLeaf(int _maxPrimPerLeaf) | KdtreeAccelerator | inline |
| setMaxProfondeur(int _maxProfondeur) | KdtreeAccelerator | inline |
| shapes | Accelerator | protected |
| tableBox | KdtreeAccelerator | protected |
| tableNode | KdtreeAccelerator | protected |
| tablePrimitive | KdtreeAccelerator | protected |
| trace | KdtreeAccelerator | |
| traversalCost | KdtreeAccelerator | protected |
| traverse(Ray *r, std::list< Intersection > &result) const | KdtreeAccelerator | virtual |
| ~Accelerator() | Accelerator | inlinevirtual |
| ~KdtreeAccelerator() | KdtreeAccelerator | virtual |
