BIH::BuildStats Class Reference

#include <BoundingIntervalHierarchy.h>

Public Member Functions
	BuildStats ()
void	updateInner ()
void	updateBVH2 ()
void	updateLeaf (int depth, int n)
void	printStats ()

Private Attributes
int	numNodes
int	numLeaves
int	sumObjects
int	minObjects
int	maxObjects
int	sumDepth
int	minDepth
int	maxDepth
int	numLeavesN [6]
int	numBVH2

Constructor & Destructor Documentation

BIH::BuildStats::BuildStats ( )

inline

 :
 numNodes(0), numLeaves(0), sumObjects(0), minObjects(0x0FFFFFFF),
 maxObjects(0xFFFFFFFF), sumDepth(0), minDepth(0x0FFFFFFF),
 maxDepth(0xFFFFFFFF), numBVH2(0)
 {
 for (int i=0; i<6; ++i) numLeavesN[i] = 0;
 }

Member Function Documentation

void BIH::BuildStats::printStats

(

)

{
 printf("Tree stats:\n");
 printf(" * Nodes: %d\n", numNodes);
 printf(" * Leaves: %d\n", numLeaves);
 printf(" * Objects: min %d\n", minObjects);
 printf(" avg %.2f\n", (float) sumObjects / numLeaves);
 printf(" avg(n>0) %.2f\n", (float) sumObjects / (numLeaves - numLeavesN[0]));
 printf(" max %d\n", maxObjects);
 printf(" * Depth: min %d\n", minDepth);
 printf(" avg %.2f\n", (float) sumDepth / numLeaves);
 printf(" max %d\n", maxDepth);
 printf(" * Leaves w/: N=0 %3d%%\n", 100 * numLeavesN[0] / numLeaves);
 printf(" N=1 %3d%%\n", 100 * numLeavesN[1] / numLeaves);
 printf(" N=2 %3d%%\n", 100 * numLeavesN[2] / numLeaves);
 printf(" N=3 %3d%%\n", 100 * numLeavesN[3] / numLeaves);
 printf(" N=4 %3d%%\n", 100 * numLeavesN[4] / numLeaves);
 printf(" N>4 %3d%%\n", 100 * numLeavesN[5] / numLeaves);
 printf(" * BVH2 nodes: %d (%3d%%)\n", numBVH2, 100 * numBVH2 / (numNodes + numLeaves - 2 * numBVH2));
}

Here is the call graph for this function:

Here is the caller graph for this function:

void BIH::BuildStats::updateBVH2 ( )

inline

{ numBVH2++; }

Here is the caller graph for this function:

void BIH::BuildStats::updateInner ( )

inline

{ numNodes++; }

Here is the caller graph for this function:

void BIH::BuildStats::updateLeaf	(	int	depth,
		int	n
	)

{
 numLeaves++;
 minDepth = std::min(depth, minDepth);
 maxDepth = std::max(depth, maxDepth);
 sumDepth += depth;
 minObjects = std::min(n, minObjects);
 maxObjects = std::max(n, maxObjects);
 sumObjects += n;
 int nl = std::min(n, 5);
 ++numLeavesN[nl];
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

int BIH::BuildStats::maxDepth

private

int BIH::BuildStats::maxObjects

private

int BIH::BuildStats::minDepth

private

int BIH::BuildStats::minObjects

private

int BIH::BuildStats::numBVH2

private

int BIH::BuildStats::numLeaves

private

int BIH::BuildStats::numLeavesN[6]

private

int BIH::BuildStats::numNodes

private

int BIH::BuildStats::sumDepth

private

int BIH::BuildStats::sumObjects

private

---

The documentation for this class was generated from the following files:

• src/common/Collision/BoundingIntervalHierarchy.h
• src/common/Collision/BoundingIntervalHierarchy.cpp