Context Navigation

source: GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.cpp @ 1709

Revision 1709, 59.8 KB checked in by mattausch, 18 years ago (diff)

Line
1	#include <stack>
2	#include <time.h>
3	#include <iomanip>
4
5	#include "BvHierarchy.h"
6	#include "ViewCell.h"
7	#include "Plane3.h"
8	#include "Mesh.h"
9	#include "common.h"
10	#include "Environment.h"
11	#include "Polygon3.h"
12	#include "Ray.h"
13	#include "AxisAlignedBox3.h"
14	#include "Exporter.h"
15	#include "Plane3.h"
16	#include "ViewCellsManager.h"
17	#include "Beam.h"
18	#include "VspTree.h"
19	#include "HierarchyManager.h"
20
21
22	namespace GtpVisibilityPreprocessor {
23
24
25	#define PROBABILIY_IS_BV_VOLUME 1
26	#define USE_FIXEDPOINT_T 0
27	#define USE_VOLUMES_FOR_HEURISTICS 1
28
29	int BvhNode::sMailId = 10000; //2147483647;
30	int BvhNode::sReservedMailboxes = 1;
31
32	BvHierarchy *BvHierarchy::BvhSubdivisionCandidate::sBvHierarchy = NULL;
33
34
35	/// sorting operator
36	inline static bool ilt(Intersectable obj1, Intersectable obj2)
37	{
38	return obj1->mId < obj2->mId;
39	}
40
41
42	/***************************************************************/
43	/* class BvhNode implementation */
44	/***************************************************************/
45
46	BvhNode::BvhNode():
47	mParent(NULL),
48	mMailbox(0),
49	mRenderCostDecr(0),
50	mMemoryIncr(0),
51	mPvsEntriesIncr(0),
52	mTimeStamp(0)
53	{
54
55	}
56
57	BvhNode::BvhNode(const AxisAlignedBox3 &bbox):
58	mParent(NULL),
59	mBoundingBox(bbox),
60	mMailbox(0),
61	mMemoryIncr(0),
62	mRenderCostDecr(0),
63	mPvsEntriesIncr(0),
64	mTimeStamp(0)
65	{
66	}
67
68
69	BvhNode::BvhNode(const AxisAlignedBox3 &bbox, BvhInterior *parent):
70	mBoundingBox(bbox),
71	mParent(parent),
72	mMailbox(0),
73	mMemoryIncr(0),
74	mRenderCostDecr(0),
75	mPvsEntriesIncr(0),
76	mTimeStamp(0)
77	{
78	}
79
80
81	bool BvhNode::IsRoot() const
82	{
83	return mParent == NULL;
84	}
85
86
87	BvhInterior *BvhNode::GetParent()
88	{
89	return mParent;
90	}
91
92
93	void BvhNode::SetParent(BvhInterior *parent)
94	{
95	mParent = parent;
96	}
97
98
99
100	/******************************************************************/
101	/* class BvhInterior implementation */
102	/******************************************************************/
103
104
105	BvhLeaf::BvhLeaf(const AxisAlignedBox3 &bbox):
106	BvhNode(bbox),
107	mSubdivisionCandidate(NULL)
108	{
109	mActiveNode = this;
110	}
111
112
113	BvhLeaf::BvhLeaf(const AxisAlignedBox3 &bbox, BvhInterior *parent):
114	BvhNode(bbox, parent)
115	{
116	mActiveNode = this;
117	}
118
119
120	BvhLeaf::BvhLeaf(const AxisAlignedBox3 &bbox,
121	BvhInterior *parent,
122	const int numObjects):
123	BvhNode(bbox, parent)
124	{
125	mObjects.reserve(numObjects);
126	mActiveNode = this;
127	}
128
129
130	bool BvhLeaf::IsLeaf() const
131	{
132	return true;
133	}
134
135
136	BvhLeaf::~BvhLeaf()
137	{
138	}
139
140
141	void BvhLeaf::CollectObjects(ObjectContainer &objects)
142	{
143	ObjectContainer::const_iterator oit, oit_end = mObjects.end();
144	for (oit = mObjects.begin(); oit != oit_end; ++ oit)
145	{
146	objects.push_back(*oit);
147	}
148	}
149
150	/******************************************************************/
151	/* class BvhInterior implementation */
152	/******************************************************************/
153
154
155	BvhInterior::BvhInterior(const AxisAlignedBox3 &bbox):
156	BvhNode(bbox), mFront(NULL), mBack(NULL)
157	{
158	}
159
160
161	BvhInterior::BvhInterior(const AxisAlignedBox3 &bbox, BvhInterior *parent):
162	BvhNode(bbox, parent), mFront(NULL), mBack(NULL)
163	{
164	}
165
166
167	void BvhInterior::ReplaceChildLink(BvhNode oldChild, BvhNode newChild)
168	{
169	if (mBack == oldChild)
170	mBack = newChild;
171	else
172	mFront = newChild;
173	}
174
175
176	bool BvhInterior::IsLeaf() const
177	{
178	return false;
179	}
180
181
182	BvhInterior::~BvhInterior()
183	{
184	DEL_PTR(mFront);
185	DEL_PTR(mBack);
186	}
187
188
189	void BvhInterior::SetupChildLinks(BvhNode front, BvhNode back)
190	{
191	mBack = back;
192	mFront = front;
193	}
194
195
196	void BvhInterior::CollectObjects(ObjectContainer &objects)
197	{
198	mFront->CollectObjects(objects);
199	mBack->CollectObjects(objects);
200	}
201
202
203	/*******************************************************************/
204	/* class BvHierarchy implementation */
205	/*******************************************************************/
206
207
208	BvHierarchy::BvHierarchy():
209	mRoot(NULL),
210	mTimeStamp(1)
211	{
212	ReadEnvironment();
213	mSubdivisionCandidates = new SortableEntryContainer;
214	for (int i = 0; i < 3; ++ i)
215	mSortedObjects[i] = NULL;
216	}
217
218
219	BvHierarchy::~BvHierarchy()
220	{
221	// delete bvh intersectables
222	BvhIntersectableMap::iterator it, it_end = mBvhIntersectables.end();
223
224	for (it = mBvhIntersectables.begin(); it != mBvhIntersectables.end(); ++ it)
225	{
226	DEL_PTR((*it).second);
227	}
228
229	// delete the local subdivision candidates
230	DEL_PTR(mSubdivisionCandidates);
231
232	// delete the presorted objects
233	for (int i = 0; i < 3; ++ i)
234	{
235	DEL_PTR(mSortedObjects[i]);
236	}
237
238	// delete the tree
239	DEL_PTR(mRoot);
240	}
241
242
243	void BvHierarchy::ReadEnvironment()
244	{
245	bool randomize = false;
246	Environment::GetSingleton()->GetBoolValue("VspTree.Construction.randomize", randomize);
247
248	// initialise random generator for heuristics
249	if (randomize)
250	Randomize();
251
252	//////////////////////////////
253	//-- termination criteria for autopartition
254
255	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.maxDepth", mTermMaxDepth);
256	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.maxLeaves", mTermMaxLeaves);
257	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.minObjects", mTermMinObjects);
258	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.minRays", mTermMinRays);
259	Environment::GetSingleton()->GetFloatValue(
260	"BvHierarchy.Termination.minProbability", mTermMinProbability);
261	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.missTolerance", mTermMissTolerance);
262
263
264	//////////////////////////////
265	//-- max cost ratio for early tree termination
266
267	Environment::GetSingleton()->GetFloatValue("BvHierarchy.Termination.maxCostRatio", mTermMaxCostRatio);
268	Environment::GetSingleton()->GetFloatValue("BvHierarchy.Termination.minGlobalCostRatio",
269	mTermMinGlobalCostRatio);
270	Environment::GetSingleton()->GetIntValue("BvHierarchy.Termination.globalCostMissTolerance",
271	mTermGlobalCostMissTolerance);
272
273
274	//////////////////////////////
275	//-- factors for subdivision heuristics
276
277	// if only the driving axis is used for splits
278	Environment::GetSingleton()->GetBoolValue("BvHierarchy.splitUseOnlyDrivingAxis", mOnlyDrivingAxis);
279	Environment::GetSingleton()->GetFloatValue("BvHierarchy.maxStaticMemory", mMaxMemory);
280	Environment::GetSingleton()->GetBoolValue("BvHierarchy.useCostHeuristics", mUseCostHeuristics);
281	Environment::GetSingleton()->GetBoolValue("BvHierarchy.useSah", mUseSah);
282
283	char subdivisionStatsLog[100];
284	Environment::GetSingleton()->GetStringValue("BvHierarchy.subdivisionStats", subdivisionStatsLog);
285	mSubdivisionStats.open(subdivisionStatsLog);
286
287	Environment::GetSingleton()->GetFloatValue(
288	"BvHierarchy.Construction.renderCostDecreaseWeight", mRenderCostDecreaseWeight);
289
290	Environment::GetSingleton()->GetBoolValue(
291	"BvHierarchy.Construction.useGlobalSorting", mUseGlobalSorting);
292
293	Environment::GetSingleton()->GetIntValue("BvHierarchy.minRaysForVisibility", mMinRaysForVisibility);
294
295	mUseBboxAreaForSah = true;
296
297
298	/////////////
299	//-- debug output
300
301	Debug << "***** Bvh hierarchy options ****** " << endl;
302	Debug << "max depth: " << mTermMaxDepth << endl;
303	Debug << "min probabiliy: " << mTermMinProbability<< endl;
304	Debug << "min objects: " << mTermMinObjects << endl;
305	Debug << "max cost ratio: " << mTermMaxCostRatio << endl;
306	Debug << "miss tolerance: " << mTermMissTolerance << endl;
307	Debug << "max leaves: " << mTermMaxLeaves << endl;
308	Debug << "randomize: " << randomize << endl;
309	Debug << "min global cost ratio: " << mTermMinGlobalCostRatio << endl;
310	Debug << "global cost miss tolerance: " << mTermGlobalCostMissTolerance << endl;
311	Debug << "only driving axis: " << mOnlyDrivingAxis << endl;
312	Debug << "max memory: " << mMaxMemory << endl;
313	Debug << "use cost heuristics: " << mUseCostHeuristics << endl;
314	Debug << "use sah (surface area heuristics: " << mUseSah << endl;
315	Debug << "subdivision stats log: " << subdivisionStatsLog << endl;
316	Debug << "split borders: " << mSplitBorder << endl;
317	Debug << "render cost decrease weight: " << mRenderCostDecreaseWeight << endl;
318	Debug << "use global sort: " << mUseGlobalSorting << endl;
319	Debug << "minimal rays for visibility: " << mMinRaysForVisibility << endl;
320
321	Debug << endl;
322	}
323
324
325	void BvHierarchy::AssociateObjectsWithLeaf(BvhLeaf *leaf)
326	{
327	ObjectContainer::const_iterator oit, oit_end = leaf->mObjects.end();
328
329	for (oit = leaf->mObjects.begin(); oit != oit_end; ++ oit)
330	{
331	(*oit)->mBvhLeaf = leaf;
332	}
333	}
334
335
336	static int CountRays(const ObjectContainer &objects)
337	{
338	int nRays = 0;
339
340	ObjectContainer::const_iterator oit, oit_end = objects.end();
341
342	for (oit = objects.begin(); oit != oit_end; ++ oit)
343	{
344	nRays += (int)(*oit)->GetOrCreateRays()->size();
345	}
346
347	return nRays;
348	}
349
350
351	BvhInterior *BvHierarchy::SubdivideNode(const BvhSubdivisionCandidate &sc,
352	BvhTraversalData &frontData,
353	BvhTraversalData &backData)
354	{
355	const BvhTraversalData &tData = sc.mParentData;
356	BvhLeaf *leaf = tData.mNode;
357	AxisAlignedBox3 parentBox = leaf->GetBoundingBox();
358
359	// update stats: we have two new leaves
360	mBvhStats.nodes += 2;
361
362	if (tData.mDepth > mBvhStats.maxDepth)
363	{
364	mBvhStats.maxDepth = tData.mDepth;
365	}
366
367	// add the new nodes to the tree
368	BvhInterior *node = new BvhInterior(parentBox, leaf->GetParent());
369
370
371	//////////////////
372	//-- create front and back leaf
373
374	AxisAlignedBox3 fbox = EvalBoundingBox(sc.mFrontObjects, &parentBox);
375	AxisAlignedBox3 bbox = EvalBoundingBox(sc.mBackObjects, &parentBox);
376
377	BvhLeaf *back = new BvhLeaf(bbox, node, (int)sc.mBackObjects.size());
378	BvhLeaf *front = new BvhLeaf(fbox, node, (int)sc.mFrontObjects.size());
379
380	BvhInterior *parent = leaf->GetParent();
381
382	// replace a link from node's parent
383	if (parent)
384	{
385	parent->ReplaceChildLink(leaf, node);
386	node->SetParent(parent);
387	}
388	else // no parent => this node is the root
389	{
390	mRoot = node;
391	}
392
393	// and setup child links
394	node->SetupChildLinks(front, back);
395
396	++ mBvhStats.splits;
397
398
399	////////////////////////////////////////
400	//-- fill front and back traversal data with the new values
401
402	frontData.mDepth = backData.mDepth = tData.mDepth + 1;
403
404	frontData.mNode = front;
405	backData.mNode = back;
406
407	back->mObjects = sc.mBackObjects;
408	front->mObjects = sc.mFrontObjects;
409
410	// if the number of rays is too low, no assumptions can be made
411	// (=> switch to surface area heuristics?)
412	frontData.mNumRays = CountRays(sc.mFrontObjects);
413	backData.mNumRays = CountRays(sc.mBackObjects);
414
415	AssociateObjectsWithLeaf(back);
416	AssociateObjectsWithLeaf(front);
417
418	#if PROBABILIY_IS_BV_VOLUME
419	// volume of bvh (= probability that this bvh can be seen)
420	frontData.mProbability = fbox.GetVolume();
421	backData.mProbability = bbox.GetVolume();
422	#else
423	// compute probability of this node being visible,
424	// i.e., volume of the view cells that can see this node
425	frontData.mProbability = EvalViewCellsVolume(sc.mFrontObjects);
426	backData.mProbability = EvalViewCellsVolume(sc.mBackObjects);
427	#endif
428
429	// how often was max cost ratio missed in this branch?
430	frontData.mMaxCostMisses = sc.GetMaxCostMisses();
431	backData.mMaxCostMisses = sc.GetMaxCostMisses();
432
433	// set the time stamp so the order of traversal can be reconstructed
434	node->mTimeStamp = mHierarchyManager->mTimeStamp ++;
435
436	// assign the objects in sorted order
437	if (mUseGlobalSorting)
438	{
439	AssignSortedObjects(sc, frontData, backData);
440	}
441
442	// return the new interior node
443	return node;
444	}
445
446
447	BvhNode *BvHierarchy::Subdivide(SplitQueue &tQueue,
448	SubdivisionCandidate *splitCandidate,
449	const bool globalCriteriaMet)
450	{
451	BvhSubdivisionCandidate sc = dynamic_cast<BvhSubdivisionCandidate >(splitCandidate);
452	BvhTraversalData &tData = sc->mParentData;
453
454	BvhNode *currentNode = tData.mNode;
455
456	if (!LocalTerminationCriteriaMet(tData) && !globalCriteriaMet)
457	{
458	//////////////
459	//-- continue subdivision
460
461	BvhTraversalData tFrontData;
462	BvhTraversalData tBackData;
463
464	// create new interior node and two leaf node
465	currentNode = SubdivideNode(*sc, tFrontData, tBackData);
466
467	// decrease the weighted average cost of the subdivisoin
468	mTotalCost -= sc->GetRenderCostDecrease();
469	mPvsEntries += sc->GetPvsEntriesIncr();
470
471	// subdivision statistics
472	if (1) PrintSubdivisionStats(*sc);
473
474
475	///////////////////////////
476	//-- push the new split candidates on the queue
477
478	BvhSubdivisionCandidate *frontCandidate = new BvhSubdivisionCandidate(tFrontData);
479	BvhSubdivisionCandidate *backCandidate = new BvhSubdivisionCandidate(tBackData);
480
481	EvalSubdivisionCandidate(*frontCandidate);
482	EvalSubdivisionCandidate(*backCandidate);
483
484	// cross reference
485	tFrontData.mNode->SetSubdivisionCandidate(frontCandidate);
486	tBackData.mNode->SetSubdivisionCandidate(backCandidate);
487
488	//cout << "f: " << frontCandidate->GetPriority() << " b: " << backCandidate->GetPriority() << endl;
489	tQueue.Push(frontCandidate);
490	tQueue.Push(backCandidate);
491	}
492
493	/////////////////////////////////
494	//-- node is a leaf => terminate traversal
495
496	if (currentNode->IsLeaf())
497	{
498	/////////////////////
499	//-- store additional info
500	EvaluateLeafStats(tData);
501
502	const bool mStoreRays = true;
503	if (mStoreRays)
504	{
505	BvhLeaf leaf = dynamic_cast<BvhLeaf >(currentNode);
506	CollectRays(leaf->mObjects, leaf->mVssRays);
507	}
508
509	//////////////////////////////////////
510
511	// this leaf is no candidate for splitting anymore
512	// => detach subdivision candidate
513	tData.mNode->SetSubdivisionCandidate(NULL);
514	// detach node so we don't delete it with the traversal data
515	tData.mNode = NULL;
516	}
517
518	return currentNode;
519	}
520
521
522	void BvHierarchy::EvalSubdivisionCandidate(BvhSubdivisionCandidate &splitCandidate,
523	bool computeSplitPlane)
524	{
525	if (computeSplitPlane)
526	{
527	const bool sufficientSamples =
528	splitCandidate.mParentData.mNumRays > mMinRaysForVisibility;
529
530	const bool useVisibiliyBasedHeuristics =
531	!mUseSah &&
532	(mHierarchyManager->GetViewSpaceSubdivisionType() ==
533	HierarchyManager::KD_BASED_VIEWSPACE_SUBDIV) &&
534	sufficientSamples;
535
536	// compute best object partition
537	const float ratio = SelectObjectPartition(splitCandidate.mParentData,
538	splitCandidate.mFrontObjects,
539	splitCandidate.mBackObjects,
540	useVisibiliyBasedHeuristics);
541
542	// cost ratio violated?
543	const bool maxCostRatioViolated = mTermMaxCostRatio < ratio;
544	const int previousMisses = splitCandidate.mParentData.mMaxCostMisses;
545
546	splitCandidate.SetMaxCostMisses(maxCostRatioViolated ? previousMisses + 1 : previousMisses);
547
548	}
549
550	BvhLeaf *leaf = splitCandidate.mParentData.mNode;
551
552	const float oldProp = EvalViewCellsVolume(leaf->mObjects);
553	const float oldRenderCost = EvalRenderCost(leaf->mObjects);
554
555	// compute global decrease in render cost
556	const float newRenderCost = EvalRenderCost(splitCandidate.mFrontObjects) +
557	EvalRenderCost(splitCandidate.mBackObjects);
558
559	const float renderCostDecr = oldRenderCost - newRenderCost;
560
561	splitCandidate.SetRenderCostDecrease(renderCostDecr);
562
563	// increase in pvs entries
564	const int pvsEntriesIncr = EvalPvsEntriesIncr(splitCandidate);
565	splitCandidate.SetPvsEntriesIncr(pvsEntriesIncr);
566
567	#ifdef _DEBUG
568	Debug << "old render cost: " << oldRenderCost << endl;
569	Debug << "new render cost: " << newRenderCost << endl;
570	Debug << "render cost decrease: " << renderCostDecr << endl;
571	#endif
572
573	float priority;
574
575	// surface area heuristics is used when there is no view space subdivision available.
576	// In order to have some prioritized traversal, use this formula instead
577	if (mHierarchyManager->GetViewSpaceSubdivisionType() ==
578	HierarchyManager::NO_VIEWSPACE_SUBDIV)
579	{
580	priority = EvalSahCost(leaf);
581	}
582	else
583	{
584	// take render cost of node into account
585	// otherwise danger of being stuck in a local minimum!
586	const float factor = mRenderCostDecreaseWeight;
587	priority = factor * renderCostDecr + (1.0f - factor) * oldRenderCost;
588
589	if (mHierarchyManager->mConsiderMemory2)
590	{
591	priority /= ((float)splitCandidate.GetPvsEntriesIncr() + mHierarchyManager->mMemoryConst);
592	}
593	}
594
595	// compute global decrease in render cost
596	splitCandidate.SetPriority(priority);
597	}
598
599
600	int BvHierarchy::EvalPvsEntriesIncr(BvhSubdivisionCandidate &splitCandidate) const
601	{
602	const int oldPvsSize = CountViewCells(splitCandidate.mParentData.mNode->mObjects);
603
604	const int fPvsSize = CountViewCells(splitCandidate.mFrontObjects);
605	const int bPvsSize = CountViewCells(splitCandidate.mBackObjects);
606
607	return fPvsSize + bPvsSize - oldPvsSize;
608	}
609
610
611	inline bool BvHierarchy::LocalTerminationCriteriaMet(const BvhTraversalData &data) const
612	{
613	const bool terminationCriteriaMet =
614	(0
615	\|\| ((int)data.mNode->mObjects.size() <= 1)//mTermMinObjects)
616	//\|\| (data.mProbability <= mTermMinProbability)
617	//\|\| (data.mNumRays <= mTermMinRays)
618	);
619
620	#ifdef _DEBUG
621	if (terminationCriteriaMet)
622	{
623	cout << "bvh local termination criteria met:" << endl;
624	cout << "objects: " << data.mNode->mObjects.size() << " " << mTermMinObjects << endl;
625	}
626	#endif
627	return terminationCriteriaMet;
628	}
629
630
631	inline bool BvHierarchy::GlobalTerminationCriteriaMet(const BvhTraversalData &data) const
632	{
633	// note: tracking for global cost termination
634	// does not make much sense for interleaved vsp / osp partition
635	// as it is the responsibility of the hierarchy manager
636
637	const bool terminationCriteriaMet =
638	(0
639	\|\| (mBvhStats.Leaves() >= mTermMaxLeaves)
640	//\|\| (mBvhStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
641	//\|\| mOutOfMemory
642	);
643
644	#ifdef _DEBUG
645	if (terminationCriteriaMet)
646	{
647	Debug << "bvh global termination criteria met:" << endl;
648	Debug << "cost misses: " << mBvhStats.mGlobalCostMisses << " " << mTermGlobalCostMissTolerance << endl;
649	Debug << "leaves: " << mBvhStats.Leaves() << " " << mTermMaxLeaves << endl;
650	}
651	#endif
652	return terminationCriteriaMet;
653	}
654
655
656	void BvHierarchy::EvaluateLeafStats(const BvhTraversalData &data)
657	{
658	// the node became a leaf -> evaluate stats for leafs
659	BvhLeaf *leaf = data.mNode;
660
661	++ mCreatedLeaves;
662
663
664	if (data.mProbability <= mTermMinProbability)
665	{
666	++ mBvhStats.minProbabilityNodes;
667	}
668
669	////////////////////////////////////////////
670	// depth related stuff
671
672	if (data.mDepth < mBvhStats.minDepth)
673	{
674	mBvhStats.minDepth = data.mDepth;
675	}
676
677	if (data.mDepth >= mTermMaxDepth)
678	{
679	++ mBvhStats.maxDepthNodes;
680	}
681
682	// accumulate depth to compute average depth
683	mBvhStats.accumDepth += data.mDepth;
684
685
686	////////////////////////////////////////////
687	// objects related stuff
688
689	// note: the sum should alwaysbe total number of objects for bvh
690	mBvhStats.objectRefs += (int)leaf->mObjects.size();
691
692	if ((int)leaf->mObjects.size() <= mTermMinObjects)
693	{
694	++ mBvhStats.minObjectsNodes;
695	}
696
697	if (leaf->mObjects.empty())
698	{
699	++ mBvhStats.emptyNodes;
700	}
701
702	if ((int)leaf->mObjects.size() > mBvhStats.maxObjectRefs)
703	{
704	mBvhStats.maxObjectRefs = (int)leaf->mObjects.size();
705	}
706
707	if ((int)leaf->mObjects.size() < mBvhStats.minObjectRefs)
708	{
709	mBvhStats.minObjectRefs = (int)leaf->mObjects.size();
710	}
711
712	////////////////////////////////////////////
713	// ray related stuff
714
715	// note: this number should always accumulate to the total number of rays
716	mBvhStats.rayRefs += data.mNumRays;
717
718	if (data.mNumRays <= mTermMinRays)
719	{
720	++ mBvhStats.minRaysNodes;
721	}
722
723	if (data.mNumRays > mBvhStats.maxRayRefs)
724	{
725	mBvhStats.maxRayRefs = data.mNumRays;
726	}
727
728	if (data.mNumRays < mBvhStats.minRayRefs)
729	{
730	mBvhStats.minRayRefs = data.mNumRays;
731	}
732
733	#ifdef _DEBUG
734	cout << "depth: " << data.mDepth << " objects: " << (int)leaf->mObjects.size()
735	<< " rays: " << data.mNumRays << " rays / objects "
736	<< (float)data.mNumRays / (float)leaf->mObjects.size() << endl;
737	#endif
738	}
739
740
741	#if 0
742
743	/// compute object boundaries using spatial mid split
744	float BvHierarchy::EvalLocalObjectPartition(const BvhTraversalData &tData,
745	const int axis,
746	ObjectContainer &objectsFront,
747	ObjectContainer &objectsBack)
748	{
749	const float maxBox = tData.mBoundingBox.Max(axis);
750	const float minBox = tData.mBoundingBox.Min(axis);
751
752	float midPoint = (maxBox + minBox) * 0.5f;
753
754	ObjectContainer::const_iterator oit, oit_end = tData.mNode->mObjects.end();
755
756	for (oit = tData.mNode->mObjects.begin(); oit != oit_end; ++ oit)
757	{
758	Intersectable obj = oit;
759	const AxisAlignedBox3 box = obj->GetBox();
760
761	const float objMid = (box.Max(axis) + box.Min(axis)) * 0.5f;
762
763	// object mailed => belongs to back objects
764	if (objMid < midPoint)
765	{
766	objectsBack.push_back(obj);
767	}
768	else
769	{
770	objectsFront.push_back(obj);
771	}
772	}
773
774	const float oldRenderCost = EvalRenderCost(tData.mNode->mObjects);
775	const float newRenderCost = EvalRenderCost(objectsFront) * EvalRenderCost(objectsBack);
776
777	const float ratio = newRenderCost / oldRenderCost;
778	return ratio;
779	}
780
781	#else
782
783	/// compute object partition by getting balanced objects on the left and right side
784	float BvHierarchy::EvalLocalObjectPartition(const BvhTraversalData &tData,
785	const int axis,
786	ObjectContainer &objectsFront,
787	ObjectContainer &objectsBack)
788	{
789	PrepareLocalSubdivisionCandidates(tData, axis);
790
791	SortableEntryContainer::const_iterator cit, cit_end = mSubdivisionCandidates->end();
792
793	int i = 0;
794	const int border = (int)tData.mNode->mObjects.size() / 2;
795
796	for (cit = mSubdivisionCandidates->begin(); cit != cit_end; ++ cit, ++ i)
797	{
798	Intersectable obj = (cit).mObject;
799
800	// object mailed => belongs to back objects
801	if (i < border)
802	{
803	objectsBack.push_back(obj);
804	}
805	else
806	{
807	objectsFront.push_back(obj);
808	}
809	}
810
811	#if 1
812	const float cost = (tData.mNode->GetBoundingBox().Size().DrivingAxis() == axis) ? -1.0f : 0.0f;
813	#else
814	const float oldRenderCost = EvalRenderCost(tData.mNode->mObjects);
815	const float newRenderCost = EvalRenderCost(objectsFront) * EvalRenderCost(objectsBack);
816
817	const float cost = newRenderCost / oldRenderCost;
818	#endif
819
820	return cost;
821	}
822	#endif
823
824
825	float BvHierarchy::EvalSah(const BvhTraversalData &tData,
826	const int axis,
827	ObjectContainer &objectsFront,
828	ObjectContainer &objectsBack)
829	{
830	// go through the lists, count the number of objects left and right
831	// and evaluate the following cost funcion:
832	// C = ct_div_ci + (ol + or) / queries
833	PrepareLocalSubdivisionCandidates(tData, axis);
834
835	const float totalRenderCost = EvalAbsCost(tData.mNode->mObjects);
836	float objectsLeft = 0, objectsRight = totalRenderCost;
837
838	const AxisAlignedBox3 nodeBbox = tData.mNode->GetBoundingBox();
839
840	const float minBox = nodeBbox.Min(axis);
841	const float maxBox = nodeBbox.Max(axis);
842	const float boxArea = nodeBbox.SurfaceArea();
843
844	float minSum = 1e20f;
845
846	float minBorder = maxBox;
847	float maxBorder = minBox;
848	float areaLeft = 0, areaRight = 0;
849
850	SortableEntryContainer::const_iterator currentPos =
851	mSubdivisionCandidates->begin();
852
853	vector<float> bordersRight;
854
855	if (mUseBboxAreaForSah)
856	{
857	// we keep track of both borders of the bounding boxes =>
858	// store the events in descending order
859
860	bordersRight.resize(mSubdivisionCandidates->size());
861
862	SortableEntryContainer::reverse_iterator rcit =
863	mSubdivisionCandidates->rbegin(), rcit_end = mSubdivisionCandidates->rend();
864
865	vector<float>::reverse_iterator rbit = bordersRight.rbegin();
866
867	for (; rcit != rcit_end; ++ rcit, ++ rbit)
868	{
869	Intersectable obj = (rcit).mObject;
870	const AxisAlignedBox3 obox = obj->GetBox();
871
872	if (obox.Min(axis) < minBorder)
873	{
874	minBorder = obox.Min(axis);
875	}
876
877	(*rbit) = minBorder;
878	}
879	}
880
881	// temporary surface areas
882	float al = 0;
883	float ar = boxArea;
884
885	vector<float>::const_iterator bit = bordersRight.begin();
886	SortableEntryContainer::const_iterator cit, cit_end = mSubdivisionCandidates->end();
887
888	for (cit = mSubdivisionCandidates->begin(); cit != cit_end; ++ cit, ++ bit)
889	{
890	Intersectable obj = (cit).mObject;
891
892	const float renderCost = mViewCellsManager->EvalRenderCost(obj);
893	//const int renderCost = 1;
894
895	objectsLeft += renderCost;
896	objectsRight -= renderCost;
897
898	const AxisAlignedBox3 obox = obj->GetBox();
899
900	if (mUseBboxAreaForSah)
901	{
902	AxisAlignedBox3 lbox = nodeBbox;
903	AxisAlignedBox3 rbox = nodeBbox;
904
905	// the borders of the bounding boxes have changed
906	if (obox.Max(axis) > maxBorder)
907	{
908	maxBorder = obox.Max(axis);
909	}
910
911	minBorder = (*bit);
912
913	lbox.SetMax(axis, maxBorder);
914	rbox.SetMin(axis, minBorder);
915
916	al = lbox.SurfaceArea();
917	ar = rbox.SurfaceArea();
918	}
919	else
920	{
921	// just add up areas of the objects itself
922	// (as we are not sampling volumetric visibility,
923	// this should provide better heuristics
924	const float area = obj->GetArea();//obox.SurfaceArea();
925
926	al += area;
927	ar -= area;
928	}
929
930	const bool noValidSplit = ((objectsLeft <= Limits::Small) \|\| (objectsRight <= Limits::Small));
931
932	const float sum = noValidSplit ? 1e25 : objectsLeft * al + objectsRight * ar;
933
934	/cout << "pos=" << (cit).mPos << "\t q=(" << objectsLeft << "," << objectsRight <<")\t r=("
935	<< lbox.SurfaceArea() << "," << rbox.SurfaceArea() << ")" << endl;
936	cout << "minborder: " << minBorder << " maxborder: " << maxBorder << endl;
937	cout << "cost= " << sum << endl;
938	*/
939
940	if (sum < minSum)
941	{ //cout <<" sum: " << sum;
942	minSum = sum;
943	areaLeft = al;
944	areaRight = ar;
945
946	// objects belong to left side now
947	for (; currentPos != (cit + 1); ++ currentPos);
948	}
949	}
950
951	////////////////////////////////////////////
952	//-- assign object to front and back volume
953
954	// belongs to back bv
955	for (cit = mSubdivisionCandidates->begin(); cit != currentPos; ++ cit)
956	objectsBack.push_back((*cit).mObject);
957
958	// belongs to front bv
959	for (cit = currentPos; cit != cit_end; ++ cit)
960	objectsFront.push_back((*cit).mObject);
961
962	float newCost = minSum / boxArea;
963	float ratio = newCost / totalRenderCost;
964
965	#ifdef _DEBUG
966	// if (objectsBack.empty() \|\|objectsFront.empty())
967	cout << "\n\nobjects=(" << (int)objectsBack.size() << "," << (int)objectsFront.size() << " of "
968	<< (int)tData.mNode->mObjects.size() << ")\t area=("
969	<< areaLeft << ", " << areaRight << ", " << boxArea << ")" << endl
970	<< "cost= " << newCost << " oldCost=" << totalRenderCost / boxArea << endl;
971	#endif
972
973	return ratio;
974	}
975
976
977	static bool PrepareOutput(const int axis,
978	const int leaves,
979	ofstream &sumStats,
980	ofstream &vollStats,
981	ofstream &volrStats)
982	{
983	if ((axis == 0) && (leaves > 0) && (leaves < 90))
984	{
985	char str[64];
986	sprintf(str, "tmp/bvh_heur_sum-%04d.log", leaves);
987	sumStats.open(str);
988	sprintf(str, "tmp/bvh_heur_voll-%04d.log", leaves);
989	vollStats.open(str);
990	sprintf(str, "tmp/bvh_heur_volr-%04d.log", leaves);
991	volrStats.open(str);
992	}
993
994	return sumStats.is_open() && vollStats.is_open() && volrStats.is_open();
995	}
996
997
998	static void PrintHeuristics(const int objectsRight,
999	const float sum,
1000	const float volLeft,
1001	const float volRight,
1002	const float viewSpaceVol,
1003	ofstream &sumStats,
1004	ofstream &vollStats,
1005	ofstream &volrStats)
1006	{
1007	sumStats
1008	<< "#Position\n" << objectsRight << endl
1009	<< "#Sum\n" << sum / viewSpaceVol << endl
1010	<< "#Vol\n" << (volLeft + volRight) / viewSpaceVol << endl;
1011
1012	vollStats
1013	<< "#Position\n" << objectsRight << endl
1014	<< "#Vol\n" << volLeft / viewSpaceVol << endl;
1015
1016	volrStats
1017	<< "#Position\n" << objectsRight << endl
1018	<< "#Vol\n" << volRight / viewSpaceVol << endl;
1019	}
1020
1021
1022	float BvHierarchy::EvalLocalCostHeuristics(const BvhTraversalData &tData,
1023	const int axis,
1024	ObjectContainer &objectsFront,
1025	ObjectContainer &objectsBack)
1026	{
1027	///////////////////////////////////////////////////////
1028	// -- go through the lists, count the number of objects left
1029	//-- and right and evaluate the cost funcion
1030
1031	// prepare the heuristics by setting mailboxes and counters.
1032	const float totalVol = PrepareHeuristics(tData, axis);
1033
1034	// local helper variables
1035	float volLeft = 0;
1036	float volRight = totalVol;
1037
1038	const float nTotalObjects = EvalAbsCost(tData.mNode->mObjects);
1039	float nObjectsLeft = 0;
1040	float nObjectsRight = nTotalObjects;
1041
1042	const float viewSpaceVol = mViewCellsManager->GetViewSpaceBox().GetVolume();
1043
1044	SortableEntryContainer::const_iterator backObjectsStart =
1045	mSubdivisionCandidates->begin();
1046
1047	/////////////////////////////////
1048	//-- the parameters for the current optimum
1049
1050	float volBack = volLeft;
1051	float volFront = volRight;
1052	float newRenderCost = nTotalObjects * totalVol;
1053
1054	#ifdef _DEBUG
1055	ofstream sumStats;
1056	ofstream vollStats;
1057	ofstream volrStats;
1058
1059	const bool printStats =
1060	PrepareOutput(axis, mBvhStats.Leaves(), sumStats, vollStats, volrStats);
1061	#endif
1062
1063	///////////////////////////////////////////////////
1064	//-- the sweep heuristics
1065	//-- traverse through events and find best split plane
1066
1067	SortableEntryContainer::const_iterator cit,
1068	cit_end = cit_end = mSubdivisionCandidates->end();
1069
1070	for (cit = mSubdivisionCandidates->begin(); cit != cit_end; ++ cit)
1071	{
1072	Intersectable object = (cit).mObject;
1073
1074	// evaluate change in l and r volume
1075	// voll = view cells that see only left node (i.e., left pvs)
1076	// volr = view cells that see only right node (i.e., right pvs)
1077	EvalHeuristicsContribution(object, volLeft, volRight);
1078
1079	const float rc = mViewCellsManager->EvalRenderCost(object);
1080
1081	nObjectsLeft += rc;
1082	nObjectsRight -= rc;
1083
1084	const bool noValidSplit = ((nObjectsLeft <= Limits::Small) \|\| (nObjectsRight <= Limits::Small));
1085
1086	// the heuristics
1087	const float sum = noValidSplit ?
1088	1e25 : volLeft * (float)nObjectsLeft + volRight * (float)nObjectsRight;
1089
1090	#ifdef _DEBUG
1091	if (printStats)
1092	{
1093	PrintHeuristics(nObjectsRight, sum, volLeft, volRight, viewSpaceVol,
1094	sumStats, vollStats, volrStats);
1095	}
1096	#endif
1097
1098	if (sum < newRenderCost)
1099	{
1100	newRenderCost = sum;
1101
1102	volBack = volLeft;
1103	volFront = volRight;
1104
1105	// objects belongs to left side now
1106	for (; backObjectsStart != (cit + 1); ++ backObjectsStart);
1107	}
1108	}
1109
1110	////////////////////////////////////////////
1111	//-- assign object to front and back volume
1112
1113	// belongs to back bv
1114	for (cit = mSubdivisionCandidates->begin(); cit != backObjectsStart; ++ cit)
1115	{
1116	objectsBack.push_back((*cit).mObject);
1117	}
1118	// belongs to front bv
1119	for (cit = backObjectsStart; cit != cit_end; ++ cit)
1120	{
1121	objectsFront.push_back((*cit).mObject);
1122	}
1123
1124	// render cost of the old parent
1125	const float oldRenderCost = (float)nTotalObjects * totalVol + Limits::Small;
1126	// the relative cost ratio
1127	const float ratio = newRenderCost / oldRenderCost;
1128
1129	#ifdef _DEBUG
1130	Debug << "\n§§§§ bvh eval const decrease §§§§" << endl
1131	<< "back pvs: " << (int)objectsBack.size() << " front pvs: "
1132	<< (int)objectsFront.size() << " total pvs: " << nTotalObjects << endl
1133	<< "back p: " << volBack / viewSpaceVol << " front p "
1134	<< volFront / viewSpaceVol << " p: " << totalVol / viewSpaceVol << endl
1135	<< "old rc: " << oldRenderCost / viewSpaceVol << " new rc: "
1136	<< newRenderCost / viewSpaceVol << endl
1137	<< "render cost decrease: "
1138	<< oldRenderCost / viewSpaceVol - newRenderCost / viewSpaceVol << endl;
1139	#endif
1140
1141	return ratio;
1142	}
1143
1144
1145	void BvHierarchy::PrepareLocalSubdivisionCandidates(const BvhTraversalData &tData,
1146	const int axis)
1147	{
1148	//-- insert object queries
1149	ObjectContainer *objects = mUseGlobalSorting ?
1150	tData.mSortedObjects[axis] : &tData.mNode->mObjects;
1151
1152	CreateLocalSubdivisionCandidates(*objects, &mSubdivisionCandidates, !mUseGlobalSorting, axis);
1153	}
1154
1155
1156	void BvHierarchy::CreateLocalSubdivisionCandidates(const ObjectContainer &objects,
1157	SortableEntryContainer **subdivisionCandidates,
1158	const bool sort,
1159	const int axis)
1160	{
1161	(*subdivisionCandidates)->clear();
1162
1163	// compute requested size and look if subdivision candidate has to be recomputed
1164	const int requestedSize = (int)objects.size() * 2;
1165
1166	// creates a sorted split candidates array
1167	if ((*subdivisionCandidates)->capacity() > 500000 &&
1168	requestedSize < (int)((*subdivisionCandidates)->capacity() / 10) )
1169	{
1170	delete (*subdivisionCandidates);
1171	(*subdivisionCandidates) = new SortableEntryContainer;
1172	}
1173
1174	(*subdivisionCandidates)->reserve(requestedSize);
1175
1176	ObjectContainer::const_iterator oit, oit_end = objects.end();
1177
1178	for (oit = objects.begin(); oit < oit_end; ++ oit)
1179	{
1180	Intersectable object = oit;
1181	const AxisAlignedBox3 &box = object->GetBox();
1182	const float midPt = (box.Min(axis) + box.Max(axis)) * 0.5f;
1183
1184	(*subdivisionCandidates)->push_back(SortableEntry(object, midPt));
1185	}
1186
1187	if (sort)
1188	{ // no presorted candidate list
1189	stable_sort((subdivisionCandidates)->begin(), (subdivisionCandidates)->end());
1190	}
1191	}
1192
1193
1194	const BvhStatistics &BvHierarchy::GetStatistics() const
1195	{
1196	return mBvhStats;
1197	}
1198
1199
1200	float BvHierarchy::PrepareHeuristics(const BvhTraversalData &tData, const int axis)
1201	{
1202	BvhLeaf *leaf = tData.mNode;
1203	float vol = 0;
1204
1205	// sort so we can use a sweep from right to left
1206	PrepareLocalSubdivisionCandidates(tData, axis);
1207
1208	// collect and mark the view cells as belonging to front pvs
1209	ViewCellContainer viewCells;
1210	CollectViewCells(tData.mNode->mObjects, viewCells, true);
1211
1212	ViewCellContainer::const_iterator vit, vit_end = viewCells.end();
1213	for (vit = viewCells.begin(); vit != vit_end; ++ vit)
1214	{
1215	#if USE_VOLUMES_FOR_HEURISTICS
1216	const float volIncr = (*vit)->GetVolume();
1217	#else
1218	const float volIncr = 1.0f;
1219	#endif
1220	vol += volIncr;
1221	}
1222
1223	// we will mail view cells switching to the back side
1224	ViewCell::NewMail();
1225
1226	return vol;
1227	}
1228
1229	///////////////////////////////////////////////////////////
1230
1231
1232	void BvHierarchy::EvalHeuristicsContribution(Intersectable *obj,
1233	float &volLeft,
1234	float &volRight)
1235	{
1236	// collect all view cells associated with this objects
1237	// (also multiple times, if they are pierced by several rays)
1238	ViewCellContainer viewCells;
1239	const bool useMailboxing = false;
1240
1241	CollectViewCells(obj, viewCells, useMailboxing);
1242
1243	// classify view cells and compute volume contri accordingly
1244	// possible view cell classifications:
1245	// view cell mailed => view cell can be seen from left child node
1246	// view cell counter > 0 view cell can be seen from right child node
1247	// combined: view cell volume belongs to both nodes
1248	ViewCellContainer::const_iterator vit, vit_end = viewCells.end();
1249
1250	for (vit = viewCells.begin(); vit != vit_end; ++ vit)
1251	{
1252	// view cells can also be seen from left child node
1253	ViewCell viewCell = vit;
1254	#if USE_VOLUMES_FOR_HEURISTICS
1255	const float vol = viewCell->GetVolume();
1256	#else
1257	const float vol = 1.0f;
1258	#endif
1259	if (!viewCell->Mailed())
1260	{
1261	viewCell->Mail();
1262	// we now see view cell from both nodes
1263	// => add volume to left node
1264	volLeft += vol;
1265	}
1266
1267	// last reference into the right node
1268	if (-- viewCell->mCounter == 0)
1269	{
1270	// view cell was previously seen from both nodes =>
1271	// remove volume from right node
1272	volRight -= vol;
1273	}
1274	}
1275	}
1276
1277
1278	void BvHierarchy::SetViewCellsManager(ViewCellsManager *vcm)
1279	{
1280	mViewCellsManager = vcm;
1281	}
1282
1283
1284	AxisAlignedBox3 BvHierarchy::GetBoundingBox() const
1285	{
1286	return mBoundingBox;
1287	}
1288
1289
1290	float BvHierarchy::SelectObjectPartition(const BvhTraversalData &tData,
1291	ObjectContainer &frontObjects,
1292	ObjectContainer &backObjects,
1293	bool useVisibilityBasedHeuristics)
1294	{
1295	ObjectContainer nFrontObjects[3];
1296	ObjectContainer nBackObjects[3];
1297	float nCostRatio[3];
1298
1299	int sAxis = 0;
1300	int bestAxis = -1;
1301
1302	if (mOnlyDrivingAxis)
1303	{
1304	const AxisAlignedBox3 box = tData.mNode->GetBoundingBox();
1305	sAxis = box.Size().DrivingAxis();
1306	}
1307
1308	////////////////////////////////////
1309	//-- evaluate split cost for all three axis
1310
1311	for (int axis = 0; axis < 3; ++ axis)
1312	{
1313	if (!mOnlyDrivingAxis \|\| (axis == sAxis))
1314	{
1315	if (mUseCostHeuristics)
1316	{
1317	//////////////////////////////////
1318	//-- split objects using heuristics
1319
1320	if (useVisibilityBasedHeuristics)
1321	{
1322	//cout << "v rays: " << tData.mNumRays << " " << endl;
1323	///////////
1324	//-- heuristics using objects weighted by view cells volume
1325	nCostRatio[axis] =
1326	EvalLocalCostHeuristics(tData,
1327	axis,
1328	nFrontObjects[axis],
1329	nBackObjects[axis]);
1330	}
1331	else
1332	{ //cout << "e rays: " << tData.mNumRays << " ";
1333	//////////////////
1334	//-- view cells not constructed yet => use surface area heuristic
1335	nCostRatio[axis] = EvalSah(tData,
1336	axis,
1337	nFrontObjects[axis],
1338	nBackObjects[axis]);
1339	}
1340	}
1341	else
1342	{
1343	//-- split objects using some simple criteria
1344	nCostRatio[axis] =
1345	EvalLocalObjectPartition(tData, axis, nFrontObjects[axis], nBackObjects[axis]);
1346	}
1347
1348	if ((bestAxis == -1) \|\| (nCostRatio[axis] < nCostRatio[bestAxis]))
1349	{
1350	bestAxis = axis;
1351	}
1352	}
1353	}
1354
1355	////////////////
1356	//-- assign values
1357
1358	frontObjects = nFrontObjects[bestAxis];
1359	backObjects = nBackObjects[bestAxis];
1360
1361	//cout << "val: " << nCostRatio[bestAxis] << " axis: " << bestAxis << endl;
1362	return nCostRatio[bestAxis];
1363	}
1364
1365
1366	int BvHierarchy::AssociateObjectsWithRays(const VssRayContainer &rays) const
1367	{
1368	int nRays = 0;
1369	VssRayContainer::const_iterator rit, rit_end = rays.end();
1370
1371	VssRay::NewMail();
1372
1373	for (rit = rays.begin(); rit != rays.end(); ++ rit)
1374	{
1375	VssRay ray = (rit);
1376
1377	if (ray->mTerminationObject)
1378	{
1379	ray->mTerminationObject->GetOrCreateRays()->push_back(ray);
1380	if (!ray->Mailed())
1381	{
1382	ray->Mail();
1383	++ nRays;
1384	}
1385	}
1386	#if COUNT_ORIGIN_OBJECTS
1387	if (ray->mOriginObject)
1388	{
1389	ray->mOriginObject->GetOrCreateRays()->push_back(ray);
1390
1391	if (!ray->Mailed())
1392	{
1393	ray->Mail();
1394	++ nRays;
1395	}
1396	}
1397	#endif
1398	}
1399
1400	return nRays;
1401	}
1402
1403
1404	void BvHierarchy::PrintSubdivisionStats(const SubdivisionCandidate &sc)
1405	{
1406	const float costDecr = sc.GetRenderCostDecrease();
1407
1408	mSubdivisionStats
1409	<< "#Leaves\n" << mBvhStats.Leaves() << endl
1410	<< "#RenderCostDecrease\n" << costDecr << endl
1411	<< "#TotalRenderCost\n" << mTotalCost << endl
1412	<< "#EntriesInPvs\n" << mPvsEntries << endl;
1413	}
1414
1415
1416	void BvHierarchy::CollectRays(const ObjectContainer &objects,
1417	VssRayContainer &rays) const
1418	{
1419	VssRay::NewMail();
1420	ObjectContainer::const_iterator oit, oit_end = objects.end();
1421
1422	// evaluate reverse pvs and view cell volume on left and right cell
1423	// note: should I take all leaf objects or rather the objects hit by rays?
1424	for (oit = objects.begin(); oit != oit_end; ++ oit)
1425	{
1426	Intersectable obj = oit;
1427	VssRayContainer::const_iterator rit, rit_end = obj->GetOrCreateRays()->end();
1428
1429	for (rit = obj->GetOrCreateRays()->begin(); rit < rit_end; ++ rit)
1430	{
1431	VssRay ray = (rit);
1432
1433	if (!ray->Mailed())
1434	{
1435	ray->Mail();
1436	rays.push_back(ray);
1437	}
1438	}
1439	}
1440	}
1441
1442
1443	float BvHierarchy::EvalAbsCost(const ObjectContainer &objects)// const
1444	{
1445	#if USE_BETTER_RENDERCOST_EST
1446	ObjectContainer::const_iterator oit, oit_end = objects.end();
1447
1448	for (oit = objects.begin(); oit != oit_end; ++ oit)
1449	{
1450	objRenderCost += ViewCellsManager::GetRendercost(*oit);
1451	}
1452	#else
1453	return (float)objects.size();
1454	#endif
1455	}
1456
1457
1458	float BvHierarchy::EvalSahCost(BvhLeaf *leaf)
1459	{
1460	////////////////
1461	//-- surface area heuristics
1462	if (leaf->mObjects.empty())
1463	return 0.0f;
1464
1465	const AxisAlignedBox3 box = GetBoundingBox(leaf);
1466	const float area = box.SurfaceArea();
1467	const float viewSpaceArea = mViewCellsManager->GetViewSpaceBox().SurfaceArea();
1468
1469	return EvalAbsCost(leaf->mObjects) * area / viewSpaceArea;
1470	}
1471
1472
1473	float BvHierarchy::EvalRenderCost(const ObjectContainer &objects) const
1474	{
1475	///////////////
1476	//-- render cost heuristics
1477
1478	const float viewSpaceVol = mViewCellsManager->GetViewSpaceBox().GetVolume();
1479
1480	// probability that view point lies in a view cell which sees this node
1481	const float p = EvalViewCellsVolume(objects) / viewSpaceVol;
1482	float objRenderCost = EvalAbsCost(objects);
1483
1484	return objRenderCost * p;
1485	}
1486
1487
1488	AxisAlignedBox3 BvHierarchy::EvalBoundingBox(const ObjectContainer &objects,
1489	const AxisAlignedBox3 *parentBox) const
1490	{
1491	// if there are no objects in this box, box size is set to parent box size.
1492	// Question: Invalidate box instead?
1493	if (parentBox && objects.empty())
1494	return *parentBox;
1495
1496	AxisAlignedBox3 box;
1497	box.Initialize();
1498
1499	ObjectContainer::const_iterator oit, oit_end = objects.end();
1500
1501	for (oit = objects.begin(); oit != oit_end; ++ oit)
1502	{
1503	Intersectable obj = oit;
1504	// grow bounding box to include all objects
1505	box.Include(obj->GetBox());
1506	}
1507
1508	return box;
1509	}
1510
1511
1512	void BvHierarchy::CollectLeaves(BvhNode root, vector<BvhLeaf > &leaves) const
1513	{
1514	stack<BvhNode *> nodeStack;
1515	nodeStack.push(root);
1516
1517	while (!nodeStack.empty())
1518	{
1519	BvhNode *node = nodeStack.top();
1520	nodeStack.pop();
1521
1522	if (node->IsLeaf())
1523	{
1524	BvhLeaf leaf = (BvhLeaf )node;
1525	leaves.push_back(leaf);
1526	}
1527	else
1528	{
1529	BvhInterior interior = (BvhInterior )node;
1530
1531	nodeStack.push(interior->GetBack());
1532	nodeStack.push(interior->GetFront());
1533	}
1534	}
1535	}
1536
1537
1538	AxisAlignedBox3 BvHierarchy::GetBoundingBox(BvhNode *node) const
1539	{
1540	return node->GetBoundingBox();
1541	}
1542
1543
1544	void BvHierarchy::CollectViewCells(const ObjectContainer &objects,
1545	ViewCellContainer &viewCells,
1546	const bool setCounter) const
1547	{
1548	// no view cells yet
1549	if (0 && mHierarchyManager->GetViewSpaceSubdivisionType() ==
1550	HierarchyManager::NO_VIEWSPACE_SUBDIV)
1551	return;
1552
1553	ViewCell::NewMail();
1554	ObjectContainer::const_iterator oit, oit_end = objects.end();
1555
1556	// loop through all object and collect view cell pvs of this node
1557	for (oit = objects.begin(); oit != oit_end; ++ oit)
1558	{
1559	CollectViewCells(*oit, viewCells, true, setCounter);
1560	}
1561	}
1562
1563
1564	void BvHierarchy::CollectViewCells(Intersectable *obj,
1565	ViewCellContainer &viewCells,
1566	const bool useMailBoxing,
1567	const bool setCounter) const
1568	{
1569	VssRayContainer::const_iterator rit, rit_end = obj->GetOrCreateRays()->end();
1570
1571	for (rit = obj->GetOrCreateRays()->begin(); rit < rit_end; ++ rit)
1572	{
1573	VssRay ray = (rit);
1574	ViewCellContainer tmpViewCells;
1575
1576	mHierarchyManager->mVspTree->GetViewCells(*ray, tmpViewCells);
1577
1578	// matt: probably slow to allocate memory for view cells every time
1579	ViewCellContainer::const_iterator vit, vit_end = tmpViewCells.end();
1580
1581	for (vit = tmpViewCells.begin(); vit != vit_end; ++ vit)
1582	{
1583	ViewCell vc = vit;
1584
1585	// store view cells
1586	if (!useMailBoxing \|\| !vc->Mailed())
1587	{
1588	if (useMailBoxing)
1589	{
1590	vc->Mail();
1591	if (setCounter)
1592	{
1593	vc->mCounter = 0;
1594	}
1595	}
1596	viewCells.push_back(vc);
1597	}
1598
1599	if (setCounter)
1600	{
1601	++ vc->mCounter;
1602	}
1603	}
1604	}
1605	}
1606
1607
1608	int BvHierarchy::CountViewCells(Intersectable *obj) const
1609	{
1610	int result = 0;
1611
1612	VssRayContainer::const_iterator rit, rit_end = obj->GetOrCreateRays()->end();
1613
1614	for (rit = obj->GetOrCreateRays()->begin(); rit < rit_end; ++ rit)
1615	{
1616	VssRay ray = (rit);
1617	ViewCellContainer tmpViewCells;
1618
1619	mHierarchyManager->mVspTree->GetViewCells(*ray, tmpViewCells);
1620
1621	ViewCellContainer::const_iterator vit, vit_end = tmpViewCells.end();
1622	for (vit = tmpViewCells.begin(); vit != vit_end; ++ vit)
1623	{
1624	ViewCell vc = vit;
1625
1626	// store view cells
1627	if (!vc->Mailed())
1628	{
1629	vc->Mail();
1630	++ result;
1631	}
1632	}
1633	}
1634
1635	return result;
1636	}
1637
1638
1639	int BvHierarchy::CountViewCells(const ObjectContainer &objects) const
1640	{
1641	int nViewCells = 0;
1642	ViewCell::NewMail();
1643	ObjectContainer::const_iterator oit, oit_end = objects.end();
1644
1645	// loop through all object and collect view cell pvs of this node
1646	for (oit = objects.begin(); oit != oit_end; ++ oit)
1647	{
1648	nViewCells += CountViewCells(*oit);
1649	}
1650
1651	return nViewCells;
1652	}
1653
1654
1655	void BvHierarchy::CollectDirtyCandidates(BvhSubdivisionCandidate *sc,
1656	vector<SubdivisionCandidate *> &dirtyList,
1657	const bool onlyUnmailed)
1658	{
1659	BvhTraversalData &tData = sc->mParentData;
1660	BvhLeaf *node = tData.mNode;
1661
1662	ViewCellContainer viewCells;
1663	ViewCell::NewMail();
1664	CollectViewCells(node->mObjects, viewCells, true);
1665
1666	if (0) cout << "collected " << (int)viewCells.size() << " dirty candidates" << endl;
1667
1668	// split candidates handling
1669	// these view cells are thrown into dirty list
1670	ViewCellContainer::const_iterator vit, vit_end = viewCells.end();
1671
1672	for (vit = viewCells.begin(); vit != vit_end; ++ vit)
1673	{
1674	VspViewCell vc = dynamic_cast<VspViewCell >(*vit);
1675	VspLeaf *leaf = vc->mLeaves[0];
1676
1677	SubdivisionCandidate *candidate = leaf->GetSubdivisionCandidate();
1678
1679	// is this leaf still a split candidate?
1680	if (candidate && (!onlyUnmailed \|\| !candidate->Mailed()))
1681	{
1682	candidate->Mail();
1683	dirtyList.push_back(candidate);
1684	}
1685	}
1686	}
1687
1688
1689	BvhNode *BvHierarchy::GetRoot() const
1690	{
1691	return mRoot;
1692	}
1693
1694
1695	bool BvHierarchy::IsObjectInLeaf(BvhLeaf leaf, Intersectable object) const
1696	{
1697	ObjectContainer::const_iterator oit =
1698	lower_bound(leaf->mObjects.begin(), leaf->mObjects.end(), object, ilt);
1699
1700	// objects sorted by id
1701	if ((oit != leaf->mObjects.end()) && ((*oit)->GetId() == object->GetId()))
1702	{
1703	return true;
1704	}
1705	else
1706	{
1707	return false;
1708	}
1709	}
1710
1711
1712	BvhLeaf BvHierarchy::GetLeaf(Intersectable object, BvhNode *node) const
1713	{
1714	// rather use the simple version
1715	if (!object)
1716	return NULL;
1717
1718	return object->mBvhLeaf;
1719
1720	///////////////////////////////////////
1721	// start from root of tree
1722
1723	if (node == NULL)
1724	node = mRoot;
1725
1726	vector<BvhLeaf *> leaves;
1727
1728	stack<BvhNode *> nodeStack;
1729	nodeStack.push(node);
1730
1731	BvhLeaf *leaf = NULL;
1732
1733	while (!nodeStack.empty())
1734	{
1735	BvhNode *node = nodeStack.top();
1736	nodeStack.pop();
1737
1738	if (node->IsLeaf())
1739	{
1740	leaf = dynamic_cast<BvhLeaf *>(node);
1741
1742	if (IsObjectInLeaf(leaf, object))
1743	{
1744	return leaf;
1745	}
1746	}
1747	else
1748	{
1749	// find point
1750	BvhInterior interior = dynamic_cast<BvhInterior >(node);
1751
1752	if (interior->GetBack()->GetBoundingBox().Includes(object->GetBox()))
1753	{
1754	nodeStack.push(interior->GetBack());
1755	}
1756
1757	// search both sides as we are using bounding volumes
1758	if (interior->GetFront()->GetBoundingBox().Includes(object->GetBox()))
1759	{
1760	nodeStack.push(interior->GetFront());
1761	}
1762	}
1763	}
1764
1765	return leaf;
1766	}
1767
1768
1769	BvhIntersectable BvHierarchy::GetOrCreateBvhIntersectable(BvhLeaf node)
1770	{
1771	// search nodes
1772	std::map<BvhLeaf , BvhIntersectable >::const_iterator
1773	it = mBvhIntersectables.find(node);
1774
1775	if (it != mBvhIntersectables.end())
1776	{
1777	return (*it).second;
1778	}
1779
1780	// not in map => create new entry
1781	BvhIntersectable *bvhObj = new BvhIntersectable(node);
1782	mBvhIntersectables[node] = bvhObj;
1783
1784	return bvhObj;
1785	}
1786
1787
1788	bool BvHierarchy::Export(OUT_STREAM &stream)
1789	{
1790	ExportNode(mRoot, stream);
1791
1792	return true;
1793	}
1794
1795
1796	void BvHierarchy::ExportObjects(BvhLeaf *leaf, OUT_STREAM &stream)
1797	{
1798	ObjectContainer::const_iterator oit, oit_end = leaf->mObjects.end();
1799	for (oit = leaf->mObjects.begin(); oit != oit_end; ++ oit)
1800	{
1801	stream << (*oit)->GetId() << " ";
1802	}
1803	}
1804
1805
1806	void BvHierarchy::ExportNode(BvhNode *node, OUT_STREAM &stream)
1807	{
1808	if (node->IsLeaf())
1809	{
1810	BvhLeaf leaf = dynamic_cast<BvhLeaf >(node);
1811	const AxisAlignedBox3 box = leaf->GetBoundingBox();
1812	stream << "<Leaf"
1813	<< " min=\"" << box.Min().x << " " << box.Min().y << " " << box.Min().z << "\""
1814	<< " max=\"" << box.Max().x << " " << box.Max().y << " " << box.Max().z << "\""
1815	<< " objects=\"";
1816
1817	//-- export objects
1818	ExportObjects(leaf, stream);
1819
1820	stream << "\" />" << endl;
1821	}
1822	else
1823	{
1824	BvhInterior interior = dynamic_cast<BvhInterior >(node);
1825	const AxisAlignedBox3 box = interior->GetBoundingBox();
1826
1827	stream << "<Interior"
1828	<< " min=\"" << box.Min().x << " " << box.Min().y << " " << box.Min().z << "\""
1829	<< " max=\"" << box.Max().x << " " << box.Max().y << " " << box.Max().z
1830	<< "\">" << endl;
1831
1832	ExportNode(interior->GetBack(), stream);
1833	ExportNode(interior->GetFront(), stream);
1834
1835	stream << "</Interior>" << endl;
1836	}
1837	}
1838
1839
1840	float BvHierarchy::EvalViewCellsVolume(const ObjectContainer &objects) const
1841	{
1842	float vol = 0;
1843
1844	ViewCellContainer viewCells;
1845	CollectViewCells(objects, viewCells);
1846
1847	ViewCellContainer::const_iterator vit, vit_end = viewCells.end();
1848
1849	for (vit = viewCells.begin(); vit != vit_end; ++ vit)
1850	{
1851	vol += (*vit)->GetVolume();
1852	}
1853
1854	return vol;
1855	}
1856
1857
1858	void BvHierarchy::Initialise(const ObjectContainer &objects)
1859	{
1860	AxisAlignedBox3 box = EvalBoundingBox(objects);
1861
1862	///////
1863	//-- create new root
1864
1865	BvhLeaf *bvhleaf = new BvhLeaf(box, NULL, (int)objects.size());
1866	bvhleaf->mObjects = objects;
1867	mRoot = bvhleaf;
1868
1869	// compute bounding box from objects
1870	mBoundingBox = mRoot->GetBoundingBox();
1871
1872	// associate root with current objects
1873	AssociateObjectsWithLeaf(bvhleaf);
1874	}
1875
1876
1877	/*
1878	Mesh *BvHierarchy::MergeLeafToMesh()
1879	{
1880	vector<BvhLeaf *> leaves;
1881	CollectLeaves(leaves);
1882
1883	vector<BvhLeaf *>::const_iterator lit, lit_end = leaves.end();
1884
1885	for (lit = leaves.begin(); lit != lit_end; ++ lit)
1886	{
1887	Mesh mesh = MergeLeafToMesh(lit);
1888	}
1889	}*/
1890
1891
1892	SubdivisionCandidate *BvHierarchy::PrepareConstruction(const VssRayContainer &sampleRays,
1893	const ObjectContainer &objects)
1894	{
1895	///////////////////////////////////////
1896	//-- we assume that we have objects sorted by their id =>
1897	//-- we don't have to sort them here and an binary search
1898	//-- for identifying if a object is in a leaf.
1899
1900	mBvhStats.Reset();
1901	mBvhStats.Start();
1902	mBvhStats.nodes = 1;
1903
1904	// store pointer to this tree
1905	BvhSubdivisionCandidate::sBvHierarchy = this;
1906
1907	// root and bounding box was already constructed
1908	BvhLeaf bvhLeaf = dynamic_cast<BvhLeaf >(mRoot);
1909
1910	// multiply termination criterium for comparison,
1911	// so it can be set between zero and one and
1912	// no division is necessary during traversal
1913
1914	#if PROBABILIY_IS_BV_VOLUME
1915	mTermMinProbability *= mBoundingBox.GetVolume();
1916	// probability that bounding volume is seen
1917	const float prop = GetBoundingBox().GetVolume();
1918	#else
1919	mTermMinProbability *= mVspTree->GetBoundingBox().GetVolume();
1920	// probability that volume is "seen" from the view cells
1921	const float prop = EvalViewCellsVolume(objects);
1922	#endif
1923
1924	// only rays intersecting objects in node are interesting
1925	const int nRays = AssociateObjectsWithRays(sampleRays);
1926	//Debug << "using " << nRays << " of " << (int)sampleRays.size() << " rays" << endl;
1927
1928	// create bvh traversal data
1929	BvhTraversalData oData(bvhLeaf, 0, prop, nRays);
1930
1931	// create sorted object lists for the first data
1932	if (mUseGlobalSorting)
1933	{
1934	AssignInitialSortedObjectList(oData);
1935	}
1936
1937
1938	///////////////////
1939	//-- add first candidate for object space partition
1940
1941	BvhSubdivisionCandidate *oSubdivisionCandidate = new BvhSubdivisionCandidate(oData);
1942
1943	// evaluate priority
1944	EvalSubdivisionCandidate(*oSubdivisionCandidate);
1945	bvhLeaf->SetSubdivisionCandidate(oSubdivisionCandidate);
1946
1947	mTotalCost = EvalRenderCost(objects);
1948	mPvsEntries = CountViewCells(objects);
1949
1950	PrintSubdivisionStats(*oSubdivisionCandidate);
1951
1952	return oSubdivisionCandidate;
1953	}
1954
1955
1956	void BvHierarchy::AssignInitialSortedObjectList(BvhTraversalData &tData)
1957	{
1958	// we sort the objects as a preprocess so they don't have
1959	// to be sorted for each split
1960	for (int i = 0; i < 3; ++ i)
1961	{
1962	// create new objects
1963	if (!mSortedObjects[i])
1964	{
1965	mSortedObjects[i] = new SortableEntryContainer();
1966	CreateLocalSubdivisionCandidates(tData.mNode->mObjects, &mSortedObjects[i], true, i);
1967	}
1968
1969	// copy list into traversal data list
1970	tData.mSortedObjects[i] = new ObjectContainer();
1971	tData.mSortedObjects[i]->reserve((int)mSortedObjects[i]->size());
1972
1973	SortableEntryContainer::const_iterator oit, oit_end = mSortedObjects[i]->end();
1974
1975	for (oit = mSortedObjects[i]->begin(); oit != oit_end; ++ oit)
1976	{
1977	tData.mSortedObjects[i]->push_back((*oit).mObject);
1978	}
1979	}
1980	}
1981
1982
1983	void BvHierarchy::AssignSortedObjects(const BvhSubdivisionCandidate &sc,
1984	BvhTraversalData &frontData,
1985	BvhTraversalData &backData)
1986	{
1987	Intersectable::NewMail();
1988
1989	// we sorted the objects as a preprocess so they don't have
1990	// to be sorted for each split
1991	ObjectContainer::const_iterator fit, fit_end = sc.mFrontObjects.end();
1992
1993	for (fit = sc.mFrontObjects.begin(); fit != fit_end; ++ fit)
1994	{
1995	(*fit)->Mail();
1996	}
1997
1998	for (int i = 0; i < 3; ++ i)
1999	{
2000	frontData.mSortedObjects[i] = new ObjectContainer();
2001	backData.mSortedObjects[i] = new ObjectContainer();
2002
2003	frontData.mSortedObjects[i]->reserve((int)sc.mFrontObjects.size());
2004	backData.mSortedObjects[i]->reserve((int)sc.mFrontObjects.size());
2005
2006	ObjectContainer::const_iterator oit, oit_end = sc.mParentData.mSortedObjects[i]->end();
2007
2008	for (oit = sc.mParentData.mSortedObjects[i]->begin(); oit != oit_end; ++ oit)
2009	{
2010	if ((*oit)->Mailed())
2011	{
2012	frontData.mSortedObjects[i]->push_back(*oit);
2013	}
2014	else
2015	{
2016	backData.mSortedObjects[i]->push_back(*oit);
2017	}
2018	}
2019	}
2020	}
2021
2022
2023	SubdivisionCandidate *BvHierarchy::Reset(const VssRayContainer &sampleRays,
2024	const ObjectContainer &objects)
2025	{
2026	// reset stats
2027	mBvhStats.Reset();
2028	mBvhStats.Start();
2029	mBvhStats.nodes = 1;
2030
2031	// reset root
2032	DEL_PTR(mRoot);
2033
2034	BvhLeaf *bvhleaf = new BvhLeaf(mBoundingBox, NULL, (int)objects.size());
2035	bvhleaf->mObjects = objects;
2036	mRoot = bvhleaf;
2037
2038	#if PROBABILIY_IS_BV_VOLUME
2039	mTermMinProbability *= mBoundingBox.GetVolume();
2040	// probability that bounding volume is seen
2041	const float prop = GetBoundingBox().GetVolume();
2042	#else
2043	mTermMinProbability *= mVspTree->GetBoundingBox().GetVolume();
2044	// probability that volume is "seen" from the view cells
2045	const float prop = EvalViewCellsVolume(objects);
2046	#endif
2047
2048	const int nRays = CountRays(objects);
2049	BvhLeaf bvhLeaf = dynamic_cast<BvhLeaf >(mRoot);
2050
2051	// create bvh traversal data
2052	BvhTraversalData oData(bvhLeaf, 0, prop, nRays);
2053
2054	AssignInitialSortedObjectList(oData);
2055
2056
2057	///////////////////
2058	//-- add first candidate for object space partition
2059
2060	BvhSubdivisionCandidate *oSubdivisionCandidate =
2061	new BvhSubdivisionCandidate(oData);
2062
2063	EvalSubdivisionCandidate(*oSubdivisionCandidate);
2064	bvhLeaf->SetSubdivisionCandidate(oSubdivisionCandidate);
2065
2066	const float viewSpaceVol = mViewCellsManager->GetViewSpaceBox().GetVolume();
2067	mTotalCost = (float)objects.size() * prop / viewSpaceVol;
2068
2069	PrintSubdivisionStats(*oSubdivisionCandidate);
2070
2071	return oSubdivisionCandidate;
2072	}
2073
2074
2075	void BvhStatistics::Print(ostream &app) const
2076	{
2077	app << "=========== BvHierarchy statistics ===============\n";
2078
2079	app << setprecision(4);
2080
2081	app << "#N_CTIME ( Construction time [s] )\n" << Time() << " \n";
2082
2083	app << "#N_NODES ( Number of nodes )\n" << nodes << "\n";
2084
2085	app << "#N_INTERIORS ( Number of interior nodes )\n" << Interior() << "\n";
2086
2087	app << "#N_LEAVES ( Number of leaves )\n" << Leaves() << "\n";
2088
2089	app << "#AXIS_ALIGNED_SPLITS (number of axis aligned splits)\n" << splits << endl;
2090
2091	app << "#N_MAXCOSTNODES ( Percentage of leaves with terminated because of max cost ratio )\n"
2092	<< maxCostNodes * 100 / (double)Leaves() << endl;
2093
2094	app << "#N_PMINPROBABILITYLEAVES ( Percentage of leaves with mininum probability )\n"
2095	<< minProbabilityNodes * 100 / (double)Leaves() << endl;
2096
2097
2098	//////////////////////////////////////////////////
2099
2100	app << "#N_PMAXDEPTHLEAVES ( Percentage of leaves at maximum depth )\n"
2101	<< maxDepthNodes * 100 / (double)Leaves() << endl;
2102
2103	app << "#N_PMAXDEPTH ( Maximal reached depth )\n" << maxDepth << endl;
2104
2105	app << "#N_PMINDEPTH ( Minimal reached depth )\n" << minDepth << endl;
2106
2107	app << "#AVGDEPTH ( average depth )\n" << AvgDepth() << endl;
2108
2109
2110	////////////////////////////////////////////////////////
2111
2112	app << "#N_PMINOBJECTSLEAVES ( Percentage of leaves with mininum objects )\n"
2113	<< minObjectsNodes * 100 / (double)Leaves() << endl;
2114
2115	app << "#N_MAXOBJECTREFS ( Max number of object refs / leaf )\n" << maxObjectRefs << "\n";
2116
2117	app << "#N_MINOBJECTREFS ( Min number of object refs / leaf )\n" << minObjectRefs << "\n";
2118
2119	app << "#N_EMPTYLEAFS ( Empty leafs )\n" << emptyNodes << "\n";
2120
2121	app << "#N_PAVGOBJECTSLEAVES ( average object refs / leaf)\n" << AvgObjectRefs() << endl;
2122
2123
2124	////////////////////////////////////////////////////////
2125
2126	app << "#N_PMINRAYSLEAVES ( Percentage of leaves with mininum rays )\n"
2127	<< minRaysNodes * 100 / (double)Leaves() << endl;
2128
2129	app << "#N_MAXRAYREFS ( Max number of ray refs / leaf )\n" << maxRayRefs << "\n";
2130
2131	app << "#N_MINRAYREFS ( Min number of ray refs / leaf )\n" << minRayRefs << "\n";
2132
2133	app << "#N_PAVGRAYLEAVES ( average ray refs / leaf )\n" << AvgRayRefs() << endl;
2134
2135	app << "#N_PAVGRAYCONTRIBLEAVES ( Average ray contribution)\n" <<
2136	rayRefs / (double)objectRefs << endl;
2137
2138	app << "#N_PMAXRAYCONTRIBLEAVES ( Percentage of leaves with maximal ray contribution )\n"<<
2139	maxRayContriNodes * 100 / (double)Leaves() << endl;
2140
2141	app << "#N_PGLOBALCOSTMISSES ( Global cost misses )\n" << mGlobalCostMisses << endl;
2142
2143	app << "========== END OF BvHierarchy statistics ==========\n";
2144	}
2145
2146
2147	// TODO: return memory usage in MB
2148	float BvHierarchy::GetMemUsage() const
2149	{
2150	return (float)(sizeof(BvHierarchy)
2151	+ mBvhStats.Leaves() * sizeof(BvhLeaf)
2152	+ mBvhStats.Interior() * sizeof(BvhInterior)
2153	) / float(1024 * 1024);
2154	}
2155
2156
2157	void BvHierarchy::SetActive(BvhNode *node) const
2158	{
2159	vector<BvhLeaf *> leaves;
2160
2161	// sets the pointers to the currently active view cells
2162	CollectLeaves(node, leaves);
2163
2164	vector<BvhLeaf *>::const_iterator bit, bit_end = leaves.end();
2165
2166	for (bit = leaves.begin(); bit != bit_end; ++ bit)
2167	{
2168	(*bit)->SetActiveNode(node);
2169	}
2170	}
2171
2172
2173	BvhNode *BvHierarchy::SubdivideAndCopy(SplitQueue &tQueue,
2174	SubdivisionCandidate *splitCandidate)
2175	{
2176	BvhSubdivisionCandidate *sc =
2177	dynamic_cast<BvhSubdivisionCandidate *>(splitCandidate);
2178	BvhTraversalData &tData = sc->mParentData;
2179
2180	BvhNode *currentNode = tData.mNode;
2181	BvhNode oldNode = (BvhNode )splitCandidate->mEvaluationHack;
2182
2183	if (!oldNode->IsLeaf())
2184	{
2185	//////////////
2186	//-- continue subdivision
2187
2188	BvhTraversalData tFrontData;
2189	BvhTraversalData tBackData;
2190
2191	BvhInterior oldInterior = dynamic_cast<BvhInterior >(oldNode);
2192
2193	sc->mFrontObjects.clear();
2194	sc->mBackObjects.clear();
2195
2196	oldInterior->GetFront()->CollectObjects(sc->mFrontObjects);
2197	oldInterior->GetBack()->CollectObjects(sc->mBackObjects);
2198
2199	// evaluate the changes in render cost and pvs entries
2200	EvalSubdivisionCandidate(*sc, false);
2201
2202	// create new interior node and two leaf node
2203	currentNode = SubdivideNode(*sc, tFrontData, tBackData);
2204
2205	//oldNode->mRenderCostDecr += sc->GetRenderCostDecrease();
2206	//oldNode->mPvsEntriesIncr += sc->GetPvsEntriesIncr();
2207
2208	oldNode->mRenderCostDecr = sc->GetRenderCostDecrease();
2209	oldNode->mPvsEntriesIncr = sc->GetPvsEntriesIncr();
2210
2211	///////////////////////////
2212	//-- push the new split candidates on the queue
2213
2214	BvhSubdivisionCandidate *frontCandidate = new BvhSubdivisionCandidate(tFrontData);
2215	BvhSubdivisionCandidate *backCandidate = new BvhSubdivisionCandidate(tBackData);
2216
2217	frontCandidate->SetPriority((float)-oldInterior->GetFront()->mTimeStamp);
2218	backCandidate->SetPriority((float)-oldInterior->GetBack()->mTimeStamp);
2219
2220	frontCandidate->mEvaluationHack = oldInterior->GetFront();
2221	backCandidate->mEvaluationHack = oldInterior->GetBack();
2222
2223	// cross reference
2224	tFrontData.mNode->SetSubdivisionCandidate(frontCandidate);
2225	tBackData.mNode->SetSubdivisionCandidate(backCandidate);
2226
2227	//cout << "f: " << frontCandidate->GetPriority() << " b: " << backCandidate->GetPriority() << endl;
2228	tQueue.Push(frontCandidate);
2229	tQueue.Push(backCandidate);
2230	}
2231
2232	/////////////////////////////////
2233	//-- node is a leaf => terminate traversal
2234
2235	if (currentNode->IsLeaf())
2236	{
2237	// this leaf is no candidate for splitting anymore
2238	// => detach subdivision candidate
2239	tData.mNode->SetSubdivisionCandidate(NULL);
2240	// detach node so we don't delete it with the traversal data
2241	tData.mNode = NULL;
2242	}
2243
2244	return currentNode;
2245	}
2246
2247
2248	}

Note: See TracBrowser for help on using the repository browser.

Download in other formats: