#include <stack>
#include <time.h>
#include <iomanip>

#include "ViewCell.h"
#include "Plane3.h"
#include "HierarchyManager.h"
#include "Mesh.h"
#include "common.h"
#include "Environment.h"
#include "Polygon3.h"
#include "Ray.h"
#include "AxisAlignedBox3.h"
#include "Exporter.h"
#include "Plane3.h"
#include "ViewCellsManager.h"
#include "Beam.h"
#include "KdTree.h"
#include "IntersectableWrapper.h"
#include "VspTree.h"
#include "OspTree.h"
#include "BvHierarchy.h"
#include "ViewCell.h"
#include "TraversalTree.h"


namespace GtpVisibilityPreprocessor {


#define USE_FIXEDPOINT_T 0
#define STUPID_METHOD 0



/*******************************************************************/
/*              class HierarchyManager implementation              */
/*******************************************************************/


HierarchyManager::HierarchyManager(const int objectSpaceSubdivisionType):
mObjectSpaceSubdivisionType(objectSpaceSubdivisionType),
mOspTree(NULL), 
mBvHierarchy(NULL),
mTraversalTree(NULL)
{
	switch(mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		mOspTree = new OspTree();
		mOspTree->mVspTree = mVspTree;
		mOspTree->mHierarchyManager = this;
		break;
	case BV_BASED_OBJ_SUBDIV:
        mBvHierarchy = new BvHierarchy();
		mBvHierarchy->mHierarchyManager = this;
		break;
	default:
		break;
	}

	// hierarchy manager links view space partition and object space partition
	mVspTree = new VspTree();
	mVspTree->mHierarchyManager = this;
	
	mViewSpaceSubdivisionType = KD_BASED_VIEWSPACE_SUBDIV;
	ParseEnvironment();
}


HierarchyManager::HierarchyManager(KdTree *kdTree): 
mObjectSpaceSubdivisionType(KD_BASED_OBJ_SUBDIV),
mBvHierarchy(NULL)
{
	mOspTree = new OspTree(*kdTree);
	mOspTree->mVspTree = mVspTree;

	mVspTree = new VspTree();
	mVspTree->mHierarchyManager = this;

	mViewSpaceSubdivisionType = KD_BASED_VIEWSPACE_SUBDIV;
	ParseEnvironment();
}


void HierarchySubdivisionStats::Print(ostream &app) const
{
	app << "#Pass\n" << 0 << endl
		<< "#Splits\n" << mNumSplits << endl 
		<< "#TotalRenderCost\n" << mTotalRenderCost << endl
		<< "#TotalEntriesInPvs\n" << mEntriesInPvs << endl
		<< "#Memory\n" << mMemoryCost << endl
		<< "#StepsView\n" << mViewSpaceSplits << endl
		<< "#StepsObject\n" << mObjectSpaceSplits << endl
		<< "#VspOspRatio\n" << VspOspRatio() << endl
		<< "#FullMem\n" << mFullMemory << endl
		<< "#RenderCostDecrease\n" << mRenderCostDecrease << endl
		<< "#Priority\n" << mPriority << endl
		<< "#FpsPerMb\n" << FpsPerMb() << endl
		<< endl;
}


void HierarchyManager::ParseEnvironment()
{
	Environment::GetSingleton()->GetFloatValue(
		"Hierarchy.Termination.minGlobalCostRatio", mTermMinGlobalCostRatio);

	Environment::GetSingleton()->GetFloatValue("Hierarchy.minRenderCost", mMinRenderCost);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Termination.globalCostMissTolerance", mTermGlobalCostMissTolerance);

	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.Construction.startWithObjectSpace", mStartWithObjectSpace);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Termination.maxLeaves", mTermMaxLeaves);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.type", mConstructionType);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.minDepthForOsp", mMinDepthForObjectSpaceSubdivion);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.minDepthForVsp", mMinDepthForViewSpaceSubdivion);
	
	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.Construction.repairQueue", mRepairQueue);

	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.Construction.useMultiLevel", mUseMultiLevelConstruction);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.levels", mNumMultiLevels);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.minStepsOfSameType", mMinStepsOfSameType);
	
	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.maxStepsOfSameType", mMaxStepsOfSameType);

	char subdivisionStatsLog[100];
	Environment::GetSingleton()->GetStringValue("Hierarchy.subdivisionStats", subdivisionStatsLog);
	mSubdivisionStats.open(subdivisionStatsLog);

	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.Construction.recomputeSplitPlaneOnRepair", mRecomputeSplitPlaneOnRepair);

	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.Construction.considerMemory", mConsiderMemory);

	Environment::GetSingleton()->GetFloatValue(
		"Hierarchy.Termination.maxMemory", mTermMaxMemory);

	Environment::GetSingleton()->GetIntValue(
		"Hierarchy.Construction.maxRepairs", mMaxRepairs);

	Environment::GetSingleton()->GetFloatValue(
		"Hierarchy.Construction.maxAvgRaysPerObject", mMaxAvgRaysPerObject);

	Environment::GetSingleton()->GetFloatValue(
		"Hierarchy.Construction.minAvgRaysPerObject", mMinAvgRaysPerObject);

	Environment::GetSingleton()->GetBoolValue(
		"Hierarchy.useTraversalTree", mUseTraversalTree);

	Debug << "******** Hierarchy Manager Options ***********" << endl;
	Debug << "max leaves: " << mTermMaxLeaves << endl;
	Debug << "min global cost ratio: " << mTermMinGlobalCostRatio << endl;
	Debug << "global cost miss tolerance: " << mTermGlobalCostMissTolerance << endl;
	Debug << "min depth for object space subdivision: " << mMinDepthForObjectSpaceSubdivion << endl;
	Debug << "repair queue: " << mRepairQueue << endl;
	Debug << "number of multilevels: " << mNumMultiLevels << endl;
	Debug << "recompute split plane on repair: " << mRecomputeSplitPlaneOnRepair << endl;
	Debug << "minimal number of steps from same type: " << mMinStepsOfSameType << endl;
	Debug << "maximal allowed memory: " << mTermMaxMemory << endl;
	Debug << "consider memory: " << mConsiderMemory << endl;
	Debug << "min steps of same kind: " << mMinStepsOfSameType << endl;
	Debug << "max steps of same kind: " << mMaxStepsOfSameType << endl;
	Debug << "max repairs: " << mMaxRepairs << endl;
	Debug << "max avg rays per object: " << mMaxAvgRaysPerObject << endl;
	Debug << "mín avg rays per object: " << mMinAvgRaysPerObject << endl;
	Debug << "mín render cost: " << mMinRenderCost << endl;

	// for comparing it with byte - value
	mTermMaxMemory *= (1024.0f * 1024.0f);

	switch (mConstructionType)
	{
	case 0:
		Debug << "construction type: sequential" << endl;
		break;
	case 1:
		Debug << "construction type: interleaved" << endl;
		break;
	case 2:
		Debug << "construction type: gradient" << endl;
		break;
	case 3:
		Debug << "construction type: multilevel" << endl;
		break;
	default:
		Debug << "construction type " << mConstructionType << " unknown" << endl;
		break;
	}

	//Debug << "min render cost " << mMinRenderCostDecrease << endl;
	Debug << endl;
}


HierarchyManager::~HierarchyManager()
{
	DEL_PTR(mOspTree);
	DEL_PTR(mVspTree);
	DEL_PTR(mBvHierarchy);
}


int HierarchyManager::GetObjectSpaceSubdivisionType() const
{
	return mObjectSpaceSubdivisionType;
}


int HierarchyManager::GetViewSpaceSubdivisionType() const
{
	return mViewSpaceSubdivisionType;
}


void HierarchyManager::SetViewCellsManager(ViewCellsManager *vcm)
{
	mVspTree->SetViewCellsManager(vcm);

	if (mOspTree)
	{
		mOspTree->SetViewCellsManager(vcm);
	}
	else if (mBvHierarchy)
	{
		mBvHierarchy->SetViewCellsManager(vcm);
	}
}


void HierarchyManager::SetViewCellsTree(ViewCellsTree *vcTree)
{
	mVspTree->SetViewCellsTree(vcTree);
}


VspTree *HierarchyManager::GetVspTree() 
{ 
	return mVspTree; 
}

/*
AxisAlignedBox3 HierarchyManager::GetViewSpaceBox() const
{
	return mVspTree->mBoundingBox;
}*/


AxisAlignedBox3 HierarchyManager::GetObjectSpaceBox() const
{
	switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		return mOspTree->mBoundingBox;
	case BV_BASED_OBJ_SUBDIV:
		return mBvHierarchy->mBoundingBox;
	default:
		// hack: empty box
		return AxisAlignedBox3();
	}
}


SubdivisionCandidate *HierarchyManager::NextSubdivisionCandidate(SplitQueue &splitQueue)
{
	SubdivisionCandidate *splitCandidate = splitQueue.Top();
	splitQueue.Pop();

	// split was not reevaluated before => do it now
	if (splitCandidate->IsDirty())
	{
		splitCandidate->EvalCandidate();
	}

	return splitCandidate;
}


float HierarchyManager::EvalFullMem() const
{
	// question: should I also add the mem usage of the hierarchies?
	const float objectSpaceMem = 16;//GetObjectSpaceMemUsage();
	const float viewSpaceMem = 16;//mVspTree->GetMemUsage();
	// HACK: the same value is used for view and object space
	return mHierarchyStats.mMemory + mHierarchyStats.Leaves() * objectSpaceMem;
}


void HierarchyManager::PrintSubdivisionStats()
{
	
	HierarchySubdivisionStats stats;

	stats.mNumSplits = mHierarchyStats.Leaves();
	stats.mTotalRenderCost = mHierarchyStats.mTotalCost;
	stats.mEntriesInPvs = mHierarchyStats.mPvsEntries;
	stats.mMemoryCost = mHierarchyStats.mMemory  / float(1024 * 1024);
	stats.mFullMemory = EvalFullMem() / float(1024 * 1024);
	stats.mViewSpaceSplits = mVspTree->mVspStats.Leaves();
	stats.mObjectSpaceSplits = GetObjectSpaceSubdivisionLeaves();
	stats.mRenderCostDecrease = mHierarchyStats.mRenderCostDecrease;
	stats.mPriority = mPriority;

	stats.Print(mSubdivisionStats);
}


void HierarchyManager::AddSubdivisionStats(const int splits,
										   const float renderCostDecr,
										   const float totalRenderCost,
										   const int pvsEntries,
										   const float memory,
										   const float renderCostPerStorage,
										   const float vspOspRatio)
{
	mSubdivisionStats
			<< "#Splits\n" << splits << endl
			<< "#RenderCostDecrease\n" << renderCostDecr << endl 
			<< "#TotalEntriesInPvs\n" << pvsEntries << endl
			<< "#TotalRenderCost\n" << totalRenderCost << endl
			<< "#Memory\n" << memory << endl
			<< "#FpsPerMb\n" << renderCostPerStorage << endl
			<< "#VspOspRatio\n" << vspOspRatio << endl
			<< endl;
}


bool HierarchyManager::GlobalTerminationCriteriaMet(SubdivisionCandidate *candidate) const
{
	const bool terminationCriteriaMet = 
		(0
		|| (mHierarchyStats.Leaves() >= mTermMaxLeaves) 
		//|| (mHierarchyStats.mMemory >= mTermMaxMemory)
		|| (EvalFullMem() >= mTermMaxMemory)
		|| candidate->GlobalTerminationCriteriaMet()
		//|| (mHierarchyStats.mRenderCostDecrease < mMinRenderCostDecrease)
		//|| (mHierarchyStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
		);

#if GTP_DEBUG
	if (terminationCriteriaMet)
	{
		Debug << "hierarchy global termination criteria met:" << endl;
		Debug << "leaves: " << mHierarchyStats.Leaves() << " " << mTermMaxLeaves << endl;
		Debug << "cost misses: " << mHierarchyStats.mGlobalCostMisses << " " << mTermGlobalCostMissTolerance << endl;
		Debug << "memory: " << mHierarchyStats.mMemory << " " << mTermMaxMemory << endl;
		Debug << "full memory: " << EvalFullMem() << " " << mTermMaxMemory << endl;
	}
#endif

	return terminationCriteriaMet;
}


void HierarchyManager::Construct(const VssRayContainer &sampleRays,
								 const ObjectContainer &objects,
								 AxisAlignedBox3 *forcedViewSpace)
{
	mTimeStamp = 1;

	switch (mConstructionType)
	{
	case MULTILEVEL:
		ConstructMultiLevel(sampleRays, objects, forcedViewSpace);
		break;
	case INTERLEAVED:
	case SEQUENTIAL:
		ConstructInterleaved(sampleRays, objects, forcedViewSpace);
		PrintTimings(true);
		break;
	case GRADIENT:
		ConstructInterleavedWithGradient(sampleRays, objects, forcedViewSpace);
		PrintTimings(true);
		break;
	default:
		break;
	}

	// hack
	if (mUseMultiLevelConstruction)
	{
		cout << "starting optimizing multilevel ... " << endl;
		// try to optimize the hierarchy from above
		OptimizeMultiLevel(sampleRays, objects, forcedViewSpace);
		
		cout << "finished" << endl;
	}

	if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		mBvHierarchy->SetUniqueNodeIds();
	}

	// create a traversal tree which is optimized for view cell casting 
	if (mUseTraversalTree) 
	{
		CreateTraversalTree();
	}
}


void HierarchyManager::PrintTimings(const bool lastSplitWasOsp)
{
	double sortTime, evalTime, nodeTime, splitTime, subdTime, planeTime, collectTime, viewCellsTime;

	sortTime = mBvHierarchy->mSortTimer.TotalTime();
	evalTime = mBvHierarchy->mEvalTimer.TotalTime();
	nodeTime = mBvHierarchy->mNodeTimer.TotalTime();
	splitTime = mBvHierarchy->mSplitTimer.TotalTime();
	subdTime = mBvHierarchy->mSubdivTimer.TotalTime();
	planeTime = mBvHierarchy->mPlaneTimer.TotalTime();
	collectTime = mBvHierarchy->mCollectTimer.TotalTime();

	cout << "bvh times"
		 << " sort : " << sortTime
		 << " eval : " << evalTime
		 << " node : " << nodeTime
		 << " split: " << splitTime
		 << " subd : " << subdTime 
		 << " plane: " << planeTime 
		 << " colct: " << collectTime
		 << endl;

	Debug << "bvh times"
		<< " sort : " << sortTime
		 << " eval : " << evalTime
		 << " node : " << nodeTime
		 << " split: " << splitTime
		 << " subd : " << subdTime
		 << " plane: " << planeTime 
		 << " colct: " << collectTime
		 << endl;

	sortTime = mVspTree->mSortTimer.TotalTime();
	evalTime = mVspTree->mEvalTimer.TotalTime();
	nodeTime = mVspTree->mNodeTimer.TotalTime();
	splitTime = mVspTree->mSplitTimer.TotalTime();
	subdTime = mVspTree->mSubdivTimer.TotalTime();
	planeTime = mVspTree->mPlaneTimer.TotalTime();
	viewCellsTime = mVspTree->mViewCellsTimer.TotalTime();

	cout << "vsp times"
		 << " sort : " << sortTime
		 << " eval : " << evalTime
		 << " node : " << nodeTime
		 << " split: " << splitTime
		 << " subd : " << subdTime
		 << " plane: " << planeTime 
		 << " viewc: " << viewCellsTime 
		 << endl;

	Debug << "vsp times"
		  << " sort : " << sortTime
		  << " eval : " << evalTime
		  << " node : " << nodeTime
		  << " split: " << splitTime
		  << " subd : " << subdTime
		  << " plane: " << planeTime 
		  << " viewc: " << viewCellsTime 
		  << endl;

	cout << endl;
	Debug << endl;
}


void HierarchyManager::ConstructInterleavedWithGradient(const VssRayContainer &sampleRays,
														const ObjectContainer &objects,
														AxisAlignedBox3 *forcedViewSpace)
{
	mHierarchyStats.Reset();
	mHierarchyStats.Start();
	
	mHierarchyStats.mNodes = 2;

	// create first nodes
	mVspTree->Initialise(sampleRays, forcedViewSpace, objects);
	InitialiseObjectSpaceSubdivision(objects);

	// hack: assume that object space can be seen from view space
	mHierarchyStats.mTotalCost = mInitialRenderCost = GetViewCellsManager()->ComputeRenderCost(objects.size(), 1);

	// only one entry for start
	mHierarchyStats.mPvsEntries = 1;
	mHierarchyStats.mMemory = (float)ObjectPvs::GetEntrySizeByte();

	PrintSubdivisionStats();
	Debug << "setting total cost to " << mHierarchyStats.mTotalCost << endl;

	const long startTime = GetTime();
	cout << "Constructing view space / object space tree ... \n";
	
	SplitQueue objectSpaceQueue;
	SplitQueue viewSpaceQueue;

	int vspSteps = 0, ospSteps = 0;

	// use sah for evaluating osp tree construction 
	// in the first iteration of the subdivision
	mSavedViewSpaceSubdivisionType = mViewSpaceSubdivisionType;
	mViewSpaceSubdivisionType = NO_VIEWSPACE_SUBDIV;
	mSavedObjectSpaceSubdivisionType = mObjectSpaceSubdivisionType;

	// number of initial splits
	const int minSteps = mMinStepsOfSameType;
	const int maxSteps = mMaxStepsOfSameType;

	PrepareObjectSpaceSubdivision(objectSpaceQueue, sampleRays, objects);
	
	/////////////////////////
	// calulcate initial object space splits
	
	SubdivisionCandidateContainer dirtyList;

	// subdivide object space first
	// for first round, use sah splits. Once view space partition
	// has started, use render cost heuristics instead
	ospSteps = RunConstruction(objectSpaceQueue, 
							   dirtyList, 
							   NULL, 
							   minSteps, 
							   maxSteps);

	cout << "\n" << ospSteps << " object space partition steps taken" << endl;

	//PrintTimings(true);

	///////////////
	//-- create view space
	
	PrepareViewSpaceSubdivision(viewSpaceQueue, sampleRays, objects);

	dirtyList.clear();
	// view space subdivision started
	mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;

	if (1)
	{
		// rather also start with 100 view space splits to avoid initial bias.
		vspSteps = RunConstruction(viewSpaceQueue, dirtyList, NULL, minSteps, maxSteps);
		cout << "\n" << vspSteps << " view space partition steps taken" << endl;
		
		/// Repair split queue
		cout << "repairing object space queue ... " << endl;
		RepairQueue(dirtyList, objectSpaceQueue, true);
		cout << "repaired " << (int)dirtyList.size() << " candidates" << endl;

		dirtyList.clear();

		/// also repair some candidates from view space queue
		/*cout << "repairing view space queue ... " << endl;
		CollectRandomCandidates(dirtyList);
		RepairQueue(dirtyList, viewSpaceQueue, true);
		cout << "repaired " << (int)dirtyList.size() << " candidates" << endl;
		dirtyList.clear();*/
		//PrintTimings(false);
	}
	else
	{
		// the priorities were calculated for driving sah.
		// => recalculate "real" priorities taking visibility into
		// account so we can compare to view space splits
		ResetQueue(objectSpaceQueue, false);
	}

	// This method subdivides view space / object space 
	// in order to converge to some optimal cost for this partition
	// start with object space partiton
	// then optimizate view space partition for the current osp
	// and vice versa until iteration depth is reached.

	bool lastSplitWasOsp = true;

	while (!(viewSpaceQueue.Empty() && objectSpaceQueue.Empty()))
	{
		// decide upon next split type
		const float vspPriority = 
			viewSpaceQueue.Top() ? viewSpaceQueue.Top()->GetPriority() : -1e20f;
		const float ospPriority = 
			objectSpaceQueue.Top() ? objectSpaceQueue.Top()->GetPriority() : -1e20f;
		
		cout << "new decicion, vsp: " << vspPriority << ", osp: " << ospPriority << endl;

		// should view or object space be subdivided further?
		if (ospPriority >= vspPriority)
		//if (!lastSplitWasOsp)
		{
			/////////////////
			// subdivide object space with respect to the objects

			lastSplitWasOsp = true;
			cout << "osp" << endl;
			
			// dirtied view space candidates
			SubdivisionCandidateContainer dirtyVspList;

			// subdivide object space first for first round, 
			// use sah splits. Once view space partition
			// has started, use render cost heuristics instead
			const int ospSteps = RunConstruction(objectSpaceQueue, 
												 dirtyVspList, 
												 viewSpaceQueue.Top(), 
												 minSteps, 
												 maxSteps);

			cout << "\n" << ospSteps << " object space partition steps taken" << endl;
			Debug << "\n" << ospSteps << " object space partition steps taken" << endl;

			/// Repair split queue, i.e., affected view space candidates
			cout << "repairing queue ... " << endl;
			const int repaired = RepairQueue(dirtyVspList, viewSpaceQueue, true);
            
			cout << "\nrepaired " << repaired << " candidates from " 
				 << (int)dirtyVspList.size() << " dirtied candidates" << endl;
		}
		else
		{
			/////////////////
			// subdivide view space with respect to the objects

			lastSplitWasOsp = false;
			cout << "vsp" << endl;

			// dirtied object space candidates
			SubdivisionCandidateContainer dirtyOspList;

			// process view space candidates
			const int vspSteps = RunConstruction(viewSpaceQueue, 
												 dirtyOspList, 
												 objectSpaceQueue.Top(), 
												 minSteps, 
												 maxSteps);

			cout << "\n" << vspSteps << " view space partition steps taken" << endl;
			Debug << "\n" << vspSteps << " view space partition steps taken" << endl;

			// view space subdivision constructed
			mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;

			/// Repair split queue
			cout << "repairing queue ... " << endl;
			const int repaired = RepairQueue(dirtyOspList, objectSpaceQueue, true);

			cout << "\nrepaired " << repaired << " candidates from " 
				 << (int)dirtyOspList.size() << " dirtied candidates" << endl;
		}

		//PrintTimings(lastSplitWasOsp);
	}

	cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;

	mHierarchyStats.Stop();
	mVspTree->mVspStats.Stop();

	FinishObjectSpaceSubdivision(objects, !mUseMultiLevelConstruction);
}


void HierarchyManager::ConstructInterleaved(const VssRayContainer &sampleRays,
											const ObjectContainer &objects,
											AxisAlignedBox3 *forcedViewSpace)
{
	mHierarchyStats.Reset();
	mHierarchyStats.Start();

	// two nodes for view space and object space
	mHierarchyStats.mNodes = 2; 
	mHierarchyStats.mPvsEntries = 1;
	mHierarchyStats.mMemory = (float)ObjectPvs::GetEntrySizeByte();
	mHierarchyStats.mTotalCost = GetViewCellsManager()->ComputeRenderCost(objects.size(), 1);

	mHierarchyStats.mRenderCostDecrease = 0;

	PrintSubdivisionStats();
	Debug << "setting total cost to " << mHierarchyStats.mTotalCost << endl;

	const long startTime = GetTime();
	cout << "Constructing view space / object space tree ... \n";
	
	// create only roots
	mVspTree->Initialise(sampleRays, forcedViewSpace, objects);
	InitialiseObjectSpaceSubdivision(objects);

	// use objects for evaluating vsp tree construction in the 
	// first levels of the subdivision
	mSavedObjectSpaceSubdivisionType = mObjectSpaceSubdivisionType;
	mObjectSpaceSubdivisionType = NO_OBJ_SUBDIV;

	mSavedViewSpaceSubdivisionType = mViewSpaceSubdivisionType;
	mViewSpaceSubdivisionType = NO_VIEWSPACE_SUBDIV;

	// start view space subdivison immediately?
	if (StartViewSpaceSubdivision())
	{
		// prepare vsp tree for traversal
        mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
		PrepareViewSpaceSubdivision(mTQueue, sampleRays, objects);
	}
	
	// start object space subdivision immediately?
	if (StartObjectSpaceSubdivision())
	{
		mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;
		PrepareObjectSpaceSubdivision(mTQueue, sampleRays, objects);
	}
	
	// begin subdivision
	RunConstruction(mRepairQueue, sampleRays, objects, forcedViewSpace);
	
	cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;

	mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;
	mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;

	mHierarchyStats.Stop();
	mVspTree->mVspStats.Stop();
	
	FinishObjectSpaceSubdivision(objects, !mUseMultiLevelConstruction);
}


void HierarchyManager::PrepareViewSpaceSubdivision(SplitQueue &tQueue,
												   const VssRayContainer &sampleRays,
												   const ObjectContainer &objects)
{
	cout << "\npreparing view space hierarchy construction ... " << endl;

	// hack: reset global cost misses
	mHierarchyStats.mGlobalCostMisses = 0;

	RayInfoContainer *viewSpaceRays = new RayInfoContainer();
	mVspTree->PrepareConstruction(tQueue, sampleRays, *viewSpaceRays);

	if (0)
	{
		/////////
		//-- new render cost

		mHierarchyStats.mTotalCost = mVspTree->mTotalCost;
		cout << "\nreseting cost for vsp construction, new total cost: " << mHierarchyStats.mTotalCost << endl;
	}
}


float HierarchyManager::GetObjectSpaceMemUsage() const
{
	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		// TODO;
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		return mBvHierarchy->GetMemUsage();
	}

	return -1;
}


void HierarchyManager::InitialiseObjectSpaceSubdivision(const ObjectContainer &objects)
{
	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		// TODO;
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		mBvHierarchy->Initialise(objects);
	}
}


void HierarchyManager::PrepareObjectSpaceSubdivision(SplitQueue &tQueue,
													 const VssRayContainer &sampleRays,
													 const ObjectContainer &objects)
{
	// hack: reset global cost misses
	mHierarchyStats.mGlobalCostMisses = 0;

	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		return PrepareOspTree(tQueue, sampleRays, objects);
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		return PrepareBvHierarchy(tQueue, sampleRays, objects);
	}
}


void HierarchyManager::PrepareBvHierarchy(SplitQueue &tQueue,
										  const VssRayContainer &sampleRays,
										  const ObjectContainer &objects)
{
	const long startTime = GetTime();

	cout << "preparing bv hierarchy construction ... " << endl;
	
	// compute first candidate
	mBvHierarchy->PrepareConstruction(tQueue, sampleRays, objects);

	mHierarchyStats.mTotalCost = mBvHierarchy->mTotalCost;
	Debug << "\nreseting cost, new total cost: " << mHierarchyStats.mTotalCost << endl;

	cout << "finished bv hierarchy preparation in " 
		 << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;
}


void HierarchyManager::PrepareOspTree(SplitQueue &tQueue,
									  const VssRayContainer &sampleRays,
									  const ObjectContainer &objects)
{
	cout << "starting osp tree construction ... " << endl;

	RayInfoContainer *objectSpaceRays = new RayInfoContainer();

	// start with one big kd cell - all objects can be seen from everywhere
	// note: only true for view space = object space

	// compute first candidate
	mOspTree->PrepareConstruction(tQueue, sampleRays, objects, *objectSpaceRays);

	mHierarchyStats.mTotalCost = mOspTree->mTotalCost;
	Debug << "\nreseting cost for osp, new total cost: " << mHierarchyStats.mTotalCost << endl;
}


float HierarchyManager::EvalCorrectedPvs(const float childPvs, 
										 const float totalPvs, 
										 const float avgRaysPerObjects) const
{
	// don't correct pvss
	if (mMaxAvgRaysPerObject <= mMinAvgRaysPerObject)
	{
		return childPvs;
	}
	
	// assume pvs sampled sufficiently => take child pvs
	if (avgRaysPerObjects >= mMaxAvgRaysPerObject)
	{
		return childPvs;
	}

	// assume pvs not sampled sufficiently => pvs equal to parent pvs
	// we should not subdivide further from this point
	if (avgRaysPerObjects <= mMinAvgRaysPerObject)
	{
		//cout << "t ";// << avgRaysPerObjects << " ";
		return totalPvs;
	}

	///////////
	//-- blend pvss

	const float alpha = (mMaxAvgRaysPerObject - avgRaysPerObjects) / 
						(mMaxAvgRaysPerObject - mMinAvgRaysPerObject);

	/// rays per object == max threshold => alpha == 0 => newPvs is childPvs
	/// rays per object == min threshold => alpha == 1 => newPvs is totalPvs
	
	const float beta = alpha * (totalPvs - childPvs);
#if 1
	const float newPvs = childPvs + beta;
#else
	const float newPvs = alpha * childPvs + (1.0f - alpha) * totalPvs;
#endif
	//cout << "b ";
	//cout << "alpha " << alpha << " beta: " << beta << " child: " << childPvs << " parent: " << totalPvs << endl;
	
	if (0 && 
		((newPvs < childPvs - Limits::Small) || (newPvs > totalPvs + Limits::Small)))
		cout << "w: " << newPvs << " < child (" << childPvs << ") or > parent (" << totalPvs << ")" << endl;

	return newPvs;
}


bool HierarchyManager::ApplySubdivisionCandidate(SubdivisionCandidate *sc, 
												 SplitQueue &splitQueue,
												 //const bool repairQueue,
												 SubdivisionCandidateContainer &dirtyList)
{
	const bool terminationCriteriaMet = GlobalTerminationCriteriaMet(sc);
	const bool success = sc->Apply(splitQueue, terminationCriteriaMet, dirtyList);

	if (sc->IsDirty())
		cerr << "Error: Should never come here!" << endl;

	if (!success) // split was not taken
	{
		//cout << "x";
		return false;
	}

	
	///////////////
	//-- split was successful => update stats and queue

    // cost ratio of cost decrease / totalCost
	const float costRatio = sc->GetRenderCostDecrease() / mHierarchyStats.mTotalCost;
	//cout << "ratio: " << costRatio << " min ratio: " << mTermMinGlobalCostRatio << endl;
	
	if (costRatio < mTermMinGlobalCostRatio)
	{
		++ mHierarchyStats.mGlobalCostMisses;
	}
	
	/////////////
	// update stats

	mHierarchyStats.mNodes += 2;
	mHierarchyStats.mTotalCost -= sc->GetRenderCostDecrease();

	const int pvsEntriesIncr = sc->GetPvsEntriesIncr();
	mHierarchyStats.mPvsEntries += pvsEntriesIncr;
	//cout << "pvs entries: " << pvsEntriesIncr << " " << mHierarchyStats.mPvsEntries << endl;

	// memory size in byte
	float mem = (float)ObjectPvs::GetEntrySizeByte() * pvsEntriesIncr;

#if USE_AVGRAYCONTRI
	// high avg ray contri, the result is influenced by undersampling
	// => decrease priority

	if (sc->GetAvgRayContribution() > mMaxAvgRayContri)
	{
		const float factor = 1.0f + sc->GetAvgRayContribution() - mMaxAvgRayContri;
		cout << "h " << factor << endl;

		mem *= factor;
	}
#endif

	mHierarchyStats.mMemory += mem;
	mHierarchyStats.mRenderCostDecrease = sc->GetRenderCostDecrease();
	
	mPriority = sc->GetPriority();

	cout << sc->Type() << " ";

	//////////
	// show current memory

	static float memoryCount = 0;

	if (mHierarchyStats.mMemory > memoryCount)
	{
		memoryCount += 100000;
		cout << "\nstorage cost: " << mHierarchyStats.mMemory / float(1024 * 1024) 
			 << " MB, steps: " << mHierarchyStats.Leaves() << endl;
	}

	// output stats
	PrintSubdivisionStats();

	return true;
}


int HierarchyManager::GetObjectSpaceSubdivisionDepth() const
{
	int maxDepth = 0;

	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		maxDepth = mOspTree->mOspStats.maxDepth;
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		maxDepth = mBvHierarchy->mBvhStats.maxDepth;
	}

	return maxDepth;
}


int HierarchyManager::GetObjectSpaceSubdivisionLeaves() const
{
	int maxLeaves= 0;

	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		maxLeaves = mOspTree->mOspStats.Leaves();
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		maxLeaves = mBvHierarchy->mBvhStats.Leaves();
	}

	return maxLeaves;
}


int HierarchyManager::GetObjectSpaceSubdivisionNodes() const
{
	int maxLeaves = 0;

	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		maxLeaves = mOspTree->mOspStats.nodes;
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		maxLeaves = mBvHierarchy->mBvhStats.nodes;
	}

	return maxLeaves;
}

bool HierarchyManager::StartObjectSpaceSubdivision() const
{
	// view space construction already started
	if (ObjectSpaceSubdivisionConstructed())
		return false;

	// start immediately with object space subdivision?
	if (mStartWithObjectSpace)
		return true;

	// is the queue empty again?
	if (ViewSpaceSubdivisionConstructed() && mTQueue.Empty())
		return true;

	// has the depth for subdivision been reached?
	return 
		((mConstructionType == INTERLEAVED) && 
		 (mMinStepsOfSameType <= mVspTree->mVspStats.nodes));
}


bool HierarchyManager::StartViewSpaceSubdivision() const
{
	// view space construction already started
	if (ViewSpaceSubdivisionConstructed())
		return false;

	// start immediately with view space subdivision?
	if (!mStartWithObjectSpace)
		return true;

	// is the queue empty again?
	if (ObjectSpaceSubdivisionConstructed() && mTQueue.Empty())
		return true;

	// has the depth for subdivision been reached?
	return 
		((mConstructionType == INTERLEAVED) && 
		 (mMinStepsOfSameType <= GetObjectSpaceSubdivisionLeaves()));
}


void HierarchyManager::RunConstruction(const bool repairQueue,
									   const VssRayContainer &sampleRays,
									   const ObjectContainer &objects,
									   AxisAlignedBox3 *forcedViewSpace)
{
	SubdivisionCandidate::NewMail();

	while (!FinishedConstruction())
	{
		SubdivisionCandidate *sc = NextSubdivisionCandidate(mTQueue);    
	
		///////////////////
		//-- subdivide leaf node

		SubdivisionCandidateContainer dirtyList;

		ApplySubdivisionCandidate(sc, mTQueue, dirtyList);
				
		if (repairQueue) 
		{
			// reevaluate candidates affected by the split for view space splits, 
			// this would be object space splits and other way round
			RepairQueue(dirtyList, mTQueue, mRecomputeSplitPlaneOnRepair);
		}	

		// we use objects for evaluating vsp tree construction until 
		// a certain depth once a certain depth existiert ...
		if (StartObjectSpaceSubdivision())
		{
			mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;

			cout << "\nstarting object space subdivision after " 
				 << mVspTree->mVspStats.nodes << " (" << mMinStepsOfSameType << ") steps, mem=" 
				 << mHierarchyStats.mMemory / float(1024 * 1024) << " MB" << endl;

			PrepareObjectSpaceSubdivision(mTQueue, sampleRays, objects);
			
			cout << "reseting queue ... ";
			ResetQueue(mTQueue, mRecomputeSplitPlaneOnRepair);
			cout << "finished" << endl;
		}

		if (StartViewSpaceSubdivision())
		{
			mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;

			cout << "\nstarting view space subdivision at " 
				 << GetObjectSpaceSubdivisionLeaves() << " (" 
				 << mMinStepsOfSameType << ") , mem=" 
				 << mHierarchyStats.mMemory / float(1024 * 1024) << " MB" << endl;

			PrepareViewSpaceSubdivision(mTQueue, sampleRays, objects);

			cout << "reseting queue ... ";
			ResetQueue(mTQueue, mRecomputeSplitPlaneOnRepair);
			cout << "finished" << endl;
		}

		DEL_PTR(sc);
	}
}


void HierarchyManager::RunConstruction(const bool repairQueue)
{
	// main loop
	while (!FinishedConstruction())
	{
		SubdivisionCandidate *sc = NextSubdivisionCandidate(mTQueue);    
		
		////////
		//-- subdivide leaf node of either type

		SubdivisionCandidateContainer dirtyList;
        ApplySubdivisionCandidate(sc, mTQueue, dirtyList);
		
		if (repairQueue)
		{
			RepairQueue(dirtyList, mTQueue, mRecomputeSplitPlaneOnRepair);
		}

		DEL_PTR(sc);
	}
}


int HierarchyManager::RunConstruction(SplitQueue &splitQueue,
									  SubdivisionCandidateContainer &dirtyCandidates,
									  SubdivisionCandidate *oldCandidate,
									  const int minSteps,
									  const int maxSteps)
{
	if (minSteps >= maxSteps)
		cout << "error!! " << minSteps << " equal or larger maxSteps" << endl;

	int steps = 0;
	SubdivisionCandidate::NewMail();

	// main loop
	while (!splitQueue.Empty())
	{
		const float priority = splitQueue.Top()->GetPriority();
		const float threshold = oldCandidate ? oldCandidate->GetPriority() : 1e20f;

		// minimum slope reached
		if ((steps >= maxSteps) || ((priority < threshold) && !(steps < minSteps)))
		{
			cout << "\nbreaking on " << priority << " smaller than " << threshold << endl;
			break;
		}
		
		////////
		//-- subdivide leaf node of either type

		SubdivisionCandidate *sc = NextSubdivisionCandidate(splitQueue); 

		const bool success = ApplySubdivisionCandidate(sc, splitQueue, dirtyCandidates);

		if (success)
		{
			//sc->CollectDirtyCandidates(dirtyCandidates, true);
			//if (steps % 10 == 0) cout << sc->Type() << " ";
			
			++ steps;
		}

		DEL_PTR(sc);
	}

	return steps;
}


void HierarchyManager::ResetObjectSpaceSubdivision(SplitQueue &tQueue,
												   const VssRayContainer &sampleRays, 
												   const ObjectContainer &objects)
{	
	// object space partition constructed => reconstruct
	switch (mObjectSpaceSubdivisionType)
	{
	case BV_BASED_OBJ_SUBDIV:
		{
			cout << "\nreseting bv hierarchy" << endl;
			Debug << "old bv hierarchy:\n " << mBvHierarchy->mBvhStats << endl;
				
			// rather use this: remove previous nodes and add the two new ones
			//mHierarchyStats.mNodes -= mBvHierarchy->mBvhStats.nodes + 1;
			mHierarchyStats.mNodes = mVspTree->mVspStats.nodes;
			
			// create root
			mBvHierarchy->Initialise(objects);
	
			mBvHierarchy->Reset(tQueue, sampleRays, objects);

			mHierarchyStats.mTotalCost = mBvHierarchy->mTotalCost;
			
			//mHierarchyStats.mPvsEntries -= mBvHierarchy->mPvsEntries + 1;
			mHierarchyStats.mPvsEntries = mBvHierarchy->CountViewCells(objects);

			mHierarchyStats.mMemory = 
				(float)mHierarchyStats.mPvsEntries * ObjectPvs::GetEntrySizeByte();

			mHierarchyStats.mRenderCostDecrease = 0;

			// evaluate stats before first subdivision
			PrintSubdivisionStats();
			cout << "finished bv hierarchy preparation" << endl;
		}
		break;

	case KD_BASED_OBJ_SUBDIV:
		// TODO
	default:
		break;
	}
}


void HierarchyManager::ResetViewSpaceSubdivision(SplitQueue &tQueue,
												 const VssRayContainer &sampleRays, 
												 const ObjectContainer &objects,
												 AxisAlignedBox3 *forcedViewSpace)
{
	ViewCellsManager *vm = GetViewCellsManager();

	// HACK: rather not destroy vsp tree
	DEL_PTR(mVspTree);
	mVspTree = new VspTree();

	mVspTree->mHierarchyManager = this;
	mVspTree->mViewCellsManager = vm;

	mVspTree->Initialise(sampleRays, forcedViewSpace, objects);
	
	
	//////////
	//-- reset stats

    mHierarchyStats.mNodes = GetObjectSpaceSubdivisionNodes();
		//-mVspTree->mVspStats.nodes + 1;
	
	PrepareViewSpaceSubdivision(mTQueue, sampleRays, objects);
	
	mHierarchyStats.mPvsEntries = mVspTree->mPvsEntries;
	mHierarchyStats.mRenderCostDecrease = 0;

	mHierarchyStats.mMemory = 
		(float)mHierarchyStats.mPvsEntries * ObjectPvs::GetEntrySizeByte();

	// evaluate new stats before first subdivsiion
	PrintSubdivisionStats();
}


void HierarchyManager::ConstructMultiLevel(const VssRayContainer &sampleRays,											 
										   const ObjectContainer &objects,
										   AxisAlignedBox3 *forcedViewSpace)
{
	mHierarchyStats.Reset();
	mHierarchyStats.Start();
	mHierarchyStats.mNodes = 2;
	
	mHierarchyStats.mTotalCost = GetViewCellsManager()->ComputeRenderCost(objects.size(), 1);
	Debug << "setting total cost to " << mHierarchyStats.mTotalCost << endl;

	const long startTime = GetTime();
	cout << "Constructing view space / object space tree ... \n";
	
	// initialise view / object space
	mVspTree->Initialise(sampleRays, forcedViewSpace, objects);
	InitialiseObjectSpaceSubdivision(objects);

	// use sah for evaluating osp tree construction 
	// in the first iteration of the subdivision

	mSavedViewSpaceSubdivisionType = mViewSpaceSubdivisionType;
	mViewSpaceSubdivisionType = NO_VIEWSPACE_SUBDIV;

	PrepareObjectSpaceSubdivision(mTQueue, sampleRays, objects);

	//////////////////////////


	const int limit = mNumMultiLevels;
	int i = 0;

	// This method subdivides view space / object space 
	// in order to converge to some optimal cost for this partition
	// start with object space partiton
	// then optimizate view space partition for the current osp
	// and vice versa until iteration depth is reached.
	while (1)
	{
		char subdivisionStatsLog[100];
		sprintf(subdivisionStatsLog, "tests/i3d/subdivision-%04d.log", i);
		mSubdivisionStats.open(subdivisionStatsLog);

		// subdivide object space first
		ResetObjectSpaceSubdivision(mTQueue, sampleRays, objects);

		// process object space candidates
		RunConstruction(false);

		// object space subdivision constructed
		mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;

		cout << "iteration " << i << " of " << limit << " finished" << endl;
		mSubdivisionStats.close();

		if ((i ++) >= limit)
			break;

		sprintf(subdivisionStatsLog, "tests/i3d/subdivision-%04d.log", i);
		mSubdivisionStats.open(subdivisionStatsLog);


		/////////////////
		// subdivide view space with respect to the objects

		ResetViewSpaceSubdivision(mTQueue, sampleRays, objects, forcedViewSpace);
		
		// view space subdivision constructed
		mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
		
		// process view space candidates
		RunConstruction(false);

		cout << "iteration " << i << " of " << limit << " finished" << endl;
		mSubdivisionStats.close();

		if ((i ++) >= limit)
			break;
	}
	
	cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;

	mHierarchyStats.Stop();
	mVspTree->mVspStats.Stop();
	FinishObjectSpaceSubdivision(objects);
}


void HierarchyManager::OptimizeMultiLevel(const VssRayContainer &sampleRays,											 
										  const ObjectContainer &objects,
										  AxisAlignedBox3 *forcedViewSpace)
{
	const long startTime = GetTime();
	const int limit = mNumMultiLevels;

	// open up new subdivision
	mSubdivisionStats.close();

	int steps = 0;

	int maxViewSpaceLeaves = mVspTree->mVspStats.Leaves();
	int maxObjectSpaceLeaves;
	
	// set the number of leaves 'evaluated' from the previous methods
	// we go for the same numbers, but we try to optimize both subdivisions
	switch (mObjectSpaceSubdivisionType)
	{
	case BV_BASED_OBJ_SUBDIV:
		maxObjectSpaceLeaves = mBvHierarchy->mBvhStats.Leaves();
		break;
	case KD_BASED_OBJ_SUBDIV:
		maxObjectSpaceLeaves = mOspTree->mOspStats.Leaves();
	default:
		maxObjectSpaceLeaves = 0;
		break;
	}

	// This method subdivides view space / object space 
	// in order to converge to some optimal cost for this partition
	// start with object space partiton
	// then optimizate view space partition for the current osp
	// and vice versa until iteration depth is reached.
	while (1)
	{
		char subdivisionStatsLog[100];
		sprintf(subdivisionStatsLog, "tests/i3d/subdivision-%04d.log", steps);
		mSubdivisionStats.open(subdivisionStatsLog);

		// subdivide object space first
		ResetObjectSpaceSubdivision(mTQueue, sampleRays, objects);
	
		// set the number of leaves 'evaluated' from the previous methods
		// we go for the same numbers, but we try to optimize both subdivisions
		mBvHierarchy->mTermMaxLeaves = maxObjectSpaceLeaves;

		// process object space candidates
		RunConstruction(false);

		cout << "iteration " << steps << " of " << limit << " finished" << endl;
		mSubdivisionStats.close();

		if ((++ steps) >= limit)
			break;

		sprintf(subdivisionStatsLog, "tests/i3d/subdivision-%04d.log", steps);
		mSubdivisionStats.open(subdivisionStatsLog);

		/////////////////
		// subdivide view space with respect to the objects

		ResetViewSpaceSubdivision(mTQueue, sampleRays, objects, forcedViewSpace);

		mVspTree->mMaxViewCells = maxViewSpaceLeaves;

		// process view space candidates
		RunConstruction(false);

		cout << "iteration " << steps << " of " << limit << " finished" << endl;
		mSubdivisionStats.close();

		if ((++ steps) >= limit)
			break;
	}
	
	cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;

	mHierarchyStats.Stop();
	mVspTree->mVspStats.Stop();
	FinishObjectSpaceSubdivision(objects);
}



bool HierarchyManager::FinishedConstruction() const
{
	return mTQueue.Empty();
}


bool HierarchyManager::ObjectSpaceSubdivisionConstructed() const
{
	/*switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		return mOspTree && mOspTree->GetRoot();
	case BV_BASED_OBJ_SUBDIV:
		return mBvHierarchy && mBvHierarchy->GetRoot();
	default:
		return false;
	}*/
	return mObjectSpaceSubdivisionType != NO_OBJ_SUBDIV;
}


bool HierarchyManager::ViewSpaceSubdivisionConstructed() const
{
	return mViewSpaceSubdivisionType != NO_VIEWSPACE_SUBDIV;
	//return mVspTree && mVspTree->GetRoot();
}


void HierarchyManager::CollectDirtyCandidates(const SubdivisionCandidateContainer &chosenCandidates, 
											  SubdivisionCandidateContainer &dirtyList)
{
	SubdivisionCandidateContainer::const_iterator sit, sit_end = chosenCandidates.end();
	SubdivisionCandidate::NewMail();

	for (sit = chosenCandidates.begin(); sit != sit_end; ++ sit)
	{
		(*sit)->CollectDirtyCandidates(dirtyList, true);
	}
}


int HierarchyManager::RepairQueue(const SubdivisionCandidateContainer &dirtyList,
								  SplitQueue &splitQueue,
								  const bool recomputeSplitPlaneOnRepair)
{
	// for each update of the view space partition:
	// the candidates from object space partition which
	// have been afected by the view space split (the kd split candidates
	// which saw the view cell which was split) must be reevaluated 
	// (maybe not locally, just reinsert them into the queue)
	//
	// vice versa for the view cells
	// for each update of the object space partition
	// reevaluate split candidate for view cells which saw the split kd cell
	// 
	// the priority queue update can be solved by implementing a binary heap
	// (explicit data structure, binary tree)
	// *) inserting and removal is efficient
	// *) search is not efficient => store queue position with each
	// split candidate

	int repaired = 0;

	// collect list of "dirty" candidates
	const long startTime = GetTime();
   	if (0) cout << "repairing " << (int)dirtyList.size() << " candidates ... ";

	const float prop = (float)mMaxRepairs / (float)dirtyList.size();

	///////////////////////////
	//-- reevaluate the dirty list

	SubdivisionCandidateContainer::const_iterator sit, sit_end = dirtyList.end();
	
	int i = 0;
	for (sit = dirtyList.begin(); sit != sit_end; ++ sit, ++ i)
	{
		// only repair a certain number of candidates
		if ((mMaxRepairs < (int)dirtyList.size()) && (Random(1.0f) >= prop))
			continue;

		SubdivisionCandidate* sc = *sit;
		const float rcd = sc->GetRenderCostDecrease();
		
		// erase from queue
		splitQueue.Erase(sc);
		// reevaluate candidate
		sc->EvalCandidate(recomputeSplitPlaneOnRepair);
		 // reinsert
		splitQueue.Push(sc);
		
		++ repaired;
		//if (i % 10 == 0)
			cout << ".";

#ifdef GTP_DEBUG
		Debug << "candidate " << sc << " reevaluated\n" 
			  << "render cost decrease diff " <<  rcd - sc->GetRenderCostDecrease()
			  << " old: " << rcd << " new " << sc->GetRenderCostDecrease() << endl;
#endif	
	}

	const long endTime = GetTime();
	const Real timeDiff = TimeDiff(startTime, endTime);

	mHierarchyStats.mRepairTime += timeDiff;

	return repaired;
}


void HierarchyManager::ResetQueue(SplitQueue &splitQueue, const bool recomputeSplitPlane)
{
	SubdivisionCandidateContainer mCandidateBuffer;

	// remove from queue
	while (!splitQueue.Empty())
	{
		SubdivisionCandidate *candidate = NextSubdivisionCandidate(splitQueue);
		
		// reevaluate local split plane and priority
		candidate->EvalCandidate(recomputeSplitPlane);
		cout << ".";
		mCandidateBuffer.push_back(candidate);
	}

	// put back into queue
	SubdivisionCandidateContainer::const_iterator sit, sit_end = mCandidateBuffer.end();
    for (sit = mCandidateBuffer.begin(); sit != sit_end; ++ sit)
	{
		splitQueue.Push(*sit);
	}
}


void HierarchyManager::ExportObjectSpaceHierarchy(OUT_STREAM &stream)
{
	// the type of the view cells hierarchy
	switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		stream << "<ObjectSpaceHierarchy type=\"osp\">" << endl;
		mOspTree->Export(stream);
		stream << endl << "</ObjectSpaceHierarchy>" << endl;
		break;		
	case BV_BASED_OBJ_SUBDIV:
		stream << "<ObjectSpaceHierarchy type=\"bvh\">" << endl;
		mBvHierarchy->Export(stream);
		stream << endl << "</ObjectSpaceHierarchy>" << endl;
		break;
	}
}


void HierarchyManager::PrintHierarchyStatistics(ostream &stream) const
{
	stream << mHierarchyStats << endl;
	stream << "\nview space:" << endl << endl;
	stream << mVspTree->GetStatistics() << endl;
	stream << "\nobject space:" << endl << endl;

	switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		{
			stream << mOspTree->GetStatistics() << endl;
			break;
		}
	case BV_BASED_OBJ_SUBDIV:
		{
			stream << mBvHierarchy->GetStatistics() << endl;
			break;
		}
	default:
		break;
	}
}


void HierarchyManager::ExportObjectSpaceHierarchy(Exporter *exporter,
												  const ObjectContainer &objects,
												  AxisAlignedBox3 *bbox,
												  const float maxRenderCost,
												  const bool exportBounds) const
{
	switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		{
			ExportOspTree(exporter, objects);
			break;
		}
	case BV_BASED_OBJ_SUBDIV:
		{
			exporter->ExportBvHierarchy(*mBvHierarchy, maxRenderCost, bbox, exportBounds);
			break;
		}
	default:
		break;
	}
}


void HierarchyManager::ExportOspTree(Exporter *exporter, 
									 const ObjectContainer &objects) const
{
	if (0) exporter->ExportGeometry(objects);
			
	exporter->SetWireframe();
	exporter->ExportOspTree(*mOspTree, 0);
}


Intersectable *HierarchyManager::GetIntersectable(Intersectable *obj,
												  const Vector3 &point) const
{

	if (!obj) return NULL;

	switch (mObjectSpaceSubdivisionType)
	{
	case HierarchyManager::KD_BASED_OBJ_SUBDIV:
		{
			KdLeaf *leaf = mOspTree->GetLeaf(point, NULL);
			return mOspTree->GetOrCreateKdIntersectable(leaf);
		}
	case HierarchyManager::BV_BASED_OBJ_SUBDIV:
		{
			BvhLeaf *leaf = mBvHierarchy->GetLeaf(obj);
			return leaf;
		}
	default:
		return obj;
	}
}


Intersectable *HierarchyManager::GetIntersectable(const VssRay &ray, 
												  const bool isTermination) const
{
	Intersectable *obj = NULL;
	Vector3 pt;
	KdNode *node;

	ray.GetSampleData(isTermination, pt, &obj, &node);

	if (!obj) return NULL;

	switch (mObjectSpaceSubdivisionType)
	{
	case HierarchyManager::KD_BASED_OBJ_SUBDIV:
		{
			KdLeaf *leaf = mOspTree->GetLeaf(pt, node);
			return mOspTree->GetOrCreateKdIntersectable(leaf);
		}
	case HierarchyManager::BV_BASED_OBJ_SUBDIV:
		{
			BvhLeaf *leaf = mBvHierarchy->GetLeaf(obj);
			return leaf;
		}
	default:
		break;
	}

	return obj;
}


void HierarchyStatistics::Print(ostream &app) const
{
	app << "=========== Hierarchy statistics ===============\n";

	app << setprecision(4);

	app << "#N_CTIME  ( Construction time [s] )\n" << Time() << " \n";
	
	app << "#N_RTIME  ( Repair time [s] )\n" << mRepairTime * 1e-3f << " \n";

	app << "#N_NODES ( Number of nodes )\n" << mNodes << "\n";

	app << "#N_INTERIORS ( Number of interior nodes )\n" << Interior() << "\n";

	app << "#N_LEAVES ( Number of leaves )\n" << Leaves() << "\n";

	app << "#N_PMAXDEPTH ( Maximal reached depth )\n" << mMaxDepth << endl;

	app << "#N_GLOBALCOSTMISSES ( Global cost misses )\n" << mGlobalCostMisses << endl;
	
	app << "========== END OF Hierarchy statistics ==========\n";
}


static void RemoveRayRefs(const ObjectContainer &objects)
{
	ObjectContainer::const_iterator oit, oit_end = objects.end();
	for (oit = objects.begin(); oit != oit_end; ++ oit)
	{
		(*oit)->DelRayRefs();
	}
}


void HierarchyManager::FinishObjectSpaceSubdivision(const ObjectContainer &objects, 
													const bool removeRayRefs) const
{
	switch (mObjectSpaceSubdivisionType)
	{
	case KD_BASED_OBJ_SUBDIV:
		{
			mOspTree->mOspStats.Stop();
			break;
		}
	case BV_BASED_OBJ_SUBDIV:
		{
			mBvHierarchy->mBvhStats.Stop();
			if (removeRayRefs)
				RemoveRayRefs(objects);
			break;
		}
	default:
		break;
	}
}


void HierarchyManager::ExportBoundingBoxes(OUT_STREAM &stream, const ObjectContainer &objects)
{
	stream << "<BoundingBoxes>" << endl;
	    
	if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
	{
		KdIntersectableMap::const_iterator kit, kit_end = mOspTree->mKdIntersectables.end();

		int id = 0;
		for (kit = mOspTree->mKdIntersectables.begin(); kit != kit_end; ++ kit, ++ id)
		{
			Intersectable *obj = (*kit).second;
			const AxisAlignedBox3 box = obj->GetBox();
		
			obj->SetId(id);

			stream << "<BoundingBox" << " id=\"" << id << "\""
				   << " min=\"" << box.Min().x << " " << box.Min().y << " " << box.Min().z << "\""
				   << " max=\"" << box.Max().x << " " << box.Max().y << " " << box.Max().z << "\" />" << endl;
		}
	}
	else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
	{
		// export bounding boxes
        vector<BvhNode *> nodes;

		// hack: should also expect interior nodes
		mBvHierarchy->CollectNodes(mBvHierarchy->GetRoot(), nodes);

		vector<BvhNode *>::const_iterator oit, oit_end = nodes.end();

		for (oit = nodes.begin(); oit != oit_end; ++ oit)
		{
			const AxisAlignedBox3 box = (*oit)->GetBox();
			const int id = (*oit)->GetId();
			
			stream << "<BoundingBox" << " id=\"" << (*oit)->GetId() << "\""
				   << " min=\"" << box.Min().x << " " << box.Min().y << " " << box.Min().z << "\""
				   << " max=\"" << box.Max().x << " " << box.Max().y << " " << box.Max().z << "\" />" << endl;
		}
	}
	else
	{
		ObjectContainer::const_iterator oit, oit_end = objects.end();

		for (oit = objects.begin(); oit != oit_end; ++ oit)
		{
			const AxisAlignedBox3 box = (*oit)->GetBox();
		
			stream << "<BoundingBox" << " id=\"" << (*oit)->GetId() << "\""
				   << " min=\"" << box.Min().x << " " << box.Min().y << " " << box.Min().z << "\""
				   << " max=\"" << box.Max().x << " " << box.Max().y << " " << box.Max().z << "\" />" << endl;
		}
	}
		
	stream << "</BoundingBoxes>" << endl;
}


class HierarchyNodeWrapper;


template <typename T> class myless
{
public:
	bool operator() (T v1, T v2) const
	{
		return (v1->GetMergeCost() < v2->GetMergeCost());
	}
};


typedef priority_queue<HierarchyNodeWrapper *, vector<HierarchyNodeWrapper *>, 
					   myless<vector<HierarchyNodeWrapper *>::value_type> > HierarchyNodeQueue;

class HierarchyNodeWrapper
{
public:
	enum {VSP_NODE, BVH_NODE, VIEW_CELL};

	virtual float GetMergeCost() const = 0;
	virtual int Type() const  = 0;
	virtual bool IsLeaf() const = 0;

	virtual void PushChildren(HierarchyNodeQueue &tQueue) = 0;
};


class VspNodeWrapper: public HierarchyNodeWrapper
{
public:
	VspNodeWrapper(VspNode *node): mNode(node) {}

	int Type() const { return VSP_NODE; }

	float GetMergeCost() const { return (float) -mNode->mTimeStamp; };

	bool IsLeaf() const { return mNode->IsLeaf(); }

	void PushChildren(HierarchyNodeQueue &tQueue)
	{
		if (!mNode->IsLeaf())
		{
			VspInterior *interior = static_cast<VspInterior *>(mNode);

			tQueue.push(new VspNodeWrapper(interior->GetFront()));
			tQueue.push(new VspNodeWrapper(interior->GetBack()));
		}
	}

	VspNode *mNode;
};


class BvhNodeWrapper: public HierarchyNodeWrapper
{
public:
	BvhNodeWrapper(BvhNode *node): mNode(node) {}
	
	int Type()  const { return BVH_NODE; }

	float GetMergeCost() const { return (float)-mNode->GetTimeStamp(); };

	bool IsLeaf() const { return mNode->IsLeaf(); }

	void PushChildren(HierarchyNodeQueue &tQueue)
	{
		if (!mNode->IsLeaf())
		{
			BvhInterior *interior = static_cast<BvhInterior *>(mNode);

			tQueue.push(new BvhNodeWrapper(interior->GetFront()));
			tQueue.push(new BvhNodeWrapper(interior->GetBack()));
		}
	}

	BvhNode *mNode;
};


class ViewCellWrapper: public HierarchyNodeWrapper
{
public:

	ViewCellWrapper(ViewCell *vc): mViewCell(vc) {}
	
	int Type()  const { return VIEW_CELL; }

	float GetMergeCost() const { return mViewCell->GetMergeCost(); };

	bool IsLeaf() const { return mViewCell->IsLeaf(); }

	void PushChildren(HierarchyNodeQueue &tQueue)
	{
		if (!mViewCell->IsLeaf())
		{
			ViewCellInterior *interior = static_cast<ViewCellInterior *>(mViewCell);

			ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();

			for (it = interior->mChildren.begin(); it != it_end; ++ it)
			{
				tQueue.push(new ViewCellWrapper(*it));
			}
		}
	}

	ViewCell *mViewCell;
};


void HierarchyManager::CollectBestSet(const int maxSplits,
									  const float maxMemoryCost,
									  ViewCellContainer &viewCells,
									  vector<BvhNode *> &bvhNodes)
{
	HierarchyNodeQueue tqueue;
	//tqueue.push(new VspNodeWrapper(mVspTree->GetRoot()));
	tqueue.push(new ViewCellWrapper(mVspTree->mViewCellsTree->GetRoot()));
	tqueue.push(new BvhNodeWrapper(mBvHierarchy->GetRoot()));
	
	float memCost = 0;

	while (!tqueue.empty())
	{
		HierarchyNodeWrapper *nodeWrapper = tqueue.top();
		tqueue.pop();
		//cout << "priority: " << nodeWrapper->GetMergeCost() << endl;
		// save the view cells if it is a leaf or if enough view cells have already been traversed
		// because of the priority queue, this will be the optimal set of view cells
		if (nodeWrapper->IsLeaf() || 
			((viewCells.size() + bvhNodes.size() + tqueue.size() + 1) >= maxSplits) ||
			(memCost > maxMemoryCost)
			)
		{
			if (nodeWrapper->Type() == HierarchyNodeWrapper::VIEW_CELL)
			{
				//cout << "1";
				ViewCellWrapper *viewCellWrapper = static_cast<ViewCellWrapper *>(nodeWrapper);
				viewCells.push_back(viewCellWrapper->mViewCell);
			}
			else
			{
				//cout << "0";
				BvhNodeWrapper *bvhNodeWrapper = static_cast<BvhNodeWrapper *>(nodeWrapper);
				bvhNodes.push_back(bvhNodeWrapper->mNode);
			}
		}
		else 
		{	
			nodeWrapper->PushChildren(tqueue);
		}

		delete nodeWrapper;
	}
}


void HierarchyManager::ComputePvs(const ObjectPvs &pvs, 
								  float &triangles, 
								  int &pvsEntries)
{
	BvhNode::NewMail();

	ObjectPvsIterator pit = pvs.GetIterator();

	while (pit.HasMoreEntries())
	{
		Intersectable *obj = pit.Next();

		if (obj->Type() != Intersectable::BVH_INTERSECTABLE)
		{
			cout << "error: wrong object type detected: " << obj->Type() << endl;
			exit(0);
		}

		BvhNode *intersect = static_cast<BvhNode *>(obj);
		BvhNode *activeNode;

		// hack for choosing which node to account for
		if (intersect->IsLeaf())
		{
			activeNode = 
				static_cast<BvhLeaf *>(intersect)->GetActiveNode();
		}
		else
		{
			activeNode = intersect;
		}

		if (!activeNode->Mailed())
		{
			activeNode->Mail();

#if STUPID_METHOD

			ObjectContainer objects;
            activeNode->CollectObjects(objects);
			triangles += (float)objects.size();
#else
			triangles += mBvHierarchy->GetTriangleSizeIncrementially(activeNode);
#endif
			++ pvsEntries;
		}
	}
}


void HierarchyManager::GetPvsEfficiently(ViewCell *viewCell, ObjectPvs &pvs) const
{
	////////////////
	//-- pvs is not stored with the interiors => reconstruct
	
	// add pvs from leaves
	stack<ViewCell *> tstack;
	tstack.push(viewCell);

	Intersectable::NewMail();

	while (!tstack.empty())
	{
		ViewCell *vc = tstack.top();
		tstack.pop();
	
		// add newly found pvs to merged pvs: break here even for interior
		if (!vc->GetPvs().Empty())
		{
			ObjectPvsIterator pit = vc->GetPvs().GetIterator();

			while (pit.HasMoreEntries())
			{		
				Intersectable *object = pit.Next();

				if (!object->Mailed())
				{
					object->Mail();
					pvs.AddSampleDirty(object, 1.0f);
				}
			}
		}
		else if (!vc->IsLeaf()) // interior cells: go down to leaf level
		{
			ViewCellInterior *interior = static_cast<ViewCellInterior *>(vc);
			ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();

			for (it = interior->mChildren.begin(); it != it_end; ++ it)
			{
				tstack.push(*it);
			}		
		}
	}
}


// TODO matt: implement this function for different storing methods
void HierarchyManager::GetPvsIncrementially(ViewCell *vc, ObjectPvs &pvs) const
{
	////////////////
	//-- pvs is not stored with the interiors => reconstruct
	
	// add pvs from leaves
	stack<ViewCell *> tstack;
	tstack.push(vc);

	while (!tstack.empty())
	{
		vc = tstack.top();
		tstack.pop();
	
		// add newly found pvs to merged pvs: break here even for interior
		if (!vc->GetPvs().Empty())
		{
			pvs.MergeInPlace(vc->GetPvs());
		}
		else if (!vc->IsLeaf()) // interior cells: go down to leaf level
		{
			ViewCellInterior *interior = static_cast<ViewCellInterior *>(vc);
			ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();

			for (it = interior->mChildren.begin(); it != it_end; ++ it)
			{
				tstack.push(*it);
			}		
		}
	}
}


// TODO matt: implement this function for different storing methods
void HierarchyManager::PullUpPvsIncrementally(ViewCell *viewCell) const
{
	////////////////
	//-- pvs is not stored with the interiors => reconstruct
	
	// early exit: pvs is already pulled up to this view cell
	if (!viewCell->GetPvs().Empty())
		return;

	// add pvs from leaves
	stack<ViewCell *> tstack;
	tstack.push(viewCell);

	ViewCell *vc = viewCell;

	while (!tstack.empty())
	{
		vc = tstack.top();
		tstack.pop();
	
		// add newly found pvs to merged pvs: break here even for interior
		if (!vc->GetPvs().Empty())
		{
			viewCell->GetPvs().MergeInPlace(vc->GetPvs());
		}
		else if (!vc->IsLeaf()) // interior cells: go down to leaf level
		{
			//cout <<" t";
			ViewCellInterior *interior = static_cast<ViewCellInterior *>(vc);
			ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();

			for (it = interior->mChildren.begin(); it != it_end; ++ it)
			{
				tstack.push(*it);
			}		
		}
	}
}



// TODO matt: implement this function for different storing methods
void HierarchyManager::GetPvsRecursive(ViewCell *vc, ObjectPvs &pvs) const
{
	////////////////
	//-- pvs is not stored with the interiors => reconstruct
	if (vc->IsLeaf() || !vc->GetPvs().Empty())
	{
		pvs = vc->GetPvs();
	}
	else
	{
		ViewCellInterior *interior = static_cast<ViewCellInterior *>(vc);
#if 0
		ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
		const int childPvsSize = (int)interior->mChildren.size();
		vector<ObjectPvs> childPvs;
		childPvs.resize((int)interior->mChildren.size());

		int i = 0;
		for (it = interior->mChildren.begin(); it != it_end; ++ it, ++ i)
		{
			GetPvsRecursive(*it, childPvs[i]);
			pvs.MergeInPlace(childPvs[i]);
		}
#else

		ObjectPvs leftPvs, rightPvs;

		GetPvsRecursive(interior->mChildren[0], leftPvs);
		GetPvsRecursive(interior->mChildren[1], rightPvs);

		ObjectPvs::Merge(pvs, leftPvs, rightPvs);
#endif
	}
}


int HierarchyManager::ExtractStatistics(const int maxSplits,
										const float maxMemoryCost,
										float &renderCost,
										float &memory,
										int &pvsEntries,
										int &viewSpaceSplits,
										int &objectSpaceSplits,
										const bool useFilter,
										const bool useHisto,
										const int histoMem,
										const int pass,
										bool &histoUsed)
{
	ViewCellContainer viewCells;
	vector<BvhNode *> bvhNodes;

	// collect best set of view cells for this #splits
    CollectBestSet(maxSplits, maxMemoryCost, viewCells, bvhNodes);
	vector<BvhNode *>::const_iterator bit, bit_end = bvhNodes.end();
	
	// set new nodes to be active
	for (bit = bvhNodes.begin(); bit != bit_end; ++ bit)
	{
		mBvHierarchy->SetActive(*bit);
	}

	ViewCellContainer::const_iterator vit, vit_end = viewCells.end();

	pvsEntries = 0;
	renderCost = 0.0f;

	ViewCell::NewMail();

	//cout << "\nviewcells: " << viewCells.size() << endl;
	for (vit = viewCells.begin(); vit != vit_end; ++ vit)
	{
		ViewCell *vc = *vit;
		
#if STUPID_METHOD	
		ObjectPvs pvs;
		GetPvsIncrementially(vc, pvs);
		vc->SetPvs(pvs);
		
#else
	
		ObjectPvs pvs;
				
		if (vc->GetPvs().Empty())
		{
			// warning: uses mailing, pvs not sorted!!
			GetPvsEfficiently(vc, pvs);
			//GetPvsRecursive(vc, pvs);
			vc->SetPvs(pvs);
		}
#endif

		vc->Mail();

		float triangles = 0;
		int entries = 0;

		if (useFilter)
		{
			const long startT = GetTime();
			
			ObjectPvs filteredPvs;
			GetViewCellsManager()->ApplyFilter2(vc, false, 1.0f, filteredPvs);

			const long endT = GetTime();

			//cout << "filter computed in " << TimeDiff(startT, endT) * 1e-3f << " secs" << endl;
			
			ComputePvs(filteredPvs, triangles, entries);
		}
		else
		{
			ComputePvs(vc->GetPvs(), triangles, entries);
			vc->SetTrianglesInPvs(triangles);
		}

		const float rc = GetViewCellsManager()->ComputeRenderCost((int)triangles, entries) * vc->GetVolume();
		
		renderCost += rc;
		pvsEntries += entries;
	}

	renderCost /= GetViewCellsManager()->GetViewSpaceBox().GetVolume();
	memory = pvsEntries * ObjectPvs::GetEntrySize();

	viewSpaceSplits = (int)viewCells.size();
	objectSpaceSplits = (int)bvhNodes.size();

	////////////////////////
    //-- evaluate histogram for pvs size

	if (useHisto && (memory <= (float)histoMem))
	{
		char str[100];
		char statsPrefix[100];
		//int histoStepSize;

		Environment::GetSingleton()->GetStringValue("ViewCells.Evaluation.statsPrefix", statsPrefix);
	
		cout << "computing pvs histogram for " << histoMem << " memory" << endl;
		Debug << "computing pvs histogram for " << histoMem << " memory" << endl;
		
		sprintf(str, "-%05d-%05d-histo-pvs.log", pass, histoMem);
		const string filename = string(statsPrefix) + string(str);

		GetViewCellsManager()->EvalViewCellHistogramForPvsSize(filename, viewCells);

		histoUsed = true;
	}

	//cout << "viewCells: " << (int)viewCells.size() << " nodes: " << (int)bvhNodes.size() << " rc: " << renderCost << " entries: " << pvsEntries << endl;

	// delete old "base" view cells if they are not leaves
	ViewCellContainer::const_iterator oit, oit_end = mOldViewCells.end();

	for (oit = mOldViewCells.begin(); oit != oit_end; ++ oit)
	{
		if (!(*oit)->Mailed() && !(*oit)->IsLeaf())
		{
			(*oit)->GetPvs().Clear();
		}
	}

	// store current level
	mOldViewCells = viewCells;

	return (int)(viewCells.size() + bvhNodes.size());
}



void HierarchyManager::EvaluateSubdivision(ofstream &splitsStats,
										   const int splitsStepSize,
										   const bool useFilter,
										   const bool useHisto,
										   const int histoMem,
										   const int pass)
{
	vector<HierarchySubdivisionStats> subStatsContainer;

	int splits = (1 + (mHierarchyStats.Leaves() - 1) / splitsStepSize) * splitsStepSize;
	cout << "splits: " << splits << endl;

	bool histoUsed = false;

	while (1)
	{
		HierarchySubdivisionStats subStats;
		subStats.mNumSplits = ExtractStatistics(splits, 
												99999.0, 
												subStats.mTotalRenderCost, 
												subStats.mMemoryCost, 
												subStats.mEntriesInPvs,
												subStats.mViewSpaceSplits,
												subStats.mObjectSpaceSplits,
												useFilter,
												useHisto && !histoUsed,
												histoMem,
												pass,
												histoUsed);

		
		const float objectSpaceHierarchyMem = float(
											  subStats.mObjectSpaceSplits * mBvHierarchy->mMemoryConst//sizeof(ObjectContainer)
											  //+ (subStats.mObjectSpaceSplits - 1) * sizeof(BvhInterior)
											  //+sizeof(BvHierarchy)
											  ) / float(1024 * 1024);

			
		const float viewSpaceHierarchyMem = float(
											subStats.mViewSpaceSplits * mVspTree->mMemoryConst//sizeof(ObjectPvs)
											//+ (subStats.mViewSpaceSplits - 1) * sizeof(VspInterior)
											+ sizeof(ObjectPvs)
											//+ sizeof(VspTree)
											)  / float(1024 * 1024);

		subStats.mFullMemory = subStats.mMemoryCost + objectSpaceHierarchyMem + viewSpaceHierarchyMem;
		
		subStatsContainer.push_back(subStats);
		
		if (splits == 0)
		{
			break;
		}
		splits -= splitsStepSize;

		cout << "splits: " << subStats.mNumSplits << " ";
	}

	vector<HierarchySubdivisionStats>::const_reverse_iterator hit, hit_end = subStatsContainer.rend();

	for (hit = subStatsContainer.rbegin(); hit != hit_end; ++ hit)
	{
		(*hit).Print(splitsStats);
	}

	// delete old "base" view cells: only pvss in the leaves are allowed
	ViewCellContainer::const_iterator oit, oit_end = mOldViewCells.end();

	for (oit = mOldViewCells.begin(); oit != oit_end; ++ oit)
	{
		if (!(*oit)->IsLeaf())
		{
			(*oit)->GetPvs().Clear();
		}
	}

	mOldViewCells.clear();

	// reset active nodes
	vector<BvhLeaf *> bvhLeaves;

	mBvHierarchy->CollectLeaves(mBvHierarchy->GetRoot(), bvhLeaves);

	vector<BvhLeaf *>::const_iterator bit, bit_end = bvhLeaves.end();

	for (bit = bvhLeaves.begin(); bit != bit_end; ++ bit)
	{
		(*bit)->SetActiveNode(*bit);
	}

	cout << endl;
}


void HierarchyManager::CollectObjects(const AxisAlignedBox3 &box, ObjectContainer &objects)
{
	mBvHierarchy->CollectObjects(box, objects);
}


int HierarchyManager::CompressObjectSpace()
{
	//mBvHierarchy->Compress();
	return mVspTree->CompressObjects();
}


void HierarchyManager::CreateUniqueObjectIds()
{
	mBvHierarchy->CreateUniqueObjectIds();
}


void HierarchyManager::CreateTraversalTree()
{
	int mind, maxd;
	mVspTree->EvalMinMaxDepth(mind, maxd);

	cout << "old tree balance: " << mind << " " << maxd << endl;
	mTraversalTree = new TraversalTree;

	ViewCellContainer viewCells;
	mVspTree->CollectViewCells(viewCells, false);

	const long startTime = GetTime();
	
	cout << "building traversal tree ... " << endl;

	mTraversalTree->Construct(viewCells);

	cout << "finished traversal tree construction in " << TimeDiff(startTime, GetTime()) * 1e-3 
		 << " secs " << endl;

	Debug << "*** TraversalTree Stats ***" << endl;
	Debug << mTraversalTree->GetStatistics() << endl;

	if (1) 
	{
		Exporter *exporter = Exporter::GetExporter("traversal.wrl");
		exporter->ExportTraversalTree(*mTraversalTree, true);
		delete exporter;
	}
}


int HierarchyManager::CastLineSegment(const Vector3 &origin,
									  const Vector3 &termination,
									  ViewCellContainer &viewcells,
									  const bool useMailboxing)
{
	if (!mTraversalTree)
	{
		return mVspTree->CastLineSegment(origin, termination, viewcells, useMailboxing);
	}
	else
	{
		return mTraversalTree->CastLineSegment(origin, termination, viewcells, useMailboxing);
	}
}


ViewCellsManager *HierarchyManager::GetViewCellsManager() 
{
	return mVspTree->mViewCellsManager;
}

#ifdef USE_SSE
int HierarchyManager::CastLineSegment(RayPacket &packet)
{
	return mVspTree->TraverseRayPacket(packet, true);
}

#endif

}