Context Navigation

source: GTP/trunk/Lib/Vis/Preprocessing/src/VspBspTree.cpp @ 2283

Revision 2283, 98.6 KB checked in by mattausch, 18 years ago (diff)

Line
1	#include <stack>
2	#include <time.h>
3	#include <iomanip>
4
5	#include "Plane3.h"
6	#include "VspBspTree.h"
7	#include "Mesh.h"
8	#include "common.h"
9	#include "ViewCell.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 "ViewCellBsp.h"
17	#include "ViewCellsManager.h"
18	#include "Beam.h"
19	#include "IntersectableWrapper.h"
20
21
22
23	namespace GtpVisibilityPreprocessor {
24
25
26	#define USE_FIXEDPOINT_T 0
27	#define COUNT_ORIGIN_OBJECTS 1
28
29	#define STORE_PVS 0
30
31
32	//////////////
33	//-- static members
34
35	int VspBspTree::sFrontId = 0;
36	int VspBspTree::sBackId = 0;
37	int VspBspTree::sFrontAndBackId = 0;
38
39
40
41	typedef pair<BspNode , BspNodeGeometry > bspNodePair;
42
43
44	// pvs penalty can be different from pvs size
45	inline static float EvalPvsPenalty(const float pvs,
46	const float lower,
47	const float upper)
48	{
49	// clamp to minmax values
50	if (pvs < lower)
51	return (float)lower;
52	if (pvs > upper)
53	return (float)upper;
54
55	return (float)pvs;
56	}
57
58
59
60
61	/******************************************************************************/
62	/* class VspBspTree implementation */
63	/******************************************************************************/
64
65
66	VspBspTree::VspBspTree():
67	mRoot(NULL),
68	mUseAreaForPvs(false),
69	mCostNormalizer(Limits::Small),
70	mViewCellsManager(NULL),
71	mOutOfBoundsCell(NULL),
72	mStoreRays(false),
73	mRenderCostWeight(0.5),
74	mUseRandomAxis(false),
75	mTimeStamp(1)
76	{
77	bool randomize = false;
78	Environment::GetSingleton()->GetBoolValue("VspBspTree.Construction.randomize", randomize);
79	if (randomize) Randomize(); // initialise random generator for heuristics
80
81	//////////////////
82	//-- termination criteria for autopartition
83
84	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.maxDepth", mTermMaxDepth);
85	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.minPvs", mTermMinPvs);
86	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.minRays", mTermMinRays);
87	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.minProbability", mTermMinProbability);
88	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.maxRayContribution", mTermMaxRayContribution);
89	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.minAccRayLenght", mTermMinAccRayLength);
90
91	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.missTolerance", mTermMissTolerance);
92	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.maxViewCells", mMaxViewCells);
93
94	////////////////////////
95	//-- cost ratios for early tree termination
96	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.maxCostRatio", mTermMaxCostRatio);
97	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.minGlobalCostRatio", mTermMinGlobalCostRatio);
98	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.globalCostMissTolerance", mTermGlobalCostMissTolerance);
99
100	///////////
101	//-- factors for bsp tree split plane heuristics
102
103	Environment::GetSingleton()->GetFloatValue("VspBspTree.Factor.pvs", mPvsFactor);
104	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.ct_div_ci", mCtDivCi);
105
106	//////////
107	//-- partition criteria
108
109	Environment::GetSingleton()->GetIntValue("VspBspTree.maxPolyCandidates", mMaxPolyCandidates);
110	Environment::GetSingleton()->GetIntValue("VspBspTree.maxRayCandidates", mMaxRayCandidates);
111	Environment::GetSingleton()->GetIntValue("VspBspTree.splitPlaneStrategy", mSplitPlaneStrategy);
112
113	Environment::GetSingleton()->GetFloatValue("VspBspTree.Construction.epsilon", mEpsilon);
114	Environment::GetSingleton()->GetIntValue("VspBspTree.maxTests", mMaxTests);
115
116	// if only the driving axis is used for axis aligned split
117	Environment::GetSingleton()->GetBoolValue("VspBspTree.splitUseOnlyDrivingAxis", mOnlyDrivingAxis);
118
119	//////////////////////
120	//-- termination criteria for axis aligned split
121	Environment::GetSingleton()->GetFloatValue("VspBspTree.Termination.AxisAligned.maxRayContribution",
122	mTermMaxRayContriForAxisAligned);
123	Environment::GetSingleton()->GetIntValue("VspBspTree.Termination.AxisAligned.minRays",
124	mTermMinRaysForAxisAligned);
125
126	Environment::GetSingleton()->GetFloatValue("VspBspTree.maxStaticMemory", mMaxMemory);
127
128	Environment::GetSingleton()->GetFloatValue("VspBspTree.Construction.renderCostWeight", mRenderCostWeight);
129	Environment::GetSingleton()->GetFloatValue("VspBspTree.Construction.renderCostDecreaseWeight", mRenderCostDecreaseWeight);
130	Environment::GetSingleton()->GetBoolValue("VspBspTree.usePolygonSplitIfAvailable", mUsePolygonSplitIfAvailable);
131
132	Environment::GetSingleton()->GetBoolValue("VspBspTree.useCostHeuristics", mUseCostHeuristics);
133	Environment::GetSingleton()->GetBoolValue("VspBspTree.useSplitCostQueue", mUseSplitCostQueue);
134	Environment::GetSingleton()->GetBoolValue("VspBspTree.simulateOctree", mCirculatingAxis);
135	Environment::GetSingleton()->GetBoolValue("VspBspTree.useRandomAxis", mUseRandomAxis);
136	Environment::GetSingleton()->GetIntValue("VspBspTree.nodePriorityQueueType", mNodePriorityQueueType);
137
138
139	char subdivisionStatsLog[100];
140	Environment::GetSingleton()->GetStringValue("VspBspTree.subdivisionStats", subdivisionStatsLog);
141	mSubdivisionStats.open(subdivisionStatsLog);
142
143	Environment::GetSingleton()->GetFloatValue("VspBspTree.Construction.minBand", mMinBand);
144	Environment::GetSingleton()->GetFloatValue("VspBspTree.Construction.maxBand", mMaxBand);
145	Environment::GetSingleton()->GetBoolValue("VspBspTree.Construction.useDrivingAxisForMaxCost", mUseDrivingAxisIfMaxCostViolated);
146
147	/////////
148	//-- debug output
149
150	Debug << "***** VSP BSP options ****** " << endl;
151	Debug << "max depth: " << mTermMaxDepth << endl;
152	Debug << "min PVS: " << mTermMinPvs << endl;
153	Debug << "min probabiliy: " << mTermMinProbability << endl;
154	Debug << "min rays: " << mTermMinRays << endl;
155	Debug << "max ray contri: " << mTermMaxRayContribution << endl;
156	Debug << "max cost ratio: " << mTermMaxCostRatio << endl;
157	Debug << "miss tolerance: " << mTermMissTolerance << endl;
158	Debug << "max view cells: " << mMaxViewCells << endl;
159	Debug << "max polygon candidates: " << mMaxPolyCandidates << endl;
160	Debug << "randomize: " << randomize << endl;
161
162	Debug << "using area for pvs: " << mUseAreaForPvs << endl;
163	Debug << "render cost weight: " << mRenderCostWeight << endl;
164	Debug << "min global cost ratio: " << mTermMinGlobalCostRatio << endl;
165	Debug << "global cost miss tolerance: " << mTermGlobalCostMissTolerance << endl;
166	Debug << "only driving axis: " << mOnlyDrivingAxis << endl;
167	Debug << "max memory: " << mMaxMemory << endl;
168	Debug << "use poly split if available: " << mUsePolygonSplitIfAvailable << endl;
169	Debug << "use cost heuristics: " << mUseCostHeuristics << endl;
170	Debug << "use split cost queue: " << mUseSplitCostQueue << endl;
171	Debug << "subdivision stats log: " << subdivisionStatsLog << endl;
172	Debug << "use random axis: " << mUseRandomAxis << endl;
173	Debug << "priority queue type: " << mNodePriorityQueueType << endl;
174	Debug << "circulating axis: " << mCirculatingAxis << endl;
175	Debug << "minband: " << mMinBand << endl;
176	Debug << "maxband: " << mMaxBand << endl;
177	Debug << "use driving axis for max cost: " << mUseDrivingAxisIfMaxCostViolated << endl;
178	Debug << "render cost decrease weight: " << mRenderCostDecreaseWeight << endl;
179
180	Debug << "Split plane strategy: ";
181
182	if (mSplitPlaneStrategy & RANDOM_POLYGON)
183	{
184	Debug << "random polygon ";
185	}
186	if (mSplitPlaneStrategy & AXIS_ALIGNED)
187	{
188	Debug << "axis aligned ";
189	}
190	if (mSplitPlaneStrategy & LEAST_RAY_SPLITS)
191	{
192	mCostNormalizer += mLeastRaySplitsFactor;
193	Debug << "least ray splits ";
194	}
195	if (mSplitPlaneStrategy & BALANCED_RAYS)
196	{
197	mCostNormalizer += mBalancedRaysFactor;
198	Debug << "balanced rays ";
199	}
200	if (mSplitPlaneStrategy & PVS)
201	{
202	mCostNormalizer += mPvsFactor;
203	Debug << "pvs";
204	}
205
206	Debug << endl;
207
208	mLocalSubdivisionCandidates = new vector<SortableEntry>;
209	}
210
211
212	BspViewCell *VspBspTree::GetOutOfBoundsCell()
213	{
214	return mOutOfBoundsCell;
215	}
216
217
218	BspViewCell *VspBspTree::GetOrCreateOutOfBoundsCell()
219	{
220	if (!mOutOfBoundsCell)
221	{
222	mOutOfBoundsCell = new BspViewCell();
223	mOutOfBoundsCell->SetId(OUT_OF_BOUNDS_ID);
224	mOutOfBoundsCell->SetValid(false);
225	}
226
227	return mOutOfBoundsCell;
228	}
229
230
231	const BspTreeStatistics &VspBspTree::GetStatistics() const
232	{
233	return mBspStats;
234	}
235
236
237	VspBspTree::~VspBspTree()
238	{
239	DEL_PTR(mRoot);
240	DEL_PTR(mLocalSubdivisionCandidates);
241	}
242
243
244	int VspBspTree::AddMeshToPolygons(Mesh *mesh,
245	PolygonContainer &polys) const
246	{
247	if (!mesh) return 0;
248
249	FaceContainer::const_iterator fi;
250
251	// copy the face data to polygons
252	for (fi = mesh->mFaces.begin(); fi != mesh->mFaces.end(); ++ fi)
253	{
254	Polygon3 poly = new Polygon3((fi), mesh);
255
256	if (poly->Valid(mEpsilon))
257	{
258	polys.push_back(poly);
259	}
260	else
261	{
262	DEL_PTR(poly);
263	}
264	}
265
266	return (int)mesh->mFaces.size();
267	}
268
269
270	void VspBspTree::ExtractPolygons(Intersectable *object, PolygonContainer &polys) const
271	{
272	// extract the polygons from the intersectables
273	switch (object->Type())
274	{
275	case Intersectable::MESH_INSTANCE:
276	{
277	Mesh mesh = static_cast<MeshInstance >(object)->GetMesh();
278	AddMeshToPolygons(mesh, polys);
279	}
280	break;
281	case Intersectable::VIEW_CELL:
282	{
283	Mesh mesh = static_cast<ViewCell >(object)->GetMesh();
284	AddMeshToPolygons(mesh, polys);
285	break;
286	}
287	case Intersectable::TRANSFORMED_MESH_INSTANCE:
288	{
289	TransformedMeshInstance *mi =
290	static_cast<TransformedMeshInstance *>(object);
291
292	Mesh mesh;
293	mi->GetTransformedMesh(mesh);
294	AddMeshToPolygons(&mesh, polys);
295	}
296	break;
297	case Intersectable::TRIANGLE_INTERSECTABLE:
298	{
299	TriangleIntersectable *intersect =
300	static_cast<TriangleIntersectable *>(object);
301
302	Polygon3 *poly = new Polygon3(intersect->GetItem());
303
304	if (poly->Valid(mEpsilon))
305	{
306	polys.push_back(poly);
307	}
308	else
309	{
310	delete poly;
311	}
312	}
313	break;
314	default:
315	Debug << "intersectable type not supported" << endl;
316	break;
317	}
318	}
319
320
321	int VspBspTree::AddToPolygonSoup(const ObjectContainer &objects,
322	PolygonContainer &polys,
323	int maxObjects)
324	{
325	const int limit = (maxObjects > 0) ?
326	Min((int)objects.size(), maxObjects) : (int)objects.size();
327
328	for (int i = 0; i < limit; ++i)
329	{
330	Intersectable object = objects[i];//it;
331	ExtractPolygons(object, polys);
332
333	// add to BSP tree aabb
334	mBoundingBox.Include(object->GetBox());
335	}
336
337	return (int)polys.size();
338	}
339
340
341	void VspBspTree::ComputeBoundingBox(const VssRayContainer &sampleRays,
342	AxisAlignedBox3 *forcedBoundingBox)
343	{
344	if (forcedBoundingBox)
345	{
346	mBoundingBox = *forcedBoundingBox;
347	}
348	else // compute vsp tree bounding box
349	{
350	mBoundingBox.Initialize();
351
352	VssRayContainer::const_iterator rit, rit_end = sampleRays.end();
353
354	//-- compute bounding box
355	for (rit = sampleRays.begin(); rit != rit_end; ++ rit)
356	{
357	VssRay ray = rit;
358
359	// compute bounding box of view space
360	mBoundingBox.Include(ray->GetTermination());
361	mBoundingBox.Include(ray->GetOrigin());
362	}
363	}
364	}
365
366
367	void VspBspTree::Construct(const VssRayContainer &sampleRays,
368	AxisAlignedBox3 *forcedBoundingBox)
369	{
370	// Compute the bounding box from the rays
371	ComputeBoundingBox(sampleRays, forcedBoundingBox);
372
373	PolygonContainer polys;
374	RayInfoContainer *rays = new RayInfoContainer();
375
376	////////////
377	//-- extract polygons from rays if polygon candidate planes are required
378
379	if (mMaxPolyCandidates)
380	{
381	int numObj = 0;
382	Intersectable::NewMail();
383
384	cout << "Extracting polygons from rays ... ";
385	const long startTime = GetTime();
386
387	VssRayContainer::const_iterator rit, rit_end = sampleRays.end();
388
389	//-- extract polygons intersected by the rays
390	for (rit = sampleRays.begin(); rit != rit_end; ++ rit)
391	{
392	VssRay ray = rit;
393	Intersectable *obj = ray->mTerminationObject;
394
395	++ numObj;
396
397	/////////
398	//-- compute bounding box
399
400	if (!forcedBoundingBox)
401	{
402	mBoundingBox.Include(ray->mTermination);
403	}
404
405	if ((mBoundingBox.IsInside(ray->mOrigin) \|\| !forcedBoundingBox) &&
406	ray->mOriginObject &&
407	!ray->mOriginObject->Mailed())
408	{
409	ray->mOriginObject->Mail();
410	ExtractPolygons(ray->mOriginObject, polys);
411
412	++ numObj;
413	}
414	}
415
416	// throw out unnecessary polygons
417	PreprocessPolygons(polys);
418	cout << "finished" << endl;
419
420	Debug << "\n" << (int)polys.size() << " polys extracted from "
421	<< (int)sampleRays.size() << " rays in "
422	<< TimeDiff(startTime, GetTime())*1e-3 << " secs" << endl << endl;
423	}
424
425	Debug << "maximal pvs (i.e., pvs still considered as valid): "
426	<< mViewCellsManager->GetMaxPvsSize() << endl;
427
428	VssRayContainer::const_iterator rit, rit_end = sampleRays.end();
429
430	/////////
431	//-- store rays
432	for (rit = sampleRays.begin(); rit != rit_end; ++ rit)
433	{
434	VssRay ray = rit;
435
436	float minT, maxT;
437
438	static Ray hray;
439	hray.Init(*ray);
440
441	// TODO: not very efficient to implictly cast between rays types
442	if (mBoundingBox.GetRaySegment(hray, minT, maxT))
443	{
444	float len = ray->Length();
445
446	if (!len)
447	len = Limits::Small;
448
449	rays->push_back(RayInfo(ray, minT / len, maxT / len));
450	}
451	}
452
453	if (mUseAreaForPvs)
454	mTermMinProbability *= mBoundingBox.SurfaceArea();
455	else // normalize volume
456	mTermMinProbability *= mBoundingBox.GetVolume();
457
458	mBspStats.nodes = 1;
459	mBspStats.polys = (int)polys.size();
460	mBspStats.mGlobalCostMisses = 0;
461
462
463	// use split cost priority queue
464	if (mUseSplitCostQueue)
465	{
466	ConstructWithSplitQueue(polys, rays);
467	}
468	else
469	{
470	Construct(polys, rays);
471	}
472
473	// clean up polygons
474	CLEAR_CONTAINER(polys);
475	}
476
477
478	// TODO: return memory usage in MB
479	float VspBspTree::GetMemUsage() const
480	{
481	return (float)
482	(sizeof(VspBspTree) +
483	mBspStats.Leaves() * sizeof(BspLeaf) +
484	mCreatedViewCells * sizeof(BspViewCell) +
485	mBspStats.pvs * sizeof(PvsData) +
486	mBspStats.Interior() * sizeof(BspInterior) +
487	mBspStats.accumRays * sizeof(RayInfo)) / (1024.0f * 1024.0f);
488	}
489
490
491	void VspBspTree::Construct(const PolygonContainer &polys, RayInfoContainer *rays)
492	{
493	VspBspTraversalQueue tQueue;
494
495	/// create new vsp tree
496	mRoot = new BspLeaf();
497
498	// constrruct root node geometry
499	BspNodeGeometry *geom = new BspNodeGeometry();
500	ConstructGeometry(mRoot, *geom);
501
502	/// we use the overall probability as normalizer
503	/// either the overall area or the volume
504	const float prop = mUseAreaForPvs ? geom->GetArea() : geom->GetVolume();
505
506	/// first traversal data
507	VspBspTraversalData tData(mRoot,
508	new PolygonContainer(polys),
509	0,
510	rays,
511	ComputePvsSize(*rays),
512	prop,
513	geom);
514
515	// evaluate the priority of this traversal data
516	EvalPriority(tData);
517
518	// first node is kd node, i.e. an axis aligned box
519	if (1)
520	tData.mIsKdNode = true;
521	else
522	tData.mIsKdNode = false;
523
524	tQueue.push(tData);
525
526
527	mTotalCost = tData.mPvs * tData.mProbability / mBoundingBox.GetVolume();
528	mTotalPvsSize = tData.mPvs;
529
530	// first subdivison statistics
531	AddSubdivisionStats(1, 0, 0, mTotalCost, (float)mTotalPvsSize);
532
533	mBspStats.Start();
534	cout << "Constructing vsp bsp tree ... \n";
535
536	const long startTime = GetTime();
537	// used for intermediate time measurements and progress
538	long interTime = GetTime();
539
540	int nLeaves = 500;
541	int nViewCells = 500;
542
543	mOutOfMemory = false;
544	mCreatedViewCells = 0;
545
546	while (!tQueue.empty())
547	{
548	tData = tQueue.top();
549	tQueue.pop();
550
551	if (0 && !mOutOfMemory)
552	{
553	float mem = GetMemUsage();
554
555	if (mem > mMaxMemory)
556	{
557	mOutOfMemory = true;
558	Debug << "memory limit reached: " << mem << endl;
559	}
560	}
561
562	// subdivide leaf node
563	const BspNode *r = Subdivide(tQueue, tData);
564
565	if (r == mRoot)
566	Debug << "VSP BSP tree construction time spent at root: "
567	<< TimeDiff(startTime, GetTime())*1e-3 << "s" << endl;
568
569	if (mBspStats.Leaves() >= nLeaves)
570	{
571	nLeaves += 500;
572
573	cout << "leaves=" << mBspStats.Leaves() << endl;
574	Debug << "needed "
575	<< TimeDiff(interTime, GetTime())*1e-3
576	<< " secs to create 500 view cells" << endl;
577	interTime = GetTime();
578	}
579
580	if (mCreatedViewCells >= nViewCells)
581	{
582	nViewCells += 500;
583
584	cout << "generated " << mCreatedViewCells << " viewcells" << endl;
585	}
586	}
587
588	Debug << "Used Memory: " << GetMemUsage() << " MB" << endl << endl;
589	cout << "finished in " << TimeDiff(startTime, GetTime())*1e-3 << "secs" << endl;
590
591	mBspStats.Stop();
592	}
593
594
595
596	void VspBspTree::ConstructWithSplitQueue(const PolygonContainer &polys,
597	RayInfoContainer *rays)
598	{
599	VspBspSplitQueue tQueue;
600
601	mRoot = new BspLeaf();
602
603	// constrruct root node geometry
604	BspNodeGeometry *geom = new BspNodeGeometry();
605	ConstructGeometry(mRoot, *geom);
606
607	const float prop = mUseAreaForPvs ? geom->GetArea() : geom->GetVolume();
608
609	VspBspTraversalData tData(mRoot,
610	new PolygonContainer(polys),
611	0,
612	rays,
613	ComputePvsSize(*rays),
614	prop,
615	geom);
616
617
618	// first node is kd node, i.e. an axis aligned box
619	if (1)
620	tData.mIsKdNode = true;
621	else
622	tData.mIsKdNode = false;
623
624	// compute first split candidate
625	VspBspSubdivisionCandidate splitCandidate;
626	splitCandidate.mParentData = tData;
627
628	EvalSubdivisionCandidate(splitCandidate);
629
630	tQueue.push(splitCandidate);
631
632	mTotalCost = tData.mPvs * tData.mProbability / mBoundingBox.GetVolume();
633	mTotalPvsSize = tData.mPvs;
634
635	// first subdivison statistics
636	AddSubdivisionStats(1, 0, 0, mTotalCost, (float)mTotalPvsSize);
637
638	mBspStats.Start();
639	cout << "Constructing vsp bsp tree ... \n";
640
641	long startTime = GetTime();
642	int nLeaves = 500;
643	int nViewCells = 500;
644
645	// used for intermediate time measurements and progress
646	long interTime = GetTime();
647
648	mOutOfMemory = false;
649
650	mCreatedViewCells = 0;
651
652	while (!tQueue.empty())
653	{
654	splitCandidate = tQueue.top();
655	tQueue.pop();
656
657	// cost ratio of cost decrease / totalCost
658	float costRatio = splitCandidate.mRenderCostDecr / mTotalCost;
659
660	//Debug << "cost ratio: " << costRatio << endl;
661	if (costRatio < mTermMinGlobalCostRatio)
662	{
663	++ mBspStats.mGlobalCostMisses;
664	}
665
666	if (0 && !mOutOfMemory)
667	{
668	float mem = GetMemUsage();
669	if (mem > mMaxMemory)
670	{
671	mOutOfMemory = true;
672	Debug << "memory limit reached: " << mem << endl;
673	}
674	}
675
676	// subdivide leaf node
677	BspNode *r = Subdivide(tQueue, splitCandidate);
678
679	if (r == mRoot)
680	{
681	cout << "VSP BSP tree construction time spent at root: "
682	<< TimeDiff(startTime, GetTime())*1e-3 << "s" << endl;
683	}
684
685	if (mBspStats.Leaves() >= nLeaves)
686	{
687	nLeaves += 500;
688
689	cout << "leaves=" << mBspStats.Leaves() << endl;
690	Debug << "needed "
691	<< TimeDiff(interTime, GetTime())*1e-3
692	<< " secs to create 500 view cells" << endl;
693	interTime = GetTime();
694	}
695
696	if (mCreatedViewCells == nViewCells)
697	{
698	nViewCells += 500;
699	cout << "generated " << mCreatedViewCells << " viewcells" << endl;
700	}
701	}
702
703	Debug << "Used Memory: " << GetMemUsage() << " MB" << endl << endl;
704	cout << "finished\n";
705
706	mBspStats.Stop();
707	}
708
709
710	bool VspBspTree::LocalTerminationCriteriaMet(const VspBspTraversalData &data) const
711	{
712	return
713	(((int)data.mRays->size() <= mTermMinRays) \|\|
714	(data.mPvs <= mTermMinPvs) \|\|
715	(data.mProbability <= mTermMinProbability) \|\|
716	(data.GetAvgRayContribution() > mTermMaxRayContribution) \|\|
717	(data.mDepth >= mTermMaxDepth));
718	}
719
720
721	void VspBspTree::AddSubdivisionStats(const int viewCells,
722	const float renderCostDecr,
723	const float splitCandidateCost,
724	const float totalRenderCost,
725	const float avgRenderCost)
726	{
727	mSubdivisionStats
728	<< "#ViewCells\n" << viewCells << endl
729	<< "#RenderCostDecrease\n" << renderCostDecr << endl
730	<< "#SubdivisionCandidateCost\n" << splitCandidateCost << endl
731	<< "#TotalRenderCost\n" << totalRenderCost << endl
732	<< "#AvgRenderCost\n" << avgRenderCost << endl;
733	}
734
735
736	bool VspBspTree::GlobalTerminationCriteriaMet(const VspBspTraversalData &data) const
737	{
738	return
739	(0
740	\|\| mOutOfMemory
741	\|\| (mBspStats.Leaves() >= mMaxViewCells)
742	\|\| (mBspStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
743	);
744	}
745
746
747	BspNode *VspBspTree::Subdivide(VspBspTraversalQueue &tQueue,
748	VspBspTraversalData &tData)
749	{
750	BspNode *newNode = tData.mNode;
751
752	if (!LocalTerminationCriteriaMet(tData) && !GlobalTerminationCriteriaMet(tData))
753	{
754	PolygonContainer coincident;
755
756	VspBspTraversalData tFrontData;
757	VspBspTraversalData tBackData;
758
759	// create new interior node and two leaf nodes
760	// or return leaf as it is (if maxCostRatio missed)
761	int splitAxis;
762	bool splitFurther = true;
763	int maxCostMisses = tData.mMaxCostMisses;
764
765	Plane3 splitPlane;
766	BspLeaf leaf = static_cast<BspLeaf >(tData.mNode);
767
768	// choose next split plane
769	if (!SelectPlane(splitPlane, leaf, tData, tFrontData, tBackData, splitAxis))
770	{
771	++ maxCostMisses;
772
773	if (maxCostMisses > mTermMissTolerance)
774	{
775	// terminate branch because of max cost
776	++ mBspStats.maxCostNodes;
777	splitFurther = false;
778	}
779	}
780
781	// if this a valid split => subdivide this node further
782
783	if (splitFurther)
784	{
785	newNode = SubdivideNode(splitPlane, tData, tFrontData, tBackData, coincident);
786
787	if (splitAxis < 3)
788	++ mBspStats.splits[splitAxis];
789	else
790	++ mBspStats.polySplits;
791
792	// if it was a kd node (i.e., a box) and the split axis is axis aligned, it is still a kd node
793	tFrontData.mIsKdNode = tBackData.mIsKdNode = (tData.mIsKdNode && (splitAxis < 3));
794
795	tFrontData.mAxis = tBackData.mAxis = splitAxis;
796
797	// how often was max cost ratio missed in this branch?
798	tFrontData.mMaxCostMisses = maxCostMisses;
799	tBackData.mMaxCostMisses = maxCostMisses;
800
801	EvalPriority(tFrontData);
802	EvalPriority(tBackData);
803
804	// evaluate subdivision stats
805	if (1)
806	EvalSubdivisionStats(tData, tFrontData, tBackData);
807
808
809	// push the children on the stack
810	tQueue.push(tFrontData);
811	tQueue.push(tBackData);
812
813	// delete old leaf node
814	DEL_PTR(tData.mNode);
815	}
816	}
817
818	//-- terminate traversal and create new view cell
819	if (newNode->IsLeaf())
820	{
821	BspLeaf leaf = static_cast<BspLeaf >(newNode);
822
823	BspViewCell *viewCell = new BspViewCell();
824	leaf->SetViewCell(viewCell);
825
826	if (STORE_PVS)
827	{
828	//////////
829	//-- update pvs
830
831	int conSamp = 0;
832	float sampCon = 0.0f;
833
834	AddToPvs(leaf, *tData.mRays, sampCon, conSamp);
835
836	// update scalar pvs size lookup
837	ObjectPvs &pvs = viewCell->GetPvs();
838	mViewCellsManager->UpdateScalarPvsSize(viewCell, pvs.EvalPvsCost(), pvs.GetSize());
839
840	mBspStats.contributingSamples += conSamp;
841	mBspStats.sampleContributions += (int)sampCon;
842	}
843
844	//////////
845	//-- store additional info
846
847	if (mStoreRays)
848	{
849	RayInfoContainer::const_iterator it, it_end = tData.mRays->end();
850	for (it = tData.mRays->begin(); it != it_end; ++ it)
851	{
852	(*it).mRay->Ref();
853	leaf->mVssRays.push_back((*it).mRay);
854	}
855	}
856
857	// should I check here?
858	if (0 && !mViewCellsManager->CheckValidity(viewCell, 0,
859	mViewCellsManager->GetMaxPvsSize()))
860	{
861	viewCell->SetValid(false);
862	leaf->SetTreeValid(false);
863	PropagateUpValidity(leaf);
864
865	++ mBspStats.invalidLeaves;
866	}
867
868	viewCell->mLeaves.push_back(leaf);
869
870	if (mUseAreaForPvs)
871	viewCell->SetArea(tData.mProbability);
872	else
873	viewCell->SetVolume(tData.mProbability);
874
875	leaf->mProbability = tData.mProbability;
876
877	// finally evaluate stats until this leaf
878	if (0)
879	EvaluateLeafStats(tData);
880	}
881
882	//-- cleanup
883	tData.Clear();
884
885	return newNode;
886	}
887
888
889	// subdivide node using a split plane queue
890	BspNode *VspBspTree::Subdivide(VspBspSplitQueue &tQueue,
891	VspBspSubdivisionCandidate &splitCandidate)
892	{
893	VspBspTraversalData &tData = splitCandidate.mParentData;
894
895	BspNode *newNode = tData.mNode;
896
897	if (!LocalTerminationCriteriaMet(tData) && !GlobalTerminationCriteriaMet(tData))
898	{
899	PolygonContainer coincident;
900
901	VspBspTraversalData tFrontData;
902	VspBspTraversalData tBackData;
903
904	////////////////////
905	//-- continue subdivision
906
907	// create new interior node and two leaf node
908	const Plane3 splitPlane = splitCandidate.mSplitPlane;
909
910	newNode = SubdivideNode(splitPlane, tData, tFrontData, tBackData, coincident);
911
912	const int splitAxis = splitCandidate.mSplitAxis;
913	const int maxCostMisses = splitCandidate.mMaxCostMisses;
914
915	if (splitAxis < 3)
916	++ mBspStats.splits[splitAxis];
917	else
918	++ mBspStats.polySplits;
919
920	tFrontData.mIsKdNode = tBackData.mIsKdNode = (tData.mIsKdNode && (splitAxis < 3));
921	tFrontData.mAxis = tBackData.mAxis = splitAxis;
922
923	// how often was max cost ratio missed in this branch?
924	tFrontData.mMaxCostMisses = maxCostMisses;
925	tBackData.mMaxCostMisses = maxCostMisses;
926
927	// statistics
928	if (1)
929	{
930	const float cFront = (float)tFrontData.mPvs * tFrontData.mProbability;
931	const float cBack = (float)tBackData.mPvs * tBackData.mProbability;
932	const float cData = (float)tData.mPvs * tData.mProbability;
933
934	const float costDecr =
935	(cFront + cBack - cData) / mBoundingBox.GetVolume();
936
937	mTotalCost += costDecr;
938	mTotalPvsSize += tFrontData.mPvs + tBackData.mPvs - tData.mPvs;
939
940	AddSubdivisionStats(mBspStats.Leaves(),
941	-costDecr,
942	splitCandidate.GetPriority(),
943	mTotalCost,
944	(float)mTotalPvsSize / (float)mBspStats.Leaves());
945	}
946
947	////////////
948	//-- push the new split candidates on the stack
949
950	VspBspSubdivisionCandidate frontCandidate;
951	frontCandidate.mParentData = tFrontData;
952
953	VspBspSubdivisionCandidate backCandidate;
954	backCandidate.mParentData = tBackData;
955
956	EvalSubdivisionCandidate(frontCandidate);
957	EvalSubdivisionCandidate(backCandidate);
958
959	cout << "f cost: " << frontCandidate.mPriority << " " << frontCandidate.mRenderCostDecr << endl;
960	cout << "b cost: " << backCandidate.mPriority << " " << backCandidate.mRenderCostDecr << endl;
961	tQueue.push(frontCandidate);
962	tQueue.push(backCandidate);
963
964	// delete old leaf node
965	DEL_PTR(tData.mNode);
966	}
967
968
969	//////////////////
970	//-- terminate traversal and create new view cell
971
972	if (newNode->IsLeaf())
973	{
974	BspLeaf leaf = static_cast<BspLeaf >(newNode);
975
976	BspViewCell *viewCell = new BspViewCell();
977	leaf->SetViewCell(viewCell);
978
979	if (STORE_PVS)
980	{
981	/////////
982	//-- update pvs
983
984	int conSamp = 0;
985	float sampCon = 0.0f;
986
987	AddToPvs(leaf, *tData.mRays, sampCon, conSamp);
988
989	// update scalar pvs size value
990	ObjectPvs &pvs = viewCell->GetPvs();
991	mViewCellsManager->UpdateScalarPvsSize(viewCell,
992	pvs.EvalPvsCost(),
993	pvs.GetSize());
994
995	mBspStats.contributingSamples += conSamp;
996	mBspStats.sampleContributions += (int)sampCon;
997	}
998
999	viewCell->mLeaves.push_back(leaf);
1000
1001	///////////
1002	//-- store additional info
1003
1004	if (mStoreRays)
1005	{
1006	RayInfoContainer::const_iterator it, it_end = tData.mRays->end();
1007	for (it = tData.mRays->begin(); it != it_end; ++ it)
1008	{
1009	(*it).mRay->Ref();
1010	leaf->mVssRays.push_back((*it).mRay);
1011	}
1012	}
1013
1014	if (mUseAreaForPvs)
1015	viewCell->SetArea(tData.mProbability);
1016	else
1017	viewCell->SetVolume(tData.mProbability);
1018
1019	leaf->mProbability = tData.mProbability;
1020
1021	// finally evaluate stats for this leaf
1022	if (1)
1023	EvaluateLeafStats(tData);
1024	}
1025
1026	//-- cleanup
1027	tData.Clear();
1028
1029	return newNode;
1030	}
1031
1032
1033	void VspBspTree::EvalPriority(VspBspTraversalData &tData) const
1034	{
1035	switch (mNodePriorityQueueType)
1036	{
1037	case BREATH_FIRST:
1038	tData.mPriority = (float)-tData.mDepth;
1039	break;
1040	case DEPTH_FIRST:
1041	tData.mPriority = (float)tData.mDepth;
1042	break;
1043	default:
1044	tData.mPriority = tData.mPvs * tData.mProbability;
1045	//Debug << "priority: " << tData.mPriority << endl;
1046	break;
1047	}
1048	}
1049
1050
1051	void VspBspTree::EvalSubdivisionCandidate(VspBspSubdivisionCandidate &splitCandidate)
1052	{
1053	VspBspTraversalData frontData;
1054	VspBspTraversalData backData;
1055
1056	BspLeaf leaf = static_cast<BspLeaf >(splitCandidate.mParentData.mNode);
1057
1058	// compute locally best split plane
1059	const bool costRatioViolated =
1060	SelectPlane(splitCandidate.mSplitPlane,
1061	leaf,
1062	splitCandidate.mParentData,
1063	frontData,
1064	backData,
1065	splitCandidate.mSplitAxis);
1066
1067	// max cost threshold violated?
1068	splitCandidate.mMaxCostMisses = costRatioViolated ?
1069	splitCandidate.mParentData.mMaxCostMisses :
1070	splitCandidate.mParentData.mMaxCostMisses + 1;
1071
1072	float oldRenderCost;
1073
1074	// compute global decrease in render cost
1075	const float renderCostDecr = EvalRenderCostDecrease(splitCandidate.mSplitPlane,
1076	splitCandidate.mParentData,
1077	oldRenderCost);
1078
1079	splitCandidate.mRenderCostDecr = renderCostDecr;
1080
1081	// TODO: geometry could be reused
1082	delete frontData.mGeometry;
1083	delete backData.mGeometry;
1084
1085	// set priority for queue
1086	#if 0
1087	const float priority = (float)-data.mDepth;
1088	#else
1089
1090	// take render cost of node into account
1091	// otherwise danger of being stuck in a local minimum!!
1092	const float factor = mRenderCostDecreaseWeight;
1093	const float priority = factor * renderCostDecr + (1.0f - factor) * oldRenderCost;
1094	#endif
1095
1096	splitCandidate.mPriority = priority;
1097	}
1098
1099
1100	void VspBspTree::EvalSubdivisionStats(const VspBspTraversalData &tData,
1101	const VspBspTraversalData &tFrontData,
1102	const VspBspTraversalData &tBackData)
1103	{
1104	const float cFront = (float)tFrontData.mPvs * tFrontData.mProbability;
1105	const float cBack = (float)tBackData.mPvs * tBackData.mProbability;
1106	const float cData = (float)tData.mPvs * tData.mProbability;
1107
1108	const float costDecr =
1109	(cFront + cBack - cData) / mBoundingBox.GetVolume();
1110
1111	mTotalCost += costDecr;
1112	mTotalPvsSize += tFrontData.mPvs + tBackData.mPvs - tData.mPvs;
1113
1114	AddSubdivisionStats(mBspStats.Leaves(),
1115	-costDecr,
1116	0,
1117	mTotalCost,
1118	(float)mTotalPvsSize / (float)mBspStats.Leaves());
1119	}
1120
1121
1122	BspInterior *VspBspTree::SubdivideNode(const Plane3 &splitPlane,
1123	VspBspTraversalData &tData,
1124	VspBspTraversalData &frontData,
1125	VspBspTraversalData &backData,
1126	PolygonContainer &coincident)
1127	{
1128	BspLeaf leaf = static_cast<BspLeaf >(tData.mNode);
1129
1130	//-- the front and back traversal data is filled with the new values
1131	frontData.mDepth = tData.mDepth + 1;
1132	frontData.mPolygons = new PolygonContainer();
1133	frontData.mRays = new RayInfoContainer();
1134
1135	backData.mDepth = tData.mDepth + 1;
1136	backData.mPolygons = new PolygonContainer();
1137	backData.mRays = new RayInfoContainer();
1138
1139
1140	//-- subdivide rays
1141	SplitRays(splitPlane,
1142	*tData.mRays,
1143	*frontData.mRays,
1144	*backData.mRays);
1145
1146
1147	// compute pvs
1148	frontData.mPvs = ComputePvsSize(*frontData.mRays);
1149	backData.mPvs = ComputePvsSize(*backData.mRays);
1150
1151	// split front and back node geometry and compute area
1152
1153	// if geometry was not already computed
1154	if (!frontData.mGeometry && !backData.mGeometry)
1155	{
1156	frontData.mGeometry = new BspNodeGeometry();
1157	backData.mGeometry = new BspNodeGeometry();
1158
1159	tData.mGeometry->SplitGeometry(*frontData.mGeometry,
1160	*backData.mGeometry,
1161	splitPlane,
1162	mBoundingBox,
1163	//0.0f);
1164	mEpsilon);
1165
1166	if (mUseAreaForPvs)
1167	{
1168	frontData.mProbability = frontData.mGeometry->GetArea();
1169	backData.mProbability = backData.mGeometry->GetArea();
1170	}
1171	else
1172	{
1173	frontData.mProbability = frontData.mGeometry->GetVolume();
1174	backData.mProbability = tData.mProbability - frontData.mProbability;
1175
1176	// should never come here: wrong volume !!!
1177	if (0)
1178	{
1179	if (frontData.mProbability < -0.00001)
1180	Debug << "fatal error f: " << frontData.mProbability << endl;
1181	if (backData.mProbability < -0.00001)
1182	Debug << "fatal error b: " << backData.mProbability << endl;
1183
1184	// clamp because of precision issues
1185	if (frontData.mProbability < 0) frontData.mProbability = 0;
1186	if (backData.mProbability < 0) backData.mProbability = 0;
1187	}
1188	}
1189	}
1190
1191
1192	// subdivide polygons
1193	SplitPolygons(splitPlane,
1194	*tData.mPolygons,
1195	*frontData.mPolygons,
1196	*backData.mPolygons,
1197	coincident);
1198
1199
1200
1201	///////////////////////////////////////
1202	// subdivide further
1203
1204	// store maximal and minimal depth
1205	if (tData.mDepth > mBspStats.maxDepth)
1206	{
1207	Debug << "max depth increases to " << tData.mDepth << " at " << mBspStats.Leaves() << " leaves" << endl;
1208	mBspStats.maxDepth = tData.mDepth;
1209	}
1210
1211	mBspStats.nodes += 2;
1212
1213
1214	BspInterior *interior = new BspInterior(splitPlane);
1215
1216	#ifdef GTP_DEBUG
1217	Debug << interior << endl;
1218	#endif
1219
1220
1221	//-- create front and back leaf
1222
1223	BspInterior *parent = leaf->GetParent();
1224
1225	// replace a link from node's parent
1226	if (parent)
1227	{
1228	parent->ReplaceChildLink(leaf, interior);
1229	interior->SetParent(parent);
1230	}
1231	else // new root
1232	{
1233	mRoot = interior;
1234	}
1235
1236	// and setup child links
1237	interior->SetupChildLinks(new BspLeaf(interior), new BspLeaf(interior));
1238
1239	frontData.mNode = interior->GetFront();
1240	backData.mNode = interior->GetBack();
1241
1242	interior->mTimeStamp = mTimeStamp ++;
1243
1244
1245	//DEL_PTR(leaf);
1246	return interior;
1247	}
1248
1249
1250	void VspBspTree::AddToPvs(BspLeaf *leaf,
1251	const RayInfoContainer &rays,
1252	float &sampleContributions,
1253	int &contributingSamples)
1254	{
1255	sampleContributions = 0;
1256	contributingSamples = 0;
1257
1258	RayInfoContainer::const_iterator it, it_end = rays.end();
1259
1260	ViewCellLeaf *vc = leaf->GetViewCell();
1261
1262	// add contributions from samples to the PVS
1263	for (it = rays.begin(); it != it_end; ++ it)
1264	{
1265	float sc = 0.0f;
1266	VssRay ray = (it).mRay;
1267
1268	bool madeContrib = false;
1269	float contribution;
1270
1271	if (ray->mTerminationObject)
1272	{
1273	if (vc->AddPvsSample(ray->mTerminationObject, ray->mPdf, contribution))
1274	madeContrib = true;
1275	sc += contribution;
1276	}
1277
1278	// only count termination objects?
1279	#if COUNT_ORIGIN_OBJECTS
1280
1281	if (ray->mOriginObject)
1282	{
1283	if (vc->AddPvsSample(ray->mOriginObject, ray->mPdf, contribution))
1284	madeContrib = true;
1285
1286	sc += contribution;
1287	}
1288	#endif
1289	sampleContributions += sc;
1290
1291	if (madeContrib)
1292	++ contributingSamples;
1293	}
1294	}
1295
1296
1297	void VspBspTree::SortSubdivisionCandidates(const RayInfoContainer &rays,
1298	const int axis,
1299	float minBand,
1300	float maxBand)
1301	{
1302	mLocalSubdivisionCandidates->clear();
1303
1304	const int requestedSize = 2 * (int)(rays.size());
1305
1306	// creates a sorted split candidates array
1307	if (mLocalSubdivisionCandidates->capacity() > 500000 &&
1308	requestedSize < (int)(mLocalSubdivisionCandidates->capacity() / 10) )
1309	{
1310	delete mLocalSubdivisionCandidates;
1311	mLocalSubdivisionCandidates = new vector<SortableEntry>;
1312	}
1313
1314	mLocalSubdivisionCandidates->reserve(requestedSize);
1315
1316	if (0)
1317	{ // float values => don't compare with exact values
1318	minBand += Limits::Small;
1319	maxBand -= Limits::Small;
1320	}
1321
1322	// insert all queries
1323	for (RayInfoContainer::const_iterator ri = rays.begin(); ri < rays.end(); ++ ri)
1324	{
1325	const bool positive = (*ri).mRay->HasPosDir(axis);
1326	float pos = (*ri).ExtrapOrigin(axis);
1327
1328	// clamp to min / max band
1329	if (0) ClipValue(pos, minBand, maxBand);
1330
1331	mLocalSubdivisionCandidates->
1332	push_back(SortableEntry(positive ? SortableEntry::ERayMin : SortableEntry::ERayMax,
1333	pos, (*ri).mRay));
1334
1335	pos = (*ri).ExtrapTermination(axis);
1336
1337	// clamp to min / max band
1338	if (0) ClipValue(pos, minBand, maxBand);
1339
1340	mLocalSubdivisionCandidates->
1341	push_back(SortableEntry(positive ? SortableEntry::ERayMax : SortableEntry::ERayMin,
1342	pos, (*ri).mRay));
1343	}
1344
1345	stable_sort(mLocalSubdivisionCandidates->begin(), mLocalSubdivisionCandidates->end());
1346	}
1347
1348
1349	float VspBspTree::BestCostRatioHeuristics(const RayInfoContainer &rays,
1350	const AxisAlignedBox3 &box,
1351	const int pvsSize,
1352	const int axis,
1353	float &position)
1354	{
1355	RayInfoContainer usedRays;
1356
1357	if (mMaxTests < (int)rays.size())
1358	{
1359	GetRayInfoSets(rays, mMaxTests, usedRays);
1360	}
1361	else
1362	{
1363	usedRays = rays;
1364	}
1365
1366	const float minBox = box.Min(axis);
1367	const float maxBox = box.Max(axis);
1368
1369	const float sizeBox = maxBox - minBox;
1370
1371	const float minBand = minBox + mMinBand * sizeBox;
1372	const float maxBand = minBox + mMaxBand * sizeBox;
1373
1374	SortSubdivisionCandidates(usedRays, axis, minBand, maxBand);
1375
1376	//////////////////
1377	// go through the lists, count the number of objects left and right
1378	// and evaluate the following cost funcion:
1379	// C = ct_div_ci + (qlrl + qrrr)/queries
1380
1381	float pvsl = 0;
1382	float pvsr = (float)pvsSize;
1383
1384	float pvsBack = pvsl;
1385	float pvsFront = pvsr;
1386
1387	float sum = (float)pvsSize * sizeBox;
1388	float minSum = 1e20f;
1389
1390	// if no border can be found, take mid split
1391	position = minBox + 0.5f * sizeBox;
1392
1393	// the relative cost ratio
1394	float ratio = 99999999.0f;
1395	bool splitPlaneFound = false;
1396
1397	Intersectable::NewMail();
1398	RayInfoContainer::const_iterator ri, ri_end = usedRays.end();
1399
1400	// set all object as belonging to the front pvs
1401	for(ri = usedRays.begin(); ri != ri_end; ++ ri)
1402	{
1403	Intersectable oObject = (ri).mRay->mOriginObject;
1404	Intersectable tObject = (ri).mRay->mTerminationObject;
1405
1406	#if COUNT_ORIGIN_OBJECTS
1407
1408	if (oObject)
1409	{
1410	if (!oObject->Mailed())
1411	{
1412	oObject->Mail();
1413	oObject->mCounter = 1;
1414	}
1415	else
1416	{
1417	++ oObject->mCounter;
1418	}
1419	}
1420	#endif
1421
1422	if (tObject)
1423	{
1424	if (!tObject->Mailed())
1425	{
1426	tObject->Mail();
1427	tObject->mCounter = 1;
1428	}
1429	else
1430	{
1431	++ tObject->mCounter;
1432	}
1433	}
1434	}
1435
1436	Intersectable::NewMail();
1437	vector<SortableEntry>::const_iterator ci, ci_end = mLocalSubdivisionCandidates->end();
1438
1439	for (ci = mLocalSubdivisionCandidates->begin(); ci != ci_end; ++ ci)
1440	{
1441	VssRay *ray;
1442	ray = (*ci).ray;
1443
1444	Intersectable *oObject = ray->mOriginObject;
1445	Intersectable *tObject = ray->mTerminationObject;
1446
1447	switch ((*ci).type)
1448	{
1449	case SortableEntry::ERayMin:
1450	{
1451	#if COUNT_ORIGIN_OBJECTS
1452	if (oObject && !oObject->Mailed())
1453	{
1454	oObject->Mail();
1455	++ pvsl;
1456	}
1457	#endif
1458	if (tObject && !tObject->Mailed())
1459	{
1460	tObject->Mail();
1461	++ pvsl;
1462	}
1463
1464	break;
1465	}
1466	case SortableEntry::ERayMax:
1467	{
1468	#if COUNT_ORIGIN_OBJECTS
1469	if (oObject)
1470	{
1471	if (-- oObject->mCounter == 0)
1472	-- pvsr;
1473	}
1474	#endif
1475	if (tObject)
1476	{
1477	if (-- tObject->mCounter == 0)
1478	-- pvsr;
1479	}
1480
1481	break;
1482	}
1483	}
1484
1485
1486	// Note: we compare size of bounding boxes of front and back side because
1487	// of efficiency reasons (otherwise a new geometry would have to be computed
1488	// in each step and incremential evaluation would be difficult.
1489	// but then errors happen if the geometry is not an axis aligned box
1490	// (i.e., if a geometry aligned split was taken before)
1491	// question: is it sufficient to make this approximation?
1492	if (((ci).value >= minBand) && ((ci).value <= maxBand))
1493	{
1494	sum = pvsl * ((ci).value - minBox) + pvsr (maxBox - (*ci).value);
1495
1496	float currentPos;
1497
1498	// HACK: current positition is BETWEEN visibility events
1499	if (0 && ((ci + 1) != ci_end))
1500	{
1501	currentPos = ((ci).value + ((ci + 1)).value) * 0.5f;
1502	}
1503	else
1504	currentPos = (*ci).value;
1505
1506	//Debug << "pos=" << (*ci).value << "\t pvs=(" << pvsl << "," << pvsr << ")" << endl;
1507	//Debug << "cost= " << sum << endl;
1508
1509	if (sum < minSum)
1510	{
1511	splitPlaneFound = true;
1512
1513	minSum = sum;
1514	position = currentPos;
1515
1516	pvsBack = pvsl;
1517	pvsFront = pvsr;
1518	}
1519	}
1520	}
1521
1522	///////
1523	//-- compute cost
1524
1525	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
1526	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
1527
1528	const float pOverall = sizeBox;
1529
1530	const float pBack = position - minBox;
1531	const float pFront = maxBox - position;
1532
1533	const float penaltyOld = EvalPvsPenalty((float)pvsSize, lowerPvsLimit, upperPvsLimit);
1534	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
1535	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
1536
1537	const float oldRenderCost = penaltyOld * pOverall;
1538	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
1539
1540	if (splitPlaneFound)
1541	{
1542	ratio = mPvsFactor * newRenderCost / (oldRenderCost + Limits::Small);
1543	}
1544	//if (axis != 1)
1545	//Debug << "axis=" << axis << " costRatio=" << ratio << " pos=" << position << " t=" << (position - minBox) / (maxBox - minBox)
1546	// <<"\t pb=(" << pvsBack << ")\t pf=(" << pvsFront << ")" << endl;
1547
1548	return ratio;
1549	}
1550
1551
1552	float VspBspTree::SelectAxisAlignedPlane(Plane3 &plane,
1553	const VspBspTraversalData &tData,
1554	int &axis,
1555	BspNodeGeometry **frontGeom,
1556	BspNodeGeometry **backGeom,
1557	float &pFront,
1558	float &pBack,
1559	const bool isKdNode)
1560	{
1561	float nPosition[3];
1562	float nCostRatio[3];
1563	float nProbFront[3];
1564	float nProbBack[3];
1565
1566	BspNodeGeometry *nFrontGeom[3];
1567	BspNodeGeometry *nBackGeom[3];
1568
1569	// set to NULL, so I can find out which gemetry was stored
1570	for (int i = 0; i < 3; ++ i)
1571	{
1572	nFrontGeom[i] = NULL;
1573	nBackGeom[i] = NULL;
1574	}
1575
1576	// create bounding box of node geometry
1577	AxisAlignedBox3 box;
1578
1579	//TODO: for kd split geometry already is box => only take minmax vertices
1580	if (1)
1581	{ // get bounding box from geometry
1582	tData.mGeometry->GetBoundingBox(box);
1583	}
1584	else
1585	{
1586	box.Initialize();
1587	RayInfoContainer::const_iterator ri, ri_end = tData.mRays->end();
1588
1589	for(ri = tData.mRays->begin(); ri < ri_end; ++ ri)
1590	box.Include((*ri).ExtrapTermination());
1591	}
1592
1593
1594	int sAxis = 0;
1595	int bestAxis;
1596
1597	// if max cost ratio is exceeded, take split along longest axis instead
1598	const float maxCostRatioForArbitraryAxis = 0.9f;
1599
1600	if (mUseDrivingAxisIfMaxCostViolated)
1601	bestAxis = box.Size().DrivingAxis();
1602	else
1603	bestAxis = -1;
1604
1605	#if 0
1606	// maximum cost ratio for axis to be valid:
1607	// if exceeded, spatial mid split is used instead
1608	const maxCostRatioForHeur = 0.99f;
1609	#endif
1610
1611	// if we use some kind of specialised fixed axis
1612	const bool useSpecialAxis =
1613	mOnlyDrivingAxis \|\| mUseRandomAxis \|\| mCirculatingAxis;
1614
1615	if (mUseRandomAxis)
1616	sAxis = Random(3);
1617	else if (mCirculatingAxis)
1618	sAxis = (tData.mAxis + 1) % 3;
1619	else if (mOnlyDrivingAxis)
1620	sAxis = box.Size().DrivingAxis();
1621
1622
1623	//Debug << "use special axis: " << useSpecialAxis << endl;
1624	//Debug << "axis: " << sAxis << " drivingaxis: " << box.Size().DrivingAxis();
1625
1626	for (axis = 0; axis < 3 ; ++ axis)
1627	{
1628	if (!useSpecialAxis \|\| (axis == sAxis))
1629	{
1630	if (mUseCostHeuristics)
1631	{
1632	//-- place split plane using heuristics
1633	nCostRatio[axis] =
1634	BestCostRatioHeuristics(*tData.mRays,
1635	box,
1636	tData.mPvs,
1637	axis,
1638	nPosition[axis]);
1639	}
1640	else
1641	{
1642	//-- split plane position is spatial median
1643	nPosition[axis] = (box.Min()[axis] + box.Max()[axis]) * 0.5f;
1644	Vector3 normal(0,0,0); normal[axis] = 1.0f;
1645
1646	// allows faster split because we have axis aligned kd tree boxes
1647	if (isKdNode)
1648	{
1649	nCostRatio[axis] = EvalAxisAlignedSplitCost(tData,
1650	box,
1651	axis,
1652	nPosition[axis],
1653	nProbFront[axis],
1654	nProbBack[axis]);
1655
1656	// create back geometry from box
1657
1658	// NOTE: the geometry is returned from the function so we
1659	// don't have to recompute it when possible
1660	Vector3 pos;
1661
1662	pos = box.Max(); pos[axis] = nPosition[axis];
1663	AxisAlignedBox3 bBox(box.Min(), pos);
1664
1665	PolygonContainer fPolys;
1666	bBox.ExtractPolys(fPolys);
1667
1668	nBackGeom[axis] = new BspNodeGeometry(fPolys);
1669
1670	////////////
1671	//-- create front geometry from box
1672
1673	pos = box.Min(); pos[axis] = nPosition[axis];
1674	AxisAlignedBox3 fBox(pos, box.Max());
1675
1676	PolygonContainer bPolys;
1677	fBox.ExtractPolys(bPolys);
1678	nFrontGeom[axis] = new BspNodeGeometry(bPolys);
1679	}
1680	else
1681	{
1682	nFrontGeom[axis] = new BspNodeGeometry();
1683	nBackGeom[axis] = new BspNodeGeometry();
1684
1685	nCostRatio[axis] =
1686	EvalSplitPlaneCost(Plane3(normal, nPosition[axis]),
1687	tData, nFrontGeom[axis], nBackGeom[axis],
1688	nProbFront[axis], nProbBack[axis]);
1689	}
1690	}
1691
1692
1693	if (mUseDrivingAxisIfMaxCostViolated)
1694	{
1695	// we take longest axis split if cost ratio exceeds threshold
1696	if (nCostRatio[axis] < min(maxCostRatioForArbitraryAxis, nCostRatio[bestAxis]))
1697	{
1698	bestAxis = axis;
1699	}
1700	/*else if (nCostRatio[axis] < nCostRatio[bestAxis])
1701	{
1702	Debug << "taking split along longest axis (" << bestAxis << ") instead of (" << axis << ")" << endl;
1703	}*/
1704
1705	}
1706	else
1707	{
1708	if (bestAxis == -1)
1709	{
1710	bestAxis = axis;
1711	}
1712	else if (nCostRatio[axis] < nCostRatio[bestAxis])
1713	{
1714	bestAxis = axis;
1715	}
1716	}
1717	}
1718	}
1719
1720	//////////
1721	//-- assign values
1722
1723	axis = bestAxis;
1724	pFront = nProbFront[bestAxis];
1725	pBack = nProbBack[bestAxis];
1726
1727	// assign best split nodes geometry
1728	*frontGeom = nFrontGeom[bestAxis];
1729	*backGeom = nBackGeom[bestAxis];
1730
1731	// and delete other geometry
1732	DEL_PTR(nFrontGeom[(bestAxis + 1) % 3]);
1733	DEL_PTR(nBackGeom[(bestAxis + 2) % 3]);
1734
1735	//-- split plane
1736	Vector3 normal(0,0,0); normal[bestAxis] = 1;
1737	plane = Plane3(normal, nPosition[bestAxis]);
1738
1739	//Debug << "best axis: " << bestAxis << " pos " << nPosition[bestAxis] << endl;
1740
1741	return nCostRatio[bestAxis];
1742	}
1743
1744
1745	bool VspBspTree::SelectPlane(Plane3 &bestPlane,
1746	BspLeaf *leaf,
1747	VspBspTraversalData &data,
1748	VspBspTraversalData &frontData,
1749	VspBspTraversalData &backData,
1750	int &splitAxis)
1751	{
1752	// HACK matt: subdivide regularily to certain depth
1753	if (data.mDepth < 0) // question matt: why depth < 0 ?
1754	{
1755	cout << "depth: " << data.mDepth << endl;
1756
1757	// return axis aligned split
1758	AxisAlignedBox3 box;
1759	box.Initialize();
1760
1761	// create bounding box of region
1762	data.mGeometry->GetBoundingBox(box);
1763
1764	const int axis = box.Size().DrivingAxis();
1765	const Vector3 position = (box.Min()[axis] + box.Max()[axis]) * 0.5f;
1766
1767	Vector3 norm(0,0,0); norm[axis] = 1.0f;
1768	bestPlane = Plane3(norm, position);
1769	splitAxis = axis;
1770
1771	return true;
1772	}
1773
1774	// simplest strategy: just take next polygon
1775	if (mSplitPlaneStrategy & RANDOM_POLYGON)
1776	{
1777	if (!data.mPolygons->empty())
1778	{
1779	const int randIdx =
1780	(int)RandomValue(0, (Real)((float)data.mPolygons->size() - 0.5f));
1781	Polygon3 nextPoly = (data.mPolygons)[randIdx];
1782
1783	bestPlane = nextPoly->GetSupportingPlane();
1784	return true;
1785	}
1786	}
1787
1788	//-- use heuristics to find appropriate plane
1789
1790	// intermediate plane
1791	Plane3 plane;
1792	float lowestCost = MAX_FLOAT;
1793
1794	// decides if the first few splits should be only axisAligned
1795	const bool onlyAxisAligned =
1796	(mSplitPlaneStrategy & AXIS_ALIGNED) &&
1797	((int)data.mRays->size() > mTermMinRaysForAxisAligned) &&
1798	((int)data.GetAvgRayContribution() < mTermMaxRayContriForAxisAligned);
1799
1800	const int limit = onlyAxisAligned ? 0 :
1801	Min((int)data.mPolygons->size(), mMaxPolyCandidates);
1802
1803	float candidateCost;
1804
1805	int maxIdx = (int)data.mPolygons->size();
1806
1807	for (int i = 0; i < limit; ++ i)
1808	{
1809	// the already taken candidates are stored behind maxIdx
1810	// => assure that no index is taken twice
1811	const int candidateIdx = (int)RandomValue(0, (Real)(-- maxIdx));
1812	Polygon3 poly = (data.mPolygons)[candidateIdx];
1813
1814	// swap candidate to the end to avoid testing same plane
1815	std::swap((data.mPolygons)[maxIdx], (data.mPolygons)[candidateIdx]);
1816
1817	// evaluate current candidate
1818	BspNodeGeometry fGeom, bGeom;
1819	float fArea, bArea;
1820	plane = poly->GetSupportingPlane();
1821	candidateCost = EvalSplitPlaneCost(plane, data, fGeom, bGeom, fArea, bArea);
1822
1823	if (candidateCost < lowestCost)
1824	{
1825	bestPlane = plane;
1826	lowestCost = candidateCost;
1827	}
1828	}
1829
1830
1831	//-- evaluate axis aligned splits
1832
1833	int axis;
1834	BspNodeGeometry fGeom, bGeom;
1835	float pFront, pBack;
1836
1837	candidateCost = 99999999.0f;
1838
1839	// as a variant, we take axis aligned split only if there is
1840	// more polygon available to guide the split
1841	if (!mUsePolygonSplitIfAvailable \|\| data.mPolygons->empty())
1842	{
1843	candidateCost = SelectAxisAlignedPlane(plane,
1844	data,
1845	axis,
1846	&fGeom,
1847	&bGeom,
1848	pFront,
1849	pBack,
1850	data.mIsKdNode);
1851	}
1852
1853	splitAxis = 3;
1854
1855	if (candidateCost < lowestCost)
1856	{
1857	bestPlane = plane;
1858	lowestCost = candidateCost;
1859	splitAxis = axis;
1860
1861	// assign already computed values
1862	// we can do this because we always save the
1863	// computed values from the axis aligned splits
1864
1865	if (fGeom && bGeom)
1866	{
1867	frontData.mGeometry = fGeom;
1868	backData.mGeometry = bGeom;
1869
1870	frontData.mProbability = pFront;
1871	backData.mProbability = pBack;
1872	}
1873	}
1874	else
1875	{
1876	DEL_PTR(fGeom);
1877	DEL_PTR(bGeom);
1878	}
1879
1880	#ifdef GTP_DEBUG
1881	Debug << "plane lowest cost: " << lowestCost << endl;
1882	#endif
1883
1884	// exeeded relative max cost ratio
1885	if (lowestCost > mTermMaxCostRatio)
1886	{
1887	return false;
1888	}
1889
1890	return true;
1891	}
1892
1893
1894	Plane3 VspBspTree::ChooseCandidatePlane(const RayInfoContainer &rays) const
1895	{
1896	const int candidateIdx = (int)RandomValue(0, (Real)((float)rays.size() - 0.5f));
1897
1898	const Vector3 minPt = rays[candidateIdx].ExtrapOrigin();
1899	const Vector3 maxPt = rays[candidateIdx].ExtrapTermination();
1900
1901	const Vector3 pt = (maxPt + minPt) * 0.5;
1902	const Vector3 normal = Normalize(rays[candidateIdx].mRay->GetDir());
1903
1904	return Plane3(normal, pt);
1905	}
1906
1907
1908	Plane3 VspBspTree::ChooseCandidatePlane2(const RayInfoContainer &rays) const
1909	{
1910	Vector3 pt[3];
1911
1912	int idx[3];
1913	int cmaxT = 0;
1914	int cminT = 0;
1915	bool chooseMin = false;
1916
1917	for (int j = 0; j < 3; ++ j)
1918	{
1919	idx[j] = (int)RandomValue(0, (Real)((int)rays.size() * 2 - 1));
1920
1921	if (idx[j] >= (int)rays.size())
1922	{
1923	idx[j] -= (int)rays.size();
1924
1925	chooseMin = (cminT < 2);
1926	}
1927	else
1928	chooseMin = (cmaxT < 2);
1929
1930	RayInfo rayInf = rays[idx[j]];
1931	pt[j] = chooseMin ? rayInf.ExtrapOrigin() : rayInf.ExtrapTermination();
1932	}
1933
1934	return Plane3(pt[0], pt[1], pt[2]);
1935	}
1936
1937
1938	Plane3 VspBspTree::ChooseCandidatePlane3(const RayInfoContainer &rays) const
1939	{
1940	Vector3 pt[3];
1941
1942	int idx1 = (int)RandomValue(0, (Real)((int)rays.size() - 1));
1943	int idx2 = (int)RandomValue(0, (Real)((int)rays.size() - 1));
1944
1945	// check if rays different
1946	if (idx1 == idx2)
1947	idx2 = (idx2 + 1) % (int)rays.size();
1948
1949	const RayInfo ray1 = rays[idx1];
1950	const RayInfo ray2 = rays[idx2];
1951
1952	// normal vector of the plane parallel to both lines
1953	const Vector3 norm = Normalize(CrossProd(ray1.mRay->GetDir(), ray2.mRay->GetDir()));
1954
1955	// vector from line 1 to line 2
1956	const Vector3 vd = ray2.ExtrapOrigin() - ray1.ExtrapOrigin();
1957
1958	// project vector on normal to get distance
1959	const float dist = DotProd(vd, norm);
1960
1961	// point on plane lies halfway between the two planes
1962	const Vector3 planePt = ray1.ExtrapOrigin() + norm * dist * 0.5;
1963
1964	return Plane3(norm, planePt);
1965	}
1966
1967
1968	inline void VspBspTree::GenerateUniqueIdsForPvs()
1969	{
1970	Intersectable::NewMail(); sBackId = Intersectable::sMailId;
1971	Intersectable::NewMail(); sFrontId = Intersectable::sMailId;
1972	Intersectable::NewMail(); sFrontAndBackId = Intersectable::sMailId;
1973	}
1974
1975
1976	float VspBspTree::EvalRenderCostDecrease(const Plane3 &candidatePlane,
1977	const VspBspTraversalData &data,
1978	float &normalizedOldRenderCost) const
1979	{
1980	float pvsFront = 0;
1981	float pvsBack = 0;
1982	float totalPvs = 0;
1983
1984	// probability that view point lies in back / front node
1985	float pOverall = data.mProbability;
1986	float pFront = 0;
1987	float pBack = 0;
1988
1989
1990	// create unique ids for pvs heuristics
1991	GenerateUniqueIdsForPvs();
1992
1993	for (int i = 0; i < data.mRays->size(); ++ i)
1994	{
1995	RayInfo rayInf = (*data.mRays)[i];
1996
1997	float t;
1998	VssRay *ray = rayInf.mRay;
1999	const int cf = rayInf.ComputeRayIntersection(candidatePlane, t);
2000
2001	// find front and back pvs for origing and termination object
2002	AddObjToPvs(ray->mTerminationObject, cf, pvsFront, pvsBack, totalPvs);
2003
2004	#if COUNT_ORIGIN_OBJECTS
2005	AddObjToPvs(ray->mOriginObject, cf, pvsFront, pvsBack, totalPvs);
2006	#endif
2007	}
2008
2009
2010	BspNodeGeometry geomFront;
2011	BspNodeGeometry geomBack;
2012
2013	// construct child geometry with regard to the candidate split plane
2014	data.mGeometry->SplitGeometry(geomFront,
2015	geomBack,
2016	candidatePlane,
2017	mBoundingBox,
2018	//0.0f);
2019	mEpsilon);
2020
2021	if (!mUseAreaForPvs) // use front and back cell areas to approximate volume
2022	{
2023	pFront = geomFront.GetVolume();
2024	pBack = pOverall - pFront;
2025
2026	// something is wrong with the volume
2027	if (0 && ((pFront < 0.0) \|\| (pBack < 0.0)))
2028	{
2029	Debug << "ERROR in volume:\n"
2030	<< "volume f :" << pFront << " b: " << pBack << " p: " << pOverall
2031	<< ", real volume f: " << pFront << " b: " << geomBack.GetVolume()
2032	<< ", #polygons f: " << geomFront.Size() << " b: " << geomBack.Size() << " p: " << data.mGeometry->Size() << endl;
2033	}
2034	}
2035	else
2036	{
2037	pFront = geomFront.GetArea();
2038	pBack = geomBack.GetArea();
2039	}
2040
2041
2042	// -- pvs rendering heuristics
2043
2044	// upper and lower bounds
2045	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
2046	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
2047
2048	const float penaltyOld = EvalPvsPenalty(totalPvs, lowerPvsLimit, upperPvsLimit);
2049	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
2050	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
2051
2052	const float oldRenderCost = pOverall * penaltyOld;
2053	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
2054
2055	const float renderCostDecrease = (oldRenderCost - newRenderCost) / mBoundingBox.GetVolume();
2056
2057	// take render cost of node into account to avoid being stuck in a local minimum
2058	normalizedOldRenderCost = oldRenderCost / mBoundingBox.GetVolume();
2059
2060	return renderCostDecrease;
2061	}
2062
2063
2064	float VspBspTree::EvalSplitPlaneCost(const Plane3 &candidatePlane,
2065	const VspBspTraversalData &data,
2066	BspNodeGeometry &geomFront,
2067	BspNodeGeometry &geomBack,
2068	float &pFront,
2069	float &pBack) const
2070	{
2071	float totalPvs = 0;
2072	float pvsFront = 0;
2073	float pvsBack = 0;
2074
2075	// overall probability is used as normalizer
2076	float pOverall = 0;
2077
2078	// probability that view point lies in back / front node
2079	pFront = 0;
2080	pBack = 0;
2081
2082	int numTests; // the number of tests
2083
2084	// if random samples shold be taken instead of testing all the rays
2085	bool useRand;
2086
2087	if ((int)data.mRays->size() > mMaxTests)
2088	{
2089	useRand = true;
2090	numTests = mMaxTests;
2091	}
2092	else
2093	{
2094	useRand = false;
2095	numTests = (int)data.mRays->size();
2096	}
2097
2098	// create unique ids for pvs heuristics
2099	GenerateUniqueIdsForPvs();
2100
2101	for (int i = 0; i < numTests; ++ i)
2102	{
2103	const int testIdx = useRand ?
2104	(int)RandomValue(0, (Real)((float)data.mRays->size() - 0.5f)) : i;
2105	RayInfo rayInf = (*data.mRays)[testIdx];
2106
2107	float t;
2108	VssRay *ray = rayInf.mRay;
2109	const int cf = rayInf.ComputeRayIntersection(candidatePlane, t);
2110
2111	// find front and back pvs for origing and termination object
2112	AddObjToPvs(ray->mTerminationObject, cf, pvsFront, pvsBack, totalPvs);
2113
2114	#if COUNT_ORIGIN_OBJECTS
2115	AddObjToPvs(ray->mOriginObject, cf, pvsFront, pvsBack, totalPvs);
2116	#endif
2117	}
2118
2119	// construct child geometry with regard to the candidate split plane
2120	bool splitSuccessFull = data.mGeometry->SplitGeometry(geomFront,
2121	geomBack,
2122	candidatePlane,
2123	mBoundingBox,
2124	//0.0f);
2125	mEpsilon);
2126
2127	pOverall = data.mProbability;
2128
2129	if (!mUseAreaForPvs)
2130	{
2131	pFront = geomFront.GetVolume();
2132	pBack = pOverall - pFront;
2133
2134	// HACK: precision issues possible for unbalanced split => don't take this split!
2135	if (1 &&
2136	(!splitSuccessFull \|\| (pFront <= 0) \|\| (pBack <= 0) \|\|
2137	!geomFront.Valid() \|\| !geomBack.Valid()))
2138	{
2139	//Debug << "error f: " << pFront << " b: " << pBack << endl;
2140
2141	// high penalty for degenerated / wrong split
2142	return 99999.9f;
2143	}
2144	}
2145	else
2146	{
2147	// use front and back cell areas to approximate volume
2148	pFront = geomFront.GetArea();
2149	pBack = geomBack.GetArea();
2150	}
2151
2152	////////
2153	//-- pvs rendering heuristics
2154
2155	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
2156	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
2157
2158	// only render cost heuristics or combined with standard deviation
2159	const float penaltyOld = EvalPvsPenalty(totalPvs, lowerPvsLimit, upperPvsLimit);
2160	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
2161	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
2162
2163	const float oldRenderCost = pOverall * penaltyOld;
2164	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
2165
2166	float oldCost, newCost;
2167
2168	// only render cost
2169	if (1)
2170	{
2171	oldCost = oldRenderCost;
2172	newCost = newRenderCost;
2173	}
2174	else // also considering standard deviation
2175	{
2176	// standard deviation is difference of back and front pvs
2177	const float expectedCost = 0.5f * (penaltyFront + penaltyBack);
2178
2179	const float newDeviation = 0.5f *
2180	fabs(penaltyFront - expectedCost) + fabs(penaltyBack - expectedCost);
2181
2182	const float oldDeviation = penaltyOld;
2183
2184	newCost = mRenderCostWeight * newRenderCost + (1.0f - mRenderCostWeight) * newDeviation;
2185	oldCost = mRenderCostWeight * oldRenderCost + (1.0f - mRenderCostWeight) * oldDeviation;
2186	}
2187
2188	const float cost = mPvsFactor * newCost / (oldCost + Limits::Small);
2189
2190
2191	#ifdef GTP_DEBUG
2192	Debug << "totalpvs: " << data.mPvs << " ptotal: " << pOverall
2193	<< " frontpvs: " << pvsFront << " pFront: " << pFront
2194	<< " backpvs: " << pvsBack << " pBack: " << pBack << endl << endl;
2195	Debug << "cost: " << cost << endl;
2196	#endif
2197
2198	return cost;
2199	}
2200
2201
2202	int VspBspTree::ComputeBoxIntersections(const AxisAlignedBox3 &box,
2203	ViewCellContainer &viewCells) const
2204	{
2205	stack<bspNodePair> nodeStack;
2206	BspNodeGeometry *rgeom = new BspNodeGeometry();
2207
2208	ConstructGeometry(mRoot, *rgeom);
2209
2210	nodeStack.push(bspNodePair(mRoot, rgeom));
2211
2212	ViewCell::NewMail();
2213
2214	while (!nodeStack.empty())
2215	{
2216	BspNode *node = nodeStack.top().first;
2217	BspNodeGeometry *geom = nodeStack.top().second;
2218	nodeStack.pop();
2219
2220	const int side = geom->ComputeIntersection(box);
2221
2222	switch (side)
2223	{
2224	case -1:
2225	// node geometry is contained in box
2226	CollectViewCells(node, true, viewCells, true);
2227	break;
2228
2229	case 0:
2230	if (node->IsLeaf())
2231	{
2232	BspLeaf leaf = static_cast<BspLeaf >(node);
2233
2234	if (!leaf->GetViewCell()->Mailed() && leaf->TreeValid())
2235	{
2236	leaf->GetViewCell()->Mail();
2237	viewCells.push_back(leaf->GetViewCell());
2238	}
2239	}
2240	else
2241	{
2242	BspInterior interior = static_cast<BspInterior >(node);
2243
2244	BspNode *first = interior->GetFront();
2245	BspNode *second = interior->GetBack();
2246
2247	BspNodeGeometry *firstGeom = new BspNodeGeometry();
2248	BspNodeGeometry *secondGeom = new BspNodeGeometry();
2249
2250	geom->SplitGeometry(*firstGeom,
2251	*secondGeom,
2252	interior->GetPlane(),
2253	mBoundingBox,
2254	//0.0000001f);
2255	mEpsilon);
2256
2257	nodeStack.push(bspNodePair(first, firstGeom));
2258	nodeStack.push(bspNodePair(second, secondGeom));
2259	}
2260
2261	break;
2262	default:
2263	// default: cull
2264	break;
2265	}
2266
2267	DEL_PTR(geom);
2268
2269	}
2270
2271	return (int)viewCells.size();
2272	}
2273
2274
2275	float VspBspTree::EvalAxisAlignedSplitCost(const VspBspTraversalData &data,
2276	const AxisAlignedBox3 &box,
2277	const int axis,
2278	const float &position,
2279	float &pFront,
2280	float &pBack) const
2281	{
2282	float pvsTotal = 0;
2283	float pvsFront = 0;
2284	float pvsBack = 0;
2285
2286	// create unique ids for pvs heuristics
2287	GenerateUniqueIdsForPvs();
2288
2289	const int pvsSize = data.mPvs;
2290
2291	RayInfoContainer::const_iterator rit, rit_end = data.mRays->end();
2292
2293	// this is the main ray classification loop!
2294	for(rit = data.mRays->begin(); rit != rit_end; ++ rit)
2295	{
2296	// determine the side of this ray with respect to the plane
2297	float t;
2298	const int side = (*rit).ComputeRayIntersection(axis, position, t);
2299
2300	AddObjToPvs((*rit).mRay->mTerminationObject, side, pvsFront, pvsBack, pvsTotal);
2301
2302	#if COUNT_ORIGIN_OBJECTS
2303	AddObjToPvs((*rit).mRay->mOriginObject, side, pvsFront, pvsBack, pvsTotal);
2304	#endif
2305	}
2306
2307
2308	//-- pvs heuristics
2309
2310	float pOverall = data.mProbability;
2311
2312	// note: we use a simplified computation assuming that we always do a
2313	// spatial mid split
2314
2315	if (!mUseAreaForPvs)
2316	{
2317	// volume
2318	pBack = pFront = pOverall * 0.5f;
2319	#if 0
2320	// box length substitute for probability
2321	const float minBox = box.Min(axis);
2322	const float maxBox = box.Max(axis);
2323
2324	pBack = position - minBox;
2325	pFront = maxBox - position;
2326	pOverall = maxBox - minBox;
2327	#endif
2328	}
2329	else //-- area substitute for probability
2330	{
2331	const int axis2 = (axis + 1) % 3;
2332	const int axis3 = (axis + 2) % 3;
2333
2334	const float faceArea =
2335	(box.Max(axis2) - box.Min(axis2)) *
2336	(box.Max(axis3) - box.Min(axis3));
2337
2338	pBack = pFront = pOverall * 0.5f + faceArea;
2339	}
2340
2341	#ifdef GTP_DEBUG
2342	Debug << "axis: " << axis << " " << pvsSize << " " << pvsBack << " " << pvsFront << endl;
2343	Debug << "p: " << pFront << " " << pBack << " " << pOverall << endl;
2344	#endif
2345
2346
2347	const float newCost = pvsBack * pBack + pvsFront * pFront;
2348	const float oldCost = (float)pvsSize * pOverall + Limits::Small;
2349
2350	return (mCtDivCi + newCost) / oldCost;
2351	}
2352
2353
2354	inline void VspBspTree::AddObjToPvs(Intersectable *obj,
2355	const int cf,
2356	float &frontPvs,
2357	float &backPvs,
2358	float &totalPvs) const
2359	{
2360	if (!obj)
2361	return;
2362	#if 0
2363	const float renderCost = mViewCellsManager->EvalRenderCost(obj);
2364	#else
2365	const int renderCost = 1;
2366	#endif
2367	// new object
2368	if ((obj->mMailbox != sFrontId) &&
2369	(obj->mMailbox != sBackId) &&
2370	(obj->mMailbox != sFrontAndBackId))
2371	{
2372	totalPvs += renderCost;
2373	}
2374
2375	// TODO: does this really belong to no pvs?
2376	//if (cf == Ray::COINCIDENT) return;
2377
2378	// object belongs to both PVS
2379	if (cf >= 0)
2380	{
2381	if ((obj->mMailbox != sFrontId) &&
2382	(obj->mMailbox != sFrontAndBackId))
2383	{
2384	frontPvs += renderCost;
2385
2386	if (obj->mMailbox == sBackId)
2387	obj->mMailbox = sFrontAndBackId;
2388	else
2389	obj->mMailbox = sFrontId;
2390	}
2391	}
2392
2393	if (cf <= 0)
2394	{
2395	if ((obj->mMailbox != sBackId) &&
2396	(obj->mMailbox != sFrontAndBackId))
2397	{
2398	backPvs += renderCost;
2399
2400	if (obj->mMailbox == sFrontId)
2401	obj->mMailbox = sFrontAndBackId;
2402	else
2403	obj->mMailbox = sBackId;
2404	}
2405	}
2406	}
2407
2408
2409	void VspBspTree::CollectLeaves(vector<BspLeaf *> &leaves,
2410	const bool onlyUnmailed,
2411	const int maxPvsSize) const
2412	{
2413	stack<BspNode *> nodeStack;
2414	nodeStack.push(mRoot);
2415
2416	while (!nodeStack.empty())
2417	{
2418	BspNode *node = nodeStack.top();
2419	nodeStack.pop();
2420
2421	if (node->IsLeaf())
2422	{
2423	// test if this leaf is in valid view space
2424	BspLeaf leaf = static_cast<BspLeaf >(node);
2425	if (leaf->TreeValid() &&
2426	(!onlyUnmailed \|\| !leaf->Mailed()) &&
2427	((maxPvsSize < 0) \|\| (leaf->GetViewCell()->GetPvs().EvalPvsCost() <= maxPvsSize)))
2428	{
2429	leaves.push_back(leaf);
2430	}
2431	}
2432	else
2433	{
2434	BspInterior interior = static_cast<BspInterior >(node);
2435
2436	nodeStack.push(interior->GetBack());
2437	nodeStack.push(interior->GetFront());
2438	}
2439	}
2440	}
2441
2442
2443	AxisAlignedBox3 VspBspTree::GetBoundingBox() const
2444	{
2445	return mBoundingBox;
2446	}
2447
2448
2449	BspNode *VspBspTree::GetRoot() const
2450	{
2451	return mRoot;
2452	}
2453
2454
2455	void VspBspTree::EvaluateLeafStats(const VspBspTraversalData &data)
2456	{
2457	// the node became a leaf -> evaluate stats for leafs
2458	BspLeaf leaf = static_cast<BspLeaf >(data.mNode);
2459
2460
2461	if (data.mPvs > mBspStats.maxPvs)
2462	{
2463	mBspStats.maxPvs = data.mPvs;
2464	}
2465
2466	mBspStats.pvs += data.mPvs;
2467
2468	if (data.mDepth < mBspStats.minDepth)
2469	{
2470	mBspStats.minDepth = data.mDepth;
2471	}
2472
2473	if (data.mDepth >= mTermMaxDepth)
2474	{
2475	++ mBspStats.maxDepthNodes;
2476	//Debug << "new max depth: " << mBspStats.maxDepthNodes << endl;
2477	}
2478
2479	// accumulate rays to compute rays / leaf
2480	mBspStats.accumRays += (int)data.mRays->size();
2481
2482	if (data.mPvs < mTermMinPvs)
2483	++ mBspStats.minPvsNodes;
2484
2485	if ((int)data.mRays->size() < mTermMinRays)
2486	++ mBspStats.minRaysNodes;
2487
2488	if (data.GetAvgRayContribution() > mTermMaxRayContribution)
2489	++ mBspStats.maxRayContribNodes;
2490
2491	if (data.mProbability <= mTermMinProbability)
2492	++ mBspStats.minProbabilityNodes;
2493
2494	// accumulate depth to compute average depth
2495	mBspStats.accumDepth += data.mDepth;
2496
2497	++ mCreatedViewCells;
2498
2499	#ifdef GTP_DEBUG
2500	Debug << "BSP stats: "
2501	<< "Depth: " << data.mDepth << " (max: " << mTermMaxDepth << "), "
2502	<< "PVS: " << data.mPvs << " (min: " << mTermMinPvs << "), "
2503	<< "#rays: " << (int)data.mRays->size() << " (max: " << mTermMinRays << "), "
2504	<< "#pvs: " << leaf->GetViewCell()->GetPvs().EvalPvsCost() << "), "
2505	<< "#avg ray contrib (pvs): " << (float)data.mPvs / (float)data.mRays->size() << endl;
2506	#endif
2507	}
2508
2509
2510	int VspBspTree::CastRay(Ray &ray)
2511	{
2512	int hits = 0;
2513
2514	stack<BspRayTraversalData> tQueue;
2515
2516	float maxt, mint;
2517
2518	if (!mBoundingBox.GetRaySegment(ray, mint, maxt))
2519	return 0;
2520
2521	Intersectable::NewMail();
2522	ViewCell::NewMail();
2523
2524	Vector3 entp = ray.Extrap(mint);
2525	Vector3 extp = ray.Extrap(maxt);
2526
2527	BspNode *node = mRoot;
2528	BspNode *farChild = NULL;
2529
2530	while (1)
2531	{
2532	if (!node->IsLeaf())
2533	{
2534	BspInterior in = static_cast<BspInterior >(node);
2535
2536	Plane3 splitPlane = in->GetPlane();
2537	const int entSide = splitPlane.Side(entp);
2538	const int extSide = splitPlane.Side(extp);
2539
2540	if (entSide < 0)
2541	{
2542	node = in->GetBack();
2543
2544	if(extSide <= 0) // plane does not split ray => no far child
2545	continue;
2546
2547	farChild = in->GetFront(); // plane splits ray
2548
2549	} else if (entSide > 0)
2550	{
2551	node = in->GetFront();
2552
2553	if (extSide >= 0) // plane does not split ray => no far child
2554	continue;
2555
2556	farChild = in->GetBack(); // plane splits ray
2557	}
2558	else // ray and plane are coincident
2559	{
2560	// matt: WHAT TO DO IN THIS CASE ?
2561	//break;
2562	node = in->GetFront();
2563	continue;
2564	}
2565
2566	// push data for far child
2567	tQueue.push(BspRayTraversalData(farChild, extp, maxt));
2568
2569	// find intersection of ray segment with plane
2570	float t;
2571	extp = splitPlane.FindIntersection(ray.GetLoc(), extp, &t);
2572	maxt *= t;
2573	}
2574	else // reached leaf => intersection with view cell
2575	{
2576	BspLeaf leaf = static_cast<BspLeaf >(node);
2577
2578	if (!leaf->GetViewCell()->Mailed())
2579	{
2580	//ray.bspIntersections.push_back(Ray::VspBspIntersection(maxt, leaf));
2581	leaf->GetViewCell()->Mail();
2582	++ hits;
2583	}
2584
2585	//-- fetch the next far child from the stack
2586	if (tQueue.empty())
2587	break;
2588
2589	entp = extp;
2590	mint = maxt; // NOTE: need this?
2591
2592	if (ray.GetType() == Ray::LINE_SEGMENT && mint > 1.0f)
2593	break;
2594
2595	BspRayTraversalData &s = tQueue.top();
2596
2597	node = s.mNode;
2598	extp = s.mExitPoint;
2599	maxt = s.mMaxT;
2600
2601	tQueue.pop();
2602	}
2603	}
2604
2605	return hits;
2606	}
2607
2608
2609	void VspBspTree::CollectViewCells(ViewCellContainer &viewCells,
2610	bool onlyValid) const
2611	{
2612	ViewCell::NewMail();
2613	CollectViewCells(mRoot, onlyValid, viewCells, true);
2614	}
2615
2616
2617	void VspBspTree::CollectViewCells(BspNode *root,
2618	bool onlyValid,
2619	ViewCellContainer &viewCells,
2620	bool onlyUnmailed) const
2621	{
2622	stack<BspNode *> nodeStack;
2623
2624	if (!root)
2625	return;
2626
2627	nodeStack.push(root);
2628
2629	while (!nodeStack.empty())
2630	{
2631	BspNode *node = nodeStack.top();
2632	nodeStack.pop();
2633
2634	if (node->IsLeaf())
2635	{
2636	if (!onlyValid \|\| node->TreeValid())
2637	{
2638	ViewCellLeaf leafVc = static_cast<BspLeaf >(node)->GetViewCell();
2639
2640	ViewCell *viewCell = mViewCellsTree->GetActiveViewCell(leafVc);
2641
2642	if (!onlyUnmailed \|\| !viewCell->Mailed())
2643	{
2644	viewCell->Mail();
2645	viewCells.push_back(viewCell);
2646	}
2647	}
2648	}
2649	else
2650	{
2651	BspInterior interior = static_cast<BspInterior >(node);
2652
2653	nodeStack.push(interior->GetFront());
2654	nodeStack.push(interior->GetBack());
2655	}
2656	}
2657	}
2658
2659
2660	void VspBspTree::CollapseViewCells()
2661	{
2662	// TODO
2663	#if HAS_TO_BE_REDONE
2664	stack<BspNode *> nodeStack;
2665
2666	if (!mRoot)
2667	return;
2668
2669	nodeStack.push(mRoot);
2670
2671	while (!nodeStack.empty())
2672	{
2673	BspNode *node = nodeStack.top();
2674	nodeStack.pop();
2675
2676	if (node->IsLeaf())
2677	{
2678	BspViewCell viewCell = static_cast<BspLeaf >(node)->GetViewCell();
2679
2680	if (!viewCell->GetValid())
2681	{
2682	BspViewCell viewCell = static_cast<BspLeaf >(node)->GetViewCell();
2683
2684	ViewCellContainer leaves;
2685	mViewCellsTree->CollectLeaves(viewCell, leaves);
2686
2687	ViewCellContainer::const_iterator it, it_end = leaves.end();
2688
2689	for (it = leaves.begin(); it != it_end; ++ it)
2690	{
2691	BspLeaf l = static_cast<BspViewCell >(*it)->mLeaf;
2692	l->SetViewCell(GetOrCreateOutOfBoundsCell());
2693	++ mBspStats.invalidLeaves;
2694	}
2695
2696	// add to unbounded view cell
2697	GetOrCreateOutOfBoundsCell()->GetPvs().AddPvs(viewCell->GetPvs());
2698	DEL_PTR(viewCell);
2699	}
2700	}
2701	else
2702	{
2703	BspInterior interior = static_cast<BspInterior >(node);
2704
2705	nodeStack.push(interior->GetFront());
2706	nodeStack.push(interior->GetBack());
2707	}
2708	}
2709
2710	Debug << "invalid leaves: " << mBspStats.invalidLeaves << endl;
2711	#endif
2712	}
2713
2714
2715	void VspBspTree::CollectRays(VssRayContainer &rays)
2716	{
2717	vector<BspLeaf *> leaves;
2718
2719	vector<BspLeaf *>::const_iterator lit, lit_end = leaves.end();
2720
2721	for (lit = leaves.begin(); lit != lit_end; ++ lit)
2722	{
2723	BspLeaf leaf = lit;
2724	VssRayContainer::const_iterator rit, rit_end = leaf->mVssRays.end();
2725
2726	for (rit = leaf->mVssRays.begin(); rit != rit_end; ++ rit)
2727	rays.push_back(*rit);
2728	}
2729	}
2730
2731
2732	void VspBspTree::ValidateTree()
2733	{
2734	stack<BspNode *> nodeStack;
2735
2736	if (!mRoot)
2737	return;
2738
2739	nodeStack.push(mRoot);
2740
2741	mBspStats.invalidLeaves = 0;
2742	while (!nodeStack.empty())
2743	{
2744	BspNode *node = nodeStack.top();
2745	nodeStack.pop();
2746
2747	if (node->IsLeaf())
2748	{
2749	BspLeaf leaf = static_cast<BspLeaf >(node);
2750
2751	if (!leaf->GetViewCell()->GetValid())
2752	++ mBspStats.invalidLeaves;
2753
2754	// validity flags don't match => repair
2755	if (leaf->GetViewCell()->GetValid() != leaf->TreeValid())
2756	{
2757	leaf->SetTreeValid(leaf->GetViewCell()->GetValid());
2758	PropagateUpValidity(leaf);
2759	}
2760	}
2761	else
2762	{
2763	BspInterior interior = static_cast<BspInterior >(node);
2764
2765	nodeStack.push(interior->GetFront());
2766	nodeStack.push(interior->GetBack());
2767	}
2768	}
2769
2770	Debug << "invalid leaves: " << mBspStats.invalidLeaves << endl;
2771	}
2772
2773
2774	void VspBspTree::PreprocessPolygons(PolygonContainer &polys)
2775	{
2776	// preprocess: throw out polygons coincident to the view space box (not needed)
2777	PolygonContainer boxPolys;
2778
2779	mBoundingBox.ExtractPolys(boxPolys);
2780	vector<Plane3> boxPlanes;
2781
2782	PolygonContainer::iterator pit, pit_end = boxPolys.end();
2783
2784	// extract planes of box
2785	// TODO: can be done more elegantly than first extracting polygons
2786	// and take their planes
2787	for (pit = boxPolys.begin(); pit != pit_end; ++ pit)
2788	{
2789	boxPlanes.push_back((*pit)->GetSupportingPlane());
2790	}
2791
2792	pit_end = polys.end();
2793
2794	for (pit = polys.begin(); pit != pit_end; ++ pit)
2795	{
2796	vector<Plane3>::const_iterator bit, bit_end = boxPlanes.end();
2797
2798	for (bit = boxPlanes.begin(); (bit != bit_end) && (*pit); ++ bit)
2799	{
2800	const int cf = (pit)->ClassifyPlane(bit, mEpsilon);
2801
2802	if (cf == Polygon3::COINCIDENT)
2803	{
2804	DEL_PTR(*pit);
2805	//Debug << "coincident!!" << endl;
2806	}
2807	}
2808	}
2809
2810	// remove deleted entries after swapping them to end of vector
2811	for (int i = 0; i < (int)polys.size(); ++ i)
2812	{
2813	while (!polys[i] && (i < (int)polys.size()))
2814	{
2815	swap(polys[i], polys.back());
2816	polys.pop_back();
2817	}
2818	}
2819	}
2820
2821
2822	float VspBspTree::AccumulatedRayLength(const RayInfoContainer &rays) const
2823	{
2824	float len = 0;
2825
2826	RayInfoContainer::const_iterator it, it_end = rays.end();
2827
2828	for (it = rays.begin(); it != it_end; ++ it)
2829	len += (*it).SegmentLength();
2830
2831	return len;
2832	}
2833
2834
2835	int VspBspTree::SplitRays(const Plane3 &plane,
2836	RayInfoContainer &rays,
2837	RayInfoContainer &frontRays,
2838	RayInfoContainer &backRays) const
2839	{
2840	int splits = 0;
2841
2842	RayInfoContainer::const_iterator it, it_end = rays.end();
2843
2844	for (it = rays.begin(); it != it_end; ++ it)
2845	{
2846	RayInfo bRay = *it;
2847
2848	VssRay *ray = bRay.mRay;
2849	float t;
2850
2851	// get classification and receive new t
2852	const int cf = bRay.ComputeRayIntersection(plane, t);
2853
2854	switch (cf)
2855	{
2856	case -1:
2857	backRays.push_back(bRay);
2858	break;
2859	case 1:
2860	frontRays.push_back(bRay);
2861	break;
2862	case 0:
2863	{
2864	//-- split ray
2865	// test if start point behind or in front of plane
2866	const int side = plane.Side(bRay.ExtrapOrigin());
2867
2868	++ splits;
2869
2870	if (side <= 0)
2871	{
2872	backRays.push_back(RayInfo(ray, bRay.GetMinT(), t));
2873	frontRays.push_back(RayInfo(ray, t, bRay.GetMaxT()));
2874	}
2875	else
2876	{
2877	frontRays.push_back(RayInfo(ray, bRay.GetMinT(), t));
2878	backRays.push_back(RayInfo(ray, t, bRay.GetMaxT()));
2879	}
2880	}
2881	break;
2882	default:
2883	Debug << "Should not come here" << endl;
2884	break;
2885	}
2886	}
2887
2888	return splits;
2889	}
2890
2891
2892	void VspBspTree::ExtractHalfSpaces(BspNode *n, vector<Plane3> &halfSpaces) const
2893	{
2894	BspNode *lastNode;
2895
2896	do
2897	{
2898	lastNode = n;
2899
2900	// want to get planes defining geometry of this node => don't take
2901	// split plane of node itself
2902	n = n->GetParent();
2903
2904	if (n)
2905	{
2906	BspInterior interior = static_cast<BspInterior >(n);
2907	Plane3 halfSpace = static_cast<BspInterior *>(interior)->GetPlane();
2908
2909	if (interior->GetBack() != lastNode)
2910	halfSpace.ReverseOrientation();
2911
2912	halfSpaces.push_back(halfSpace);
2913	}
2914	}
2915	while (n);
2916	}
2917
2918
2919	void VspBspTree::ConstructGeometry(BspNode *n,
2920	BspNodeGeometry &geom) const
2921	{
2922	vector<Plane3> halfSpaces;
2923	ExtractHalfSpaces(n, halfSpaces);
2924
2925	PolygonContainer candidatePolys;
2926	vector<Plane3> candidatePlanes;
2927
2928	vector<Plane3>::const_iterator pit, pit_end = halfSpaces.end();
2929
2930	// bounded planes are added to the polygons
2931	for (pit = halfSpaces.begin(); pit != pit_end; ++ pit)
2932	{
2933	Polygon3 p = GetBoundingBox().CrossSection(pit);
2934
2935	if (p->Valid(mEpsilon))
2936	{
2937	candidatePolys.push_back(p);
2938	candidatePlanes.push_back(*pit);
2939	}
2940	}
2941
2942	// add faces of bounding box (also could be faces of the cell)
2943	for (int i = 0; i < 6; ++ i)
2944	{
2945	VertexContainer vertices;
2946
2947	for (int j = 0; j < 4; ++ j)
2948	{
2949	vertices.push_back(mBoundingBox.GetFace(i).mVertices[j]);
2950	}
2951
2952	Polygon3 *poly = new Polygon3(vertices);
2953
2954	candidatePolys.push_back(poly);
2955	candidatePlanes.push_back(poly->GetSupportingPlane());
2956	}
2957
2958	for (int i = 0; i < (int)candidatePolys.size(); ++ i)
2959	{
2960	// polygon is split by all other planes
2961	for (int j = 0; (j < (int)halfSpaces.size()) && candidatePolys[i]; ++ j)
2962	{
2963	if (i == j) // polygon and plane are coincident
2964	continue;
2965
2966	VertexContainer splitPts;
2967	Polygon3 frontPoly, backPoly;
2968
2969	const int cf =
2970	candidatePolys[i]->ClassifyPlane(halfSpaces[j],
2971	mEpsilon);
2972
2973	switch (cf)
2974	{
2975	case Polygon3::SPLIT:
2976	frontPoly = new Polygon3();
2977	backPoly = new Polygon3();
2978
2979	candidatePolys[i]->Split(halfSpaces[j],
2980	*frontPoly,
2981	*backPoly,
2982	mEpsilon);
2983
2984	DEL_PTR(candidatePolys[i]);
2985
2986	if (backPoly->Valid(mEpsilon))
2987	{
2988	candidatePolys[i] = backPoly;
2989	}
2990	else
2991	{
2992	DEL_PTR(backPoly);
2993	}
2994
2995	// outside, don't need this
2996	DEL_PTR(frontPoly);
2997	break;
2998
2999	// polygon outside of halfspace
3000	case Polygon3::FRONT_SIDE:
3001	DEL_PTR(candidatePolys[i]);
3002	break;
3003
3004	// just take polygon as it is
3005	case Polygon3::BACK_SIDE:
3006	case Polygon3::COINCIDENT:
3007	default:
3008	break;
3009	}
3010	}
3011
3012	if (candidatePolys[i])
3013	{
3014	geom.Add(candidatePolys[i], candidatePlanes[i]);
3015	}
3016	}
3017	}
3018
3019
3020	bool VspBspTree::IsOutOfBounds(ViewCell *vc) const
3021	{
3022	return vc->GetId() == OUT_OF_BOUNDS_ID;
3023	}
3024
3025
3026	void VspBspTree::SetViewCellsTree(ViewCellsTree *viewCellsTree)
3027	{
3028	mViewCellsTree = viewCellsTree;
3029	}
3030
3031
3032	void VspBspTree::ConstructGeometry(ViewCell *vc,
3033	BspNodeGeometry &vcGeom) const
3034	{
3035	// if false, cannot construct geometry for interior leaf
3036	if (!mViewCellsTree)
3037	return;
3038
3039	ViewCellContainer leaves;
3040	mViewCellsTree->CollectLeaves(vc, leaves);
3041
3042	ViewCellContainer::const_iterator it, it_end = leaves.end();
3043
3044	for (it = leaves.begin(); it != it_end; ++ it)
3045	{
3046	if (IsOutOfBounds(*it))
3047	continue;
3048
3049	BspViewCell bspVc = static_cast<BspViewCell >(*it);
3050	vector<BspLeaf *>::const_iterator bit, bit_end = bspVc->mLeaves.end();
3051
3052	for (bit = bspVc->mLeaves.begin(); bit != bit_end; ++ bit)
3053	{
3054	BspLeaf l = bit;
3055	ConstructGeometry(l, vcGeom);
3056	}
3057	}
3058	}
3059
3060
3061	int VspBspTree::FindNeighbors(BspNode n, vector<BspLeaf > &neighbors,
3062	const bool onlyUnmailed) const
3063	{
3064	stack<bspNodePair> nodeStack;
3065
3066	BspNodeGeometry nodeGeom;
3067	ConstructGeometry(n, nodeGeom);
3068	// const float eps = 0.5f;
3069	const float eps = 0.01f;
3070	// split planes from the root to this node
3071	// needed to verify that we found neighbor leaf
3072	// TODO: really needed?
3073	vector<Plane3> halfSpaces;
3074	ExtractHalfSpaces(n, halfSpaces);
3075
3076
3077	BspNodeGeometry *rgeom = new BspNodeGeometry();
3078	ConstructGeometry(mRoot, *rgeom);
3079
3080	nodeStack.push(bspNodePair(mRoot, rgeom));
3081
3082	while (!nodeStack.empty())
3083	{
3084	BspNode *node = nodeStack.top().first;
3085	BspNodeGeometry *geom = nodeStack.top().second;
3086
3087	nodeStack.pop();
3088
3089	if (node->IsLeaf())
3090	{
3091	// test if this leaf is in valid view space
3092	if (node->TreeValid() &&
3093	(node != n) &&
3094	(!onlyUnmailed \|\| !node->Mailed()))
3095	{
3096	bool isAdjacent = true;
3097
3098	if (1)
3099	{
3100	// test all planes of current node if still adjacent
3101	for (int i = 0; (i < halfSpaces.size()) && isAdjacent; ++ i)
3102	{
3103	const int cf =
3104	Polygon3::ClassifyPlane(geom->GetPolys(),
3105	halfSpaces[i],
3106	eps);
3107
3108	if (cf == Polygon3::FRONT_SIDE)
3109	{
3110	isAdjacent = false;
3111	}
3112	}
3113	}
3114	else
3115	{
3116	// TODO: why is this wrong??
3117	// test all planes of current node if still adjacent
3118	for (int i = 0; (i < nodeGeom.Size()) && isAdjacent; ++ i)
3119	{
3120	Polygon3 *poly = nodeGeom.GetPolys()[i];
3121
3122	const int cf =
3123	Polygon3::ClassifyPlane(geom->GetPolys(),
3124	poly->GetSupportingPlane(),
3125	eps);
3126
3127	if (cf == Polygon3::FRONT_SIDE)
3128	{
3129	isAdjacent = false;
3130	}
3131	}
3132	}
3133	// neighbor was found
3134	if (isAdjacent)
3135	{
3136	neighbors.push_back(static_cast<BspLeaf *>(node));
3137	}
3138	}
3139	}
3140	else
3141	{
3142	BspInterior interior = static_cast<BspInterior >(node);
3143
3144	const int cf = Polygon3::ClassifyPlane(nodeGeom.GetPolys(),
3145	interior->GetPlane(),
3146	eps);
3147
3148	BspNode *front = interior->GetFront();
3149	BspNode *back = interior->GetBack();
3150
3151	BspNodeGeometry *fGeom = new BspNodeGeometry();
3152	BspNodeGeometry *bGeom = new BspNodeGeometry();
3153
3154	geom->SplitGeometry(*fGeom,
3155	*bGeom,
3156	interior->GetPlane(),
3157	mBoundingBox,
3158	//0.0000001f);
3159	eps);
3160
3161	if (cf == Polygon3::BACK_SIDE)
3162	{
3163	nodeStack.push(bspNodePair(interior->GetBack(), bGeom));
3164	DEL_PTR(fGeom);
3165	}
3166	else
3167	{
3168	if (cf == Polygon3::FRONT_SIDE)
3169	{
3170	nodeStack.push(bspNodePair(interior->GetFront(), fGeom));
3171	DEL_PTR(bGeom);
3172	}
3173	else
3174	{ // random decision
3175	nodeStack.push(bspNodePair(front, fGeom));
3176	nodeStack.push(bspNodePair(back, bGeom));
3177	}
3178	}
3179	}
3180
3181	DEL_PTR(geom);
3182	}
3183
3184	return (int)neighbors.size();
3185	}
3186
3187
3188
3189	int VspBspTree::FindApproximateNeighbors(BspNode *n,
3190	vector<BspLeaf *> &neighbors,
3191	const bool onlyUnmailed) const
3192	{
3193	stack<bspNodePair> nodeStack;
3194
3195	BspNodeGeometry nodeGeom;
3196	ConstructGeometry(n, nodeGeom);
3197
3198	float eps = 0.01f;
3199	// split planes from the root to this node
3200	// needed to verify that we found neighbor leaf
3201	// TODO: really needed?
3202	vector<Plane3> halfSpaces;
3203	ExtractHalfSpaces(n, halfSpaces);
3204
3205
3206	BspNodeGeometry *rgeom = new BspNodeGeometry();
3207	ConstructGeometry(mRoot, *rgeom);
3208
3209	nodeStack.push(bspNodePair(mRoot, rgeom));
3210
3211	while (!nodeStack.empty())
3212	{
3213	BspNode *node = nodeStack.top().first;
3214	BspNodeGeometry *geom = nodeStack.top().second;
3215
3216	nodeStack.pop();
3217
3218	if (node->IsLeaf())
3219	{
3220	// test if this leaf is in valid view space
3221	if (node->TreeValid() &&
3222	(node != n) &&
3223	(!onlyUnmailed \|\| !node->Mailed()))
3224	{
3225	bool isAdjacent = true;
3226
3227	// neighbor was found
3228	if (isAdjacent)
3229	{
3230	neighbors.push_back(static_cast<BspLeaf *>(node));
3231	}
3232	}
3233	}
3234	else
3235	{
3236	BspInterior interior = static_cast<BspInterior >(node);
3237
3238	const int cf = Polygon3::ClassifyPlane(nodeGeom.GetPolys(),
3239	interior->GetPlane(),
3240	eps);
3241
3242	BspNode *front = interior->GetFront();
3243	BspNode *back = interior->GetBack();
3244
3245	BspNodeGeometry *fGeom = new BspNodeGeometry();
3246	BspNodeGeometry *bGeom = new BspNodeGeometry();
3247
3248	geom->SplitGeometry(*fGeom,
3249	*bGeom,
3250	interior->GetPlane(),
3251	mBoundingBox,
3252	//0.0000001f);
3253	eps);
3254
3255	if (cf == Polygon3::BACK_SIDE)
3256	{
3257	nodeStack.push(bspNodePair(interior->GetBack(), bGeom));
3258	DEL_PTR(fGeom);
3259	}
3260	else
3261	{
3262	if (cf == Polygon3::FRONT_SIDE)
3263	{
3264	nodeStack.push(bspNodePair(interior->GetFront(), fGeom));
3265	DEL_PTR(bGeom);
3266	}
3267	else
3268	{ // random decision
3269	nodeStack.push(bspNodePair(front, fGeom));
3270	nodeStack.push(bspNodePair(back, bGeom));
3271	}
3272	}
3273	}
3274
3275	DEL_PTR(geom);
3276	}
3277
3278	return (int)neighbors.size();
3279	}
3280
3281
3282
3283	BspLeaf *VspBspTree::GetRandomLeaf(const Plane3 &halfspace)
3284	{
3285	stack<BspNode *> nodeStack;
3286	nodeStack.push(mRoot);
3287
3288	int mask = rand();
3289
3290	while (!nodeStack.empty())
3291	{
3292	BspNode *node = nodeStack.top();
3293	nodeStack.pop();
3294
3295	if (node->IsLeaf())
3296	{
3297	return static_cast<BspLeaf *>(node);
3298	}
3299	else
3300	{
3301	BspInterior interior = static_cast<BspInterior >(node);
3302	BspNode *next;
3303	BspNodeGeometry geom;
3304
3305	// todo: not very efficient: constructs full cell everytime
3306	ConstructGeometry(interior, geom);
3307
3308	const int cf =
3309	Polygon3::ClassifyPlane(geom.GetPolys(), halfspace, mEpsilon);
3310
3311	if (cf == Polygon3::BACK_SIDE)
3312	next = interior->GetFront();
3313	else
3314	if (cf == Polygon3::FRONT_SIDE)
3315	next = interior->GetFront();
3316	else
3317	{
3318	// random decision
3319	if (mask & 1)
3320	next = interior->GetBack();
3321	else
3322	next = interior->GetFront();
3323	mask = mask >> 1;
3324	}
3325
3326	nodeStack.push(next);
3327	}
3328	}
3329
3330	return NULL;
3331	}
3332
3333
3334	BspLeaf *VspBspTree::GetRandomLeaf(const bool onlyUnmailed)
3335	{
3336	stack<BspNode *> nodeStack;
3337
3338	nodeStack.push(mRoot);
3339
3340	int mask = rand();
3341
3342	while (!nodeStack.empty())
3343	{
3344	BspNode *node = nodeStack.top();
3345	nodeStack.pop();
3346
3347	if (node->IsLeaf())
3348	{
3349	if ( (!onlyUnmailed \|\| !node->Mailed()) )
3350	return static_cast<BspLeaf *>(node);
3351	}
3352	else
3353	{
3354	BspInterior interior = static_cast<BspInterior >(node);
3355
3356	// random decision
3357	if (mask & 1)
3358	nodeStack.push(interior->GetBack());
3359	else
3360	nodeStack.push(interior->GetFront());
3361
3362	mask = mask >> 1;
3363	}
3364	}
3365
3366	return NULL;
3367	}
3368
3369
3370	int VspBspTree::ComputePvsSize(const RayInfoContainer &rays) const
3371	{
3372	int pvsSize = 0;
3373
3374	RayInfoContainer::const_iterator rit, rit_end = rays.end();
3375
3376	Intersectable::NewMail();
3377
3378	for (rit = rays.begin(); rit != rays.end(); ++ rit)
3379	{
3380	VssRay ray = (rit).mRay;
3381
3382	#if COUNT_ORIGIN_OBJECTS
3383	if (ray->mOriginObject)
3384	{
3385	if (!ray->mOriginObject->Mailed())
3386	{
3387	ray->mOriginObject->Mail();
3388	++ pvsSize;
3389	}
3390	}
3391	#endif
3392	if (ray->mTerminationObject)
3393	{
3394	if (!ray->mTerminationObject->Mailed())
3395	{
3396	ray->mTerminationObject->Mail();
3397	++ pvsSize;
3398	}
3399	}
3400	}
3401
3402	return pvsSize;
3403	}
3404
3405
3406	float VspBspTree::GetEpsilon() const
3407	{
3408	return mEpsilon;
3409	}
3410
3411
3412	int VspBspTree::SplitPolygons(const Plane3 &plane,
3413	PolygonContainer &polys,
3414	PolygonContainer &frontPolys,
3415	PolygonContainer &backPolys,
3416	PolygonContainer &coincident) const
3417	{
3418	int splits = 0;
3419
3420	PolygonContainer::const_iterator it, it_end = polys.end();
3421
3422	for (it = polys.begin(); it != polys.end(); ++ it)
3423	{
3424	Polygon3 poly = it;
3425
3426	// classify polygon
3427	const int cf = poly->ClassifyPlane(plane, mEpsilon);
3428
3429	switch (cf)
3430	{
3431	case Polygon3::COINCIDENT:
3432	coincident.push_back(poly);
3433	break;
3434	case Polygon3::FRONT_SIDE:
3435	frontPolys.push_back(poly);
3436	break;
3437	case Polygon3::BACK_SIDE:
3438	backPolys.push_back(poly);
3439	break;
3440	case Polygon3::SPLIT:
3441	backPolys.push_back(poly);
3442	frontPolys.push_back(poly);
3443	++ splits;
3444	break;
3445	default:
3446	Debug << "SHOULD NEVER COME HERE\n";
3447	break;
3448	}
3449	}
3450
3451	return splits;
3452	}
3453
3454
3455	int VspBspTree::CastLineSegment(const Vector3 &origin,
3456	const Vector3 &termination,
3457	ViewCellContainer &viewcells)
3458	{
3459	int hits = 0;
3460	stack<BspRayTraversalData> tStack;
3461
3462	float mint = 0.0f, maxt = 1.0f;
3463
3464	//ViewCell::NewMail();
3465
3466	Vector3 entp = origin;
3467	Vector3 extp = termination;
3468
3469	BspNode *node = mRoot;
3470	BspNode *farChild = NULL;
3471
3472	float t;
3473	const float thresh = 1e-6f; // matt: change this to adjustable value
3474
3475	while (1)
3476	{
3477	if (!node->IsLeaf())
3478	{
3479	BspInterior in = static_cast<BspInterior >(node);
3480
3481	Plane3 &splitPlane = in->GetPlane();
3482
3483	const int entSide = splitPlane.Side(entp, thresh);
3484	const int extSide = splitPlane.Side(extp, thresh);
3485
3486	if (entSide < 0)
3487	{
3488	node = in->GetBack();
3489
3490	// plane does not split ray => no far child
3491	if (extSide <= 0)
3492	continue;
3493
3494	farChild = in->GetFront(); // plane splits ray
3495	}
3496	else if (entSide > 0)
3497	{
3498	node = in->GetFront();
3499
3500	if (extSide >= 0) // plane does not split ray => no far child
3501	continue;
3502
3503	farChild = in->GetBack(); // plane splits ray
3504	}
3505	else // one of the ray end points is on the plane
3506	{
3507	// NOTE: what to do if ray is coincident with plane?
3508	if (extSide < 0)
3509	node = in->GetBack();
3510	else //if (extSide > 0)
3511	node = in->GetFront();
3512	//else break; // coincident => count no intersections
3513
3514	continue; // no far child
3515	}
3516
3517	// push data for far child
3518	tStack.push(BspRayTraversalData(farChild, extp));
3519
3520	// find intersection of ray segment with plane
3521	extp = splitPlane.FindIntersection(origin, extp, &t);
3522	}
3523	else
3524	{
3525	// reached leaf => intersection with view cell
3526	BspLeaf leaf = static_cast<BspLeaf >(node);
3527	ViewCell *viewCell;
3528
3529	// question: always contribute to leaf or to currently active view cell?
3530	// if (0)
3531	// viewCell = mViewCellsTree->GetActiveViewCell(leaf->GetViewCell());
3532	// else
3533	viewCell = leaf->GetViewCell();
3534
3535	if (!viewCell->Mailed())
3536	{
3537	viewcells.push_back(viewCell);
3538	viewCell->Mail();
3539	++ hits;
3540	}
3541
3542	//-- fetch the next far child from the stack
3543	if (tStack.empty())
3544	break;
3545
3546	entp = extp;
3547
3548	const BspRayTraversalData &s = tStack.top();
3549
3550	node = s.mNode;
3551	extp = s.mExitPoint;
3552
3553	tStack.pop();
3554	}
3555	}
3556
3557	return hits;
3558	}
3559
3560
3561
3562
3563	int VspBspTree::TreeDistance(BspNode n1, BspNode n2) const
3564	{
3565	std::deque<BspNode *> path1;
3566	BspNode *p1 = n1;
3567
3568	// create path from node 1 to root
3569	while (p1)
3570	{
3571	if (p1 == n2) // second node on path
3572	return (int)path1.size();
3573
3574	path1.push_front(p1);
3575	p1 = p1->GetParent();
3576	}
3577
3578	int depth = n2->GetDepth();
3579	int d = depth;
3580
3581	BspNode *p2 = n2;
3582
3583	// compare with same depth
3584	while (1)
3585	{
3586	if ((d < (int)path1.size()) && (p2 == path1[d]))
3587	return (depth - d) + ((int)path1.size() - 1 - d);
3588
3589	-- d;
3590	p2 = p2->GetParent();
3591	}
3592
3593	return 0; // never come here
3594	}
3595
3596
3597	BspNode VspBspTree::CollapseTree(BspNode node, int &collapsed)
3598	{
3599	// TODO
3600	#if HAS_TO_BE_REDONE
3601	if (node->IsLeaf())
3602	return node;
3603
3604	BspInterior interior = static_cast<BspInterior >(node);
3605
3606	BspNode *front = CollapseTree(interior->GetFront(), collapsed);
3607	BspNode *back = CollapseTree(interior->GetBack(), collapsed);
3608
3609	if (front->IsLeaf() && back->IsLeaf())
3610	{
3611	BspLeaf frontLeaf = static_cast<BspLeaf >(front);
3612	BspLeaf backLeaf = static_cast<BspLeaf >(back);
3613
3614	//-- collapse tree
3615	if (frontLeaf->GetViewCell() == backLeaf->GetViewCell())
3616	{
3617	BspViewCell *vc = frontLeaf->GetViewCell();
3618
3619	BspLeaf *leaf = new BspLeaf(interior->GetParent(), vc);
3620	leaf->SetTreeValid(frontLeaf->TreeValid());
3621
3622	// replace a link from node's parent
3623	if (leaf->GetParent())
3624	leaf->GetParent()->ReplaceChildLink(node, leaf);
3625	else
3626	mRoot = leaf;
3627
3628	++ collapsed;
3629	delete interior;
3630
3631	return leaf;
3632	}
3633	}
3634	#endif
3635	return node;
3636	}
3637
3638
3639	int VspBspTree::CollapseTree()
3640	{
3641	int collapsed = 0;
3642	//TODO
3643	#if HAS_TO_BE_REDONE
3644	(void)CollapseTree(mRoot, collapsed);
3645
3646	// revalidate leaves
3647	RepairViewCellsLeafLists();
3648	#endif
3649	return collapsed;
3650	}
3651
3652
3653	void VspBspTree::RepairViewCellsLeafLists()
3654	{
3655	// TODO
3656	#if HAS_TO_BE_REDONE
3657	// list not valid anymore => clear
3658	stack<BspNode *> nodeStack;
3659	nodeStack.push(mRoot);
3660
3661	ViewCell::NewMail();
3662
3663	while (!nodeStack.empty())
3664	{
3665	BspNode *node = nodeStack.top();
3666	nodeStack.pop();
3667
3668	if (node->IsLeaf())
3669	{
3670	BspLeaf leaf = static_cast<BspLeaf >(node);
3671
3672	BspViewCell *viewCell = leaf->GetViewCell();
3673
3674	if (!viewCell->Mailed())
3675	{
3676	viewCell->mLeaves.clear();
3677	viewCell->Mail();
3678	}
3679
3680	viewCell->mLeaves.push_back(leaf);
3681
3682	}
3683	else
3684	{
3685	BspInterior interior = static_cast<BspInterior >(node);
3686
3687	nodeStack.push(interior->GetFront());
3688	nodeStack.push(interior->GetBack());
3689	}
3690	}
3691	// TODO
3692	#endif
3693	}
3694
3695
3696	int VspBspTree::CastBeam(Beam &beam)
3697	{
3698	stack<bspNodePair> nodeStack;
3699	BspNodeGeometry *rgeom = new BspNodeGeometry();
3700	ConstructGeometry(mRoot, *rgeom);
3701
3702	nodeStack.push(bspNodePair(mRoot, rgeom));
3703
3704	ViewCell::NewMail();
3705
3706	while (!nodeStack.empty())
3707	{
3708	BspNode *node = nodeStack.top().first;
3709	BspNodeGeometry *geom = nodeStack.top().second;
3710	nodeStack.pop();
3711
3712	AxisAlignedBox3 box;
3713	geom->GetBoundingBox(box);
3714
3715	const int side = beam.ComputeIntersection(box);
3716
3717	switch (side)
3718	{
3719	case -1:
3720	CollectViewCells(node, true, beam.mViewCells, true);
3721	break;
3722	case 0:
3723
3724	if (node->IsLeaf())
3725	{
3726	BspLeaf leaf = static_cast<BspLeaf >(node);
3727
3728	if (!leaf->GetViewCell()->Mailed() && leaf->TreeValid())
3729	{
3730	leaf->GetViewCell()->Mail();
3731	beam.mViewCells.push_back(leaf->GetViewCell());
3732	}
3733	}
3734	else
3735	{
3736	BspInterior interior = static_cast<BspInterior >(node);
3737
3738	BspNode *first = interior->GetFront();
3739	BspNode *second = interior->GetBack();
3740
3741	BspNodeGeometry *firstGeom = new BspNodeGeometry();
3742	BspNodeGeometry *secondGeom = new BspNodeGeometry();
3743
3744	geom->SplitGeometry(*firstGeom,
3745	*secondGeom,
3746	interior->GetPlane(),
3747	mBoundingBox,
3748	//0.0000001f);
3749	mEpsilon);
3750
3751	// decide on the order of the nodes
3752	if (DotProd(beam.mPlanes[0].mNormal,
3753	interior->GetPlane().mNormal) > 0)
3754	{
3755	swap(first, second);
3756	swap(firstGeom, secondGeom);
3757	}
3758
3759	nodeStack.push(bspNodePair(first, firstGeom));
3760	nodeStack.push(bspNodePair(second, secondGeom));
3761	}
3762
3763	break;
3764	default:
3765	// default: cull
3766	break;
3767	}
3768
3769	DEL_PTR(geom);
3770
3771	}
3772
3773	return (int)beam.mViewCells.size();
3774	}
3775
3776
3777	void VspBspTree::SetViewCellsManager(ViewCellsManager *vcm)
3778	{
3779	mViewCellsManager = vcm;
3780	}
3781
3782
3783	int VspBspTree::CollectMergeCandidates(const vector<BspLeaf *> leaves,
3784	vector<MergeCandidate> &candidates)
3785	{
3786	BspLeaf::NewMail();
3787
3788	vector<BspLeaf *>::const_iterator it, it_end = leaves.end();
3789
3790	int numCandidates = 0;
3791
3792	// find merge candidates and push them into queue
3793	for (it = leaves.begin(); it != it_end; ++ it)
3794	{
3795	BspLeaf leaf = it;
3796
3797	// the same leaves must not be part of two merge candidates
3798	leaf->Mail();
3799
3800	vector<BspLeaf *> neighbors;
3801
3802	// appoximate neighbor search has slightl relaxed constraints
3803	if (1)
3804	FindNeighbors(leaf, neighbors, true);
3805	else
3806	FindApproximateNeighbors(leaf, neighbors, true);
3807
3808	vector<BspLeaf *>::const_iterator nit, nit_end = neighbors.end();
3809
3810	// TODO: test if at least one ray goes from one leaf to the other
3811	for (nit = neighbors.begin(); nit != nit_end; ++ nit)
3812	{
3813	if ((*nit)->GetViewCell() != leaf->GetViewCell())
3814	{
3815	MergeCandidate mc(leaf->GetViewCell(), (*nit)->GetViewCell());
3816
3817	if (!leaf->GetViewCell()->GetPvs().Empty() \|\|
3818	!(*nit)->GetViewCell()->GetPvs().Empty() \|\|
3819	leaf->IsSibling(*nit))
3820	{
3821	candidates.push_back(mc);
3822	}
3823
3824	++ numCandidates;
3825	if ((numCandidates % 1000) == 0)
3826	{
3827	cout << "collected " << numCandidates << " merge candidates" << endl;
3828	}
3829	}
3830	}
3831	}
3832
3833	Debug << "merge queue: " << (int)candidates.size() << endl;
3834	Debug << "leaves in queue: " << numCandidates << endl;
3835
3836
3837	return (int)leaves.size();
3838	}
3839
3840
3841	int VspBspTree::CollectMergeCandidates(const VssRayContainer &rays,
3842	vector<MergeCandidate> &candidates)
3843	{
3844	ViewCell::NewMail();
3845	long startTime = GetTime();
3846
3847	map<BspLeaf , vector<BspLeaf> > neighborMap;
3848	ViewCellContainer::const_iterator iit;
3849
3850	int numLeaves = 0;
3851
3852	BspLeaf::NewMail();
3853
3854	for (int i = 0; i < (int)rays.size(); ++ i)
3855	{
3856	VssRay *ray = rays[i];
3857
3858	// traverse leaves stored in the rays and compare and
3859	// merge consecutive leaves (i.e., the neighbors in the tree)
3860	if (ray->mViewCells.size() < 2)
3861	continue;
3862
3863	iit = ray->mViewCells.begin();
3864	BspViewCell bspVc = static_cast<BspViewCell >(*(iit ++));
3865	BspLeaf *leaf = bspVc->mLeaves[0];
3866
3867	// traverse intersections
3868	// consecutive leaves are neighbors => add them to queue
3869	for (; iit != ray->mViewCells.end(); ++ iit)
3870	{
3871	// next pair
3872	BspLeaf *prevLeaf = leaf;
3873	bspVc = static_cast<BspViewCell >(iit);
3874	leaf = bspVc->mLeaves[0]; // exactly one leaf
3875
3876	// view space not valid or same view cell
3877	if (!leaf->TreeValid() \|\| !prevLeaf->TreeValid() \|\|
3878	(leaf->GetViewCell() == prevLeaf->GetViewCell()))
3879	continue;
3880
3881	vector<BspLeaf *> &neighbors = neighborMap[leaf];
3882
3883	bool found = false;
3884
3885	// both leaves inserted in queue already =>
3886	// look if double pair already exists
3887	if (leaf->Mailed() && prevLeaf->Mailed())
3888	{
3889	vector<BspLeaf *>::const_iterator it, it_end = neighbors.end();
3890
3891	for (it = neighbors.begin(); !found && (it != it_end); ++ it)
3892	if (*it == prevLeaf)
3893	found = true; // already in queue
3894	}
3895
3896	if (!found)
3897	{
3898	// this pair is not in map yet
3899	// => insert into the neighbor map and the queue
3900	neighbors.push_back(prevLeaf);
3901	neighborMap[prevLeaf].push_back(leaf);
3902
3903	leaf->Mail();
3904	prevLeaf->Mail();
3905
3906	MergeCandidate mc(leaf->GetViewCell(), prevLeaf->GetViewCell());
3907
3908	candidates.push_back(mc);
3909
3910	if (((int)candidates.size() % 1000) == 0)
3911	{
3912	cout << "collected " << (int)candidates.size() << " merge candidates" << endl;
3913	}
3914	}
3915	}
3916	}
3917
3918	Debug << "neighbormap size: " << (int)neighborMap.size() << endl;
3919	Debug << "merge queue: " << (int)candidates.size() << endl;
3920	Debug << "leaves in queue: " << numLeaves << endl;
3921
3922
3923	//-- collect the leaves which haven't been found by ray casting
3924	if (0)
3925	{
3926	cout << "finding additional merge candidates using geometry" << endl;
3927	vector<BspLeaf *> leaves;
3928	CollectLeaves(leaves, true);
3929	Debug << "found " << (int)leaves.size() << " new leaves" << endl << endl;
3930	CollectMergeCandidates(leaves, candidates);
3931	}
3932
3933	return numLeaves;
3934	}
3935
3936
3937
3938
3939	ViewCell *VspBspTree::GetViewCell(const Vector3 &point, const bool active)
3940	{
3941	if (mRoot == NULL)
3942	return NULL;
3943
3944	stack<BspNode *> nodeStack;
3945	nodeStack.push(mRoot);
3946
3947	ViewCellLeaf *viewcell = NULL;
3948
3949	while (!nodeStack.empty())
3950	{
3951	BspNode *node = nodeStack.top();
3952	nodeStack.pop();
3953
3954	if (node->IsLeaf())
3955	{
3956	viewcell = static_cast<BspLeaf *>(node)->GetViewCell();
3957	break;
3958	}
3959	else
3960	{
3961	BspInterior interior = static_cast<BspInterior >(node);
3962
3963	// random decision
3964	if (interior->GetPlane().Side(point) < 0)
3965	nodeStack.push(interior->GetBack());
3966	else
3967	nodeStack.push(interior->GetFront());
3968	}
3969	}
3970
3971	if (active)
3972	return mViewCellsTree->GetActiveViewCell(viewcell);
3973	else
3974	return viewcell;
3975	}
3976
3977
3978	bool VspBspTree::ViewPointValid(const Vector3 &viewPoint) const
3979	{
3980	BspNode *node = mRoot;
3981
3982	while (1)
3983	{
3984	// early exit
3985	if (node->TreeValid())
3986	return true;
3987
3988	if (node->IsLeaf())
3989	return false;
3990
3991	BspInterior in = static_cast<BspInterior >(node);
3992
3993	if (in->GetPlane().Side(viewPoint) <= 0)
3994	{
3995	node = in->GetBack();
3996	}
3997	else
3998	{
3999	node = in->GetFront();
4000	}
4001	}
4002
4003	// should never come here
4004	return false;
4005	}
4006
4007
4008	void VspBspTree::PropagateUpValidity(BspNode *node)
4009	{
4010	const bool isValid = node->TreeValid();
4011
4012	// propagative up invalid flag until only invalid nodes exist over this node
4013	if (!isValid)
4014	{
4015	while (!node->IsRoot() && node->GetParent()->TreeValid())
4016	{
4017	node = node->GetParent();
4018	node->SetTreeValid(false);
4019	}
4020	}
4021	else
4022	{
4023	// propagative up valid flag until one of the subtrees is invalid
4024	while (!node->IsRoot() && !node->TreeValid())
4025	{
4026	node = node->GetParent();
4027	BspInterior interior = static_cast<BspInterior >(node);
4028
4029	// the parent is valid iff both leaves are valid
4030	node->SetTreeValid(interior->GetBack()->TreeValid() &&
4031	interior->GetFront()->TreeValid());
4032	}
4033	}
4034	}
4035
4036
4037	bool VspBspTree::Export(OUT_STREAM &stream)
4038	{
4039	ExportNode(mRoot, stream);
4040	return true;
4041	}
4042
4043
4044	void VspBspTree::ExportNode(BspNode *node, OUT_STREAM &stream)
4045	{
4046	if (node->IsLeaf())
4047	{
4048	BspLeaf leaf = static_cast<BspLeaf >(node);
4049	ViewCell *viewCell = mViewCellsTree->GetActiveViewCell(leaf->GetViewCell());
4050
4051	int id = -1;
4052	if (viewCell != mOutOfBoundsCell)
4053	id = viewCell->GetId();
4054
4055	stream << "<Leaf viewCellId=\"" << id << "\" />" << endl;
4056	}
4057	else
4058	{
4059	BspInterior interior = static_cast<BspInterior >(node);
4060
4061	Plane3 plane = interior->GetPlane();
4062	stream << "<Interior plane=\"" << plane.mNormal.x << " "
4063	<< plane.mNormal.y << " " << plane.mNormal.z << " "
4064	<< plane.mD << "\">" << endl;
4065
4066	ExportNode(interior->GetBack(), stream);
4067	ExportNode(interior->GetFront(), stream);
4068
4069	stream << "</Interior>" << endl;
4070	}
4071	}
4072
4073	}

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

Download in other formats: