Context Navigation

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

Revision 2072, 98.6 KB checked in by mattausch, 17 years ago (diff)
prepared view cell generation that is useable. changed back view cell generation to vsp osp.

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 && ray->mOriginObject)
1280	{
1281	if (vc->AddPvsSample(ray->mOriginObject, ray->mPdf, contribution))
1282	madeContrib = true;
1283
1284	sc += contribution;
1285	}
1286
1287	sampleContributions += sc;
1288
1289	if (madeContrib)
1290	++ contributingSamples;
1291	}
1292	}
1293
1294
1295	void VspBspTree::SortSubdivisionCandidates(const RayInfoContainer &rays,
1296	const int axis,
1297	float minBand,
1298	float maxBand)
1299	{
1300	mLocalSubdivisionCandidates->clear();
1301
1302	const int requestedSize = 2 * (int)(rays.size());
1303
1304	// creates a sorted split candidates array
1305	if (mLocalSubdivisionCandidates->capacity() > 500000 &&
1306	requestedSize < (int)(mLocalSubdivisionCandidates->capacity() / 10) )
1307	{
1308	delete mLocalSubdivisionCandidates;
1309	mLocalSubdivisionCandidates = new vector<SortableEntry>;
1310	}
1311
1312	mLocalSubdivisionCandidates->reserve(requestedSize);
1313
1314	if (0)
1315	{ // float values => don't compare with exact values
1316	minBand += Limits::Small;
1317	maxBand -= Limits::Small;
1318	}
1319
1320	// insert all queries
1321	for (RayInfoContainer::const_iterator ri = rays.begin(); ri < rays.end(); ++ ri)
1322	{
1323	const bool positive = (*ri).mRay->HasPosDir(axis);
1324	float pos = (*ri).ExtrapOrigin(axis);
1325
1326	// clamp to min / max band
1327	if (0) ClipValue(pos, minBand, maxBand);
1328
1329	mLocalSubdivisionCandidates->
1330	push_back(SortableEntry(positive ? SortableEntry::ERayMin : SortableEntry::ERayMax,
1331	pos, (*ri).mRay));
1332
1333	pos = (*ri).ExtrapTermination(axis);
1334
1335	// clamp to min / max band
1336	if (0) ClipValue(pos, minBand, maxBand);
1337
1338	mLocalSubdivisionCandidates->
1339	push_back(SortableEntry(positive ? SortableEntry::ERayMax : SortableEntry::ERayMin,
1340	pos, (*ri).mRay));
1341	}
1342
1343	sort(mLocalSubdivisionCandidates->begin(), mLocalSubdivisionCandidates->end());
1344	}
1345
1346
1347	float VspBspTree::BestCostRatioHeuristics(const RayInfoContainer &rays,
1348	const AxisAlignedBox3 &box,
1349	const int pvsSize,
1350	const int axis,
1351	float &position)
1352	{
1353	RayInfoContainer usedRays;
1354
1355	if (mMaxTests < (int)rays.size())
1356	{
1357	GetRayInfoSets(rays, mMaxTests, usedRays);
1358	}
1359	else
1360	{
1361	usedRays = rays;
1362	}
1363
1364	const float minBox = box.Min(axis);
1365	const float maxBox = box.Max(axis);
1366
1367	const float sizeBox = maxBox - minBox;
1368
1369	const float minBand = minBox + mMinBand * sizeBox;
1370	const float maxBand = minBox + mMaxBand * sizeBox;
1371
1372	SortSubdivisionCandidates(usedRays, axis, minBand, maxBand);
1373
1374	//////////////////
1375	// go through the lists, count the number of objects left and right
1376	// and evaluate the following cost funcion:
1377	// C = ct_div_ci + (qlrl + qrrr)/queries
1378
1379	float pvsl = 0;
1380	float pvsr = (float)pvsSize;
1381
1382	float pvsBack = pvsl;
1383	float pvsFront = pvsr;
1384
1385	float sum = (float)pvsSize * sizeBox;
1386	float minSum = 1e20f;
1387
1388	// if no border can be found, take mid split
1389	position = minBox + 0.5f * sizeBox;
1390
1391	// the relative cost ratio
1392	float ratio = 99999999.0f;
1393	bool splitPlaneFound = false;
1394
1395	Intersectable::NewMail();
1396	RayInfoContainer::const_iterator ri, ri_end = usedRays.end();
1397
1398	// set all object as belonging to the front pvs
1399	for(ri = usedRays.begin(); ri != ri_end; ++ ri)
1400	{
1401	Intersectable oObject = (ri).mRay->mOriginObject;
1402	Intersectable tObject = (ri).mRay->mTerminationObject;
1403
1404	if (COUNT_ORIGIN_OBJECTS && oObject)
1405	{
1406	if (!oObject->Mailed())
1407	{
1408	oObject->Mail();
1409	oObject->mCounter = 1;
1410	}
1411	else
1412	{
1413	++ oObject->mCounter;
1414	}
1415	}
1416
1417	if (tObject)
1418	{
1419	if (!tObject->Mailed())
1420	{
1421	tObject->Mail();
1422	tObject->mCounter = 1;
1423	}
1424	else
1425	{
1426	++ tObject->mCounter;
1427	}
1428	}
1429	}
1430
1431	Intersectable::NewMail();
1432	vector<SortableEntry>::const_iterator ci, ci_end = mLocalSubdivisionCandidates->end();
1433
1434	for (ci = mLocalSubdivisionCandidates->begin(); ci != ci_end; ++ ci)
1435	{
1436	VssRay *ray;
1437	ray = (*ci).ray;
1438
1439	Intersectable *oObject = ray->mOriginObject;
1440	Intersectable *tObject = ray->mTerminationObject;
1441
1442	switch ((*ci).type)
1443	{
1444	case SortableEntry::ERayMin:
1445	{
1446	if (COUNT_ORIGIN_OBJECTS && oObject && !oObject->Mailed())
1447	{
1448	oObject->Mail();
1449	++ pvsl;
1450	}
1451
1452	if (tObject && !tObject->Mailed())
1453	{
1454	tObject->Mail();
1455	++ pvsl;
1456	}
1457
1458	break;
1459	}
1460	case SortableEntry::ERayMax:
1461	{
1462	if (COUNT_ORIGIN_OBJECTS && oObject)
1463	{
1464	if (-- oObject->mCounter == 0)
1465	-- pvsr;
1466	}
1467
1468	if (tObject)
1469	{
1470	if (-- tObject->mCounter == 0)
1471	-- pvsr;
1472	}
1473
1474	break;
1475	}
1476	}
1477
1478
1479	// Note: we compare size of bounding boxes of front and back side because
1480	// of efficiency reasons (otherwise a new geometry would have to be computed
1481	// in each step and incremential evaluation would be difficult.
1482	// but then errors happen if the geometry is not an axis aligned box
1483	// (i.e., if a geometry aligned split was taken before)
1484	// question: is it sufficient to make this approximation?
1485	if (((ci).value >= minBand) && ((ci).value <= maxBand))
1486	{
1487	sum = pvsl * ((ci).value - minBox) + pvsr (maxBox - (*ci).value);
1488
1489	float currentPos;
1490
1491	// HACK: current positition is BETWEEN visibility events
1492	if (0 && ((ci + 1) != ci_end))
1493	{
1494	currentPos = ((ci).value + ((ci + 1)).value) * 0.5f;
1495	}
1496	else
1497	currentPos = (*ci).value;
1498
1499	//Debug << "pos=" << (*ci).value << "\t pvs=(" << pvsl << "," << pvsr << ")" << endl;
1500	//Debug << "cost= " << sum << endl;
1501
1502	if (sum < minSum)
1503	{
1504	splitPlaneFound = true;
1505
1506	minSum = sum;
1507	position = currentPos;
1508
1509	pvsBack = pvsl;
1510	pvsFront = pvsr;
1511	}
1512	}
1513	}
1514
1515	///////
1516	//-- compute cost
1517
1518	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
1519	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
1520
1521	const float pOverall = sizeBox;
1522
1523	const float pBack = position - minBox;
1524	const float pFront = maxBox - position;
1525
1526	const float penaltyOld = EvalPvsPenalty((float)pvsSize, lowerPvsLimit, upperPvsLimit);
1527	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
1528	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
1529
1530	const float oldRenderCost = penaltyOld * pOverall;
1531	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
1532
1533	if (splitPlaneFound)
1534	{
1535	ratio = mPvsFactor * newRenderCost / (oldRenderCost + Limits::Small);
1536	}
1537	//if (axis != 1)
1538	//Debug << "axis=" << axis << " costRatio=" << ratio << " pos=" << position << " t=" << (position - minBox) / (maxBox - minBox)
1539	// <<"\t pb=(" << pvsBack << ")\t pf=(" << pvsFront << ")" << endl;
1540
1541	return ratio;
1542	}
1543
1544
1545	float VspBspTree::SelectAxisAlignedPlane(Plane3 &plane,
1546	const VspBspTraversalData &tData,
1547	int &axis,
1548	BspNodeGeometry **frontGeom,
1549	BspNodeGeometry **backGeom,
1550	float &pFront,
1551	float &pBack,
1552	const bool isKdNode)
1553	{
1554	float nPosition[3];
1555	float nCostRatio[3];
1556	float nProbFront[3];
1557	float nProbBack[3];
1558
1559	BspNodeGeometry *nFrontGeom[3];
1560	BspNodeGeometry *nBackGeom[3];
1561
1562	// set to NULL, so I can find out which gemetry was stored
1563	for (int i = 0; i < 3; ++ i)
1564	{
1565	nFrontGeom[i] = NULL;
1566	nBackGeom[i] = NULL;
1567	}
1568
1569	// create bounding box of node geometry
1570	AxisAlignedBox3 box;
1571
1572	//TODO: for kd split geometry already is box => only take minmax vertices
1573	if (1)
1574	{ // get bounding box from geometry
1575	tData.mGeometry->GetBoundingBox(box);
1576	}
1577	else
1578	{
1579	box.Initialize();
1580	RayInfoContainer::const_iterator ri, ri_end = tData.mRays->end();
1581
1582	for(ri = tData.mRays->begin(); ri < ri_end; ++ ri)
1583	box.Include((*ri).ExtrapTermination());
1584	}
1585
1586
1587	int sAxis = 0;
1588	int bestAxis;
1589
1590	// if max cost ratio is exceeded, take split along longest axis instead
1591	const float maxCostRatioForArbitraryAxis = 0.9f;
1592
1593	if (mUseDrivingAxisIfMaxCostViolated)
1594	bestAxis = box.Size().DrivingAxis();
1595	else
1596	bestAxis = -1;
1597
1598	#if 0
1599	// maximum cost ratio for axis to be valid:
1600	// if exceeded, spatial mid split is used instead
1601	const maxCostRatioForHeur = 0.99f;
1602	#endif
1603
1604	// if we use some kind of specialised fixed axis
1605	const bool useSpecialAxis =
1606	mOnlyDrivingAxis \|\| mUseRandomAxis \|\| mCirculatingAxis;
1607
1608	if (mUseRandomAxis)
1609	sAxis = Random(3);
1610	else if (mCirculatingAxis)
1611	sAxis = (tData.mAxis + 1) % 3;
1612	else if (mOnlyDrivingAxis)
1613	sAxis = box.Size().DrivingAxis();
1614
1615
1616	//Debug << "use special axis: " << useSpecialAxis << endl;
1617	//Debug << "axis: " << sAxis << " drivingaxis: " << box.Size().DrivingAxis();
1618
1619	for (axis = 0; axis < 3 ; ++ axis)
1620	{
1621	if (!useSpecialAxis \|\| (axis == sAxis))
1622	{
1623	if (mUseCostHeuristics)
1624	{
1625	//-- place split plane using heuristics
1626	nCostRatio[axis] =
1627	BestCostRatioHeuristics(*tData.mRays,
1628	box,
1629	tData.mPvs,
1630	axis,
1631	nPosition[axis]);
1632	}
1633	else
1634	{
1635	//-- split plane position is spatial median
1636	nPosition[axis] = (box.Min()[axis] + box.Max()[axis]) * 0.5f;
1637	Vector3 normal(0,0,0); normal[axis] = 1.0f;
1638
1639	// allows faster split because we have axis aligned kd tree boxes
1640	if (isKdNode)
1641	{
1642	nCostRatio[axis] = EvalAxisAlignedSplitCost(tData,
1643	box,
1644	axis,
1645	nPosition[axis],
1646	nProbFront[axis],
1647	nProbBack[axis]);
1648
1649	// create back geometry from box
1650
1651	// NOTE: the geometry is returned from the function so we
1652	// don't have to recompute it when possible
1653	Vector3 pos;
1654
1655	pos = box.Max(); pos[axis] = nPosition[axis];
1656	AxisAlignedBox3 bBox(box.Min(), pos);
1657
1658	PolygonContainer fPolys;
1659	bBox.ExtractPolys(fPolys);
1660
1661	nBackGeom[axis] = new BspNodeGeometry(fPolys);
1662
1663	////////////
1664	//-- create front geometry from box
1665
1666	pos = box.Min(); pos[axis] = nPosition[axis];
1667	AxisAlignedBox3 fBox(pos, box.Max());
1668
1669	PolygonContainer bPolys;
1670	fBox.ExtractPolys(bPolys);
1671	nFrontGeom[axis] = new BspNodeGeometry(bPolys);
1672	}
1673	else
1674	{
1675	nFrontGeom[axis] = new BspNodeGeometry();
1676	nBackGeom[axis] = new BspNodeGeometry();
1677
1678	nCostRatio[axis] =
1679	EvalSplitPlaneCost(Plane3(normal, nPosition[axis]),
1680	tData, nFrontGeom[axis], nBackGeom[axis],
1681	nProbFront[axis], nProbBack[axis]);
1682	}
1683	}
1684
1685
1686	if (mUseDrivingAxisIfMaxCostViolated)
1687	{
1688	// we take longest axis split if cost ratio exceeds threshold
1689	if (nCostRatio[axis] < min(maxCostRatioForArbitraryAxis, nCostRatio[bestAxis]))
1690	{
1691	bestAxis = axis;
1692	}
1693	/*else if (nCostRatio[axis] < nCostRatio[bestAxis])
1694	{
1695	Debug << "taking split along longest axis (" << bestAxis << ") instead of (" << axis << ")" << endl;
1696	}*/
1697
1698	}
1699	else
1700	{
1701	if (bestAxis == -1)
1702	{
1703	bestAxis = axis;
1704	}
1705	else if (nCostRatio[axis] < nCostRatio[bestAxis])
1706	{
1707	bestAxis = axis;
1708	}
1709	}
1710	}
1711	}
1712
1713	//////////
1714	//-- assign values
1715
1716	axis = bestAxis;
1717	pFront = nProbFront[bestAxis];
1718	pBack = nProbBack[bestAxis];
1719
1720	// assign best split nodes geometry
1721	*frontGeom = nFrontGeom[bestAxis];
1722	*backGeom = nBackGeom[bestAxis];
1723
1724	// and delete other geometry
1725	DEL_PTR(nFrontGeom[(bestAxis + 1) % 3]);
1726	DEL_PTR(nBackGeom[(bestAxis + 2) % 3]);
1727
1728	//-- split plane
1729	Vector3 normal(0,0,0); normal[bestAxis] = 1;
1730	plane = Plane3(normal, nPosition[bestAxis]);
1731
1732	//Debug << "best axis: " << bestAxis << " pos " << nPosition[bestAxis] << endl;
1733
1734	return nCostRatio[bestAxis];
1735	}
1736
1737
1738	bool VspBspTree::SelectPlane(Plane3 &bestPlane,
1739	BspLeaf *leaf,
1740	VspBspTraversalData &data,
1741	VspBspTraversalData &frontData,
1742	VspBspTraversalData &backData,
1743	int &splitAxis)
1744	{
1745	// HACK matt: subdivide regularily to certain depth
1746	if (data.mDepth < 0) // question matt: why depth < 0 ?
1747	{
1748	cout << "depth: " << data.mDepth << endl;
1749
1750	// return axis aligned split
1751	AxisAlignedBox3 box;
1752	box.Initialize();
1753
1754	// create bounding box of region
1755	data.mGeometry->GetBoundingBox(box);
1756
1757	const int axis = box.Size().DrivingAxis();
1758	const Vector3 position = (box.Min()[axis] + box.Max()[axis]) * 0.5f;
1759
1760	Vector3 norm(0,0,0); norm[axis] = 1.0f;
1761	bestPlane = Plane3(norm, position);
1762	splitAxis = axis;
1763
1764	return true;
1765	}
1766
1767	// simplest strategy: just take next polygon
1768	if (mSplitPlaneStrategy & RANDOM_POLYGON)
1769	{
1770	if (!data.mPolygons->empty())
1771	{
1772	const int randIdx =
1773	(int)RandomValue(0, (Real)((int)data.mPolygons->size() - 1));
1774	Polygon3 nextPoly = (data.mPolygons)[randIdx];
1775
1776	bestPlane = nextPoly->GetSupportingPlane();
1777	return true;
1778	}
1779	}
1780
1781	//-- use heuristics to find appropriate plane
1782
1783	// intermediate plane
1784	Plane3 plane;
1785	float lowestCost = MAX_FLOAT;
1786
1787	// decides if the first few splits should be only axisAligned
1788	const bool onlyAxisAligned =
1789	(mSplitPlaneStrategy & AXIS_ALIGNED) &&
1790	((int)data.mRays->size() > mTermMinRaysForAxisAligned) &&
1791	((int)data.GetAvgRayContribution() < mTermMaxRayContriForAxisAligned);
1792
1793	const int limit = onlyAxisAligned ? 0 :
1794	Min((int)data.mPolygons->size(), mMaxPolyCandidates);
1795
1796	float candidateCost;
1797
1798	int maxIdx = (int)data.mPolygons->size();
1799
1800	for (int i = 0; i < limit; ++ i)
1801	{
1802	// the already taken candidates are stored behind maxIdx
1803	// => assure that no index is taken twice
1804	const int candidateIdx = (int)RandomValue(0, (Real)(-- maxIdx));
1805	Polygon3 poly = (data.mPolygons)[candidateIdx];
1806
1807	// swap candidate to the end to avoid testing same plane
1808	std::swap((data.mPolygons)[maxIdx], (data.mPolygons)[candidateIdx]);
1809	//Polygon3 poly = (data.mPolygons)[(int)RandomValue(0, (int)polys.size() - 1)];
1810
1811	// evaluate current candidate
1812	BspNodeGeometry fGeom, bGeom;
1813	float fArea, bArea;
1814	plane = poly->GetSupportingPlane();
1815	candidateCost = EvalSplitPlaneCost(plane, data, fGeom, bGeom, fArea, bArea);
1816
1817	if (candidateCost < lowestCost)
1818	{
1819	bestPlane = plane;
1820	lowestCost = candidateCost;
1821	}
1822	}
1823
1824
1825	//-- evaluate axis aligned splits
1826
1827	int axis;
1828	BspNodeGeometry fGeom, bGeom;
1829	float pFront, pBack;
1830
1831	candidateCost = 99999999.0f;
1832
1833	// as a variant, we take axis aligned split only if there is
1834	// more polygon available to guide the split
1835	if (!mUsePolygonSplitIfAvailable \|\| data.mPolygons->empty())
1836	{
1837	candidateCost = SelectAxisAlignedPlane(plane,
1838	data,
1839	axis,
1840	&fGeom,
1841	&bGeom,
1842	pFront,
1843	pBack,
1844	data.mIsKdNode);
1845	}
1846
1847	splitAxis = 3;
1848
1849	if (candidateCost < lowestCost)
1850	{
1851	bestPlane = plane;
1852	lowestCost = candidateCost;
1853	splitAxis = axis;
1854
1855	// assign already computed values
1856	// we can do this because we always save the
1857	// computed values from the axis aligned splits
1858
1859	if (fGeom && bGeom)
1860	{
1861	frontData.mGeometry = fGeom;
1862	backData.mGeometry = bGeom;
1863
1864	frontData.mProbability = pFront;
1865	backData.mProbability = pBack;
1866	}
1867	}
1868	else
1869	{
1870	DEL_PTR(fGeom);
1871	DEL_PTR(bGeom);
1872	}
1873
1874	#ifdef GTP_DEBUG
1875	Debug << "plane lowest cost: " << lowestCost << endl;
1876	#endif
1877
1878	// exeeded relative max cost ratio
1879	if (lowestCost > mTermMaxCostRatio)
1880	{
1881	return false;
1882	}
1883
1884	return true;
1885	}
1886
1887
1888	Plane3 VspBspTree::ChooseCandidatePlane(const RayInfoContainer &rays) const
1889	{
1890	const int candidateIdx = (int)RandomValue(0, (Real)((int)rays.size() - 1));
1891
1892	const Vector3 minPt = rays[candidateIdx].ExtrapOrigin();
1893	const Vector3 maxPt = rays[candidateIdx].ExtrapTermination();
1894
1895	const Vector3 pt = (maxPt + minPt) * 0.5;
1896	const Vector3 normal = Normalize(rays[candidateIdx].mRay->GetDir());
1897
1898	return Plane3(normal, pt);
1899	}
1900
1901
1902	Plane3 VspBspTree::ChooseCandidatePlane2(const RayInfoContainer &rays) const
1903	{
1904	Vector3 pt[3];
1905
1906	int idx[3];
1907	int cmaxT = 0;
1908	int cminT = 0;
1909	bool chooseMin = false;
1910
1911	for (int j = 0; j < 3; ++ j)
1912	{
1913	idx[j] = (int)RandomValue(0, (Real)((int)rays.size() * 2 - 1));
1914
1915	if (idx[j] >= (int)rays.size())
1916	{
1917	idx[j] -= (int)rays.size();
1918
1919	chooseMin = (cminT < 2);
1920	}
1921	else
1922	chooseMin = (cmaxT < 2);
1923
1924	RayInfo rayInf = rays[idx[j]];
1925	pt[j] = chooseMin ? rayInf.ExtrapOrigin() : rayInf.ExtrapTermination();
1926	}
1927
1928	return Plane3(pt[0], pt[1], pt[2]);
1929	}
1930
1931
1932	Plane3 VspBspTree::ChooseCandidatePlane3(const RayInfoContainer &rays) const
1933	{
1934	Vector3 pt[3];
1935
1936	int idx1 = (int)RandomValue(0, (Real)((int)rays.size() - 1));
1937	int idx2 = (int)RandomValue(0, (Real)((int)rays.size() - 1));
1938
1939	// check if rays different
1940	if (idx1 == idx2)
1941	idx2 = (idx2 + 1) % (int)rays.size();
1942
1943	const RayInfo ray1 = rays[idx1];
1944	const RayInfo ray2 = rays[idx2];
1945
1946	// normal vector of the plane parallel to both lines
1947	const Vector3 norm = Normalize(CrossProd(ray1.mRay->GetDir(), ray2.mRay->GetDir()));
1948
1949	// vector from line 1 to line 2
1950	const Vector3 vd = ray2.ExtrapOrigin() - ray1.ExtrapOrigin();
1951
1952	// project vector on normal to get distance
1953	const float dist = DotProd(vd, norm);
1954
1955	// point on plane lies halfway between the two planes
1956	const Vector3 planePt = ray1.ExtrapOrigin() + norm * dist * 0.5;
1957
1958	return Plane3(norm, planePt);
1959	}
1960
1961
1962	inline void VspBspTree::GenerateUniqueIdsForPvs()
1963	{
1964	Intersectable::NewMail(); sBackId = Intersectable::sMailId;
1965	Intersectable::NewMail(); sFrontId = Intersectable::sMailId;
1966	Intersectable::NewMail(); sFrontAndBackId = Intersectable::sMailId;
1967	}
1968
1969
1970	float VspBspTree::EvalRenderCostDecrease(const Plane3 &candidatePlane,
1971	const VspBspTraversalData &data,
1972	float &normalizedOldRenderCost) const
1973	{
1974	float pvsFront = 0;
1975	float pvsBack = 0;
1976	float totalPvs = 0;
1977
1978	// probability that view point lies in back / front node
1979	float pOverall = data.mProbability;
1980	float pFront = 0;
1981	float pBack = 0;
1982
1983
1984	// create unique ids for pvs heuristics
1985	GenerateUniqueIdsForPvs();
1986
1987	for (int i = 0; i < data.mRays->size(); ++ i)
1988	{
1989	RayInfo rayInf = (*data.mRays)[i];
1990
1991	float t;
1992	VssRay *ray = rayInf.mRay;
1993	const int cf = rayInf.ComputeRayIntersection(candidatePlane, t);
1994
1995	// find front and back pvs for origing and termination object
1996	AddObjToPvs(ray->mTerminationObject, cf, pvsFront, pvsBack, totalPvs);
1997
1998	if (COUNT_ORIGIN_OBJECTS)
1999	{
2000	AddObjToPvs(ray->mOriginObject, cf, pvsFront, pvsBack, totalPvs);
2001	}
2002	}
2003
2004
2005	BspNodeGeometry geomFront;
2006	BspNodeGeometry geomBack;
2007
2008	// construct child geometry with regard to the candidate split plane
2009	data.mGeometry->SplitGeometry(geomFront,
2010	geomBack,
2011	candidatePlane,
2012	mBoundingBox,
2013	//0.0f);
2014	mEpsilon);
2015
2016	if (!mUseAreaForPvs) // use front and back cell areas to approximate volume
2017	{
2018	pFront = geomFront.GetVolume();
2019	pBack = pOverall - pFront;
2020
2021	// something is wrong with the volume
2022	if (0 && ((pFront < 0.0) \|\| (pBack < 0.0)))
2023	{
2024	Debug << "ERROR in volume:\n"
2025	<< "volume f :" << pFront << " b: " << pBack << " p: " << pOverall
2026	<< ", real volume f: " << pFront << " b: " << geomBack.GetVolume()
2027	<< ", #polygons f: " << geomFront.Size() << " b: " << geomBack.Size() << " p: " << data.mGeometry->Size() << endl;
2028	}
2029	}
2030	else
2031	{
2032	pFront = geomFront.GetArea();
2033	pBack = geomBack.GetArea();
2034	}
2035
2036
2037	// -- pvs rendering heuristics
2038
2039	// upper and lower bounds
2040	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
2041	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
2042
2043	const float penaltyOld = EvalPvsPenalty(totalPvs, lowerPvsLimit, upperPvsLimit);
2044	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
2045	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
2046
2047	const float oldRenderCost = pOverall * penaltyOld;
2048	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
2049
2050	const float renderCostDecrease = (oldRenderCost - newRenderCost) / mBoundingBox.GetVolume();
2051
2052	// take render cost of node into account to avoid being stuck in a local minimum
2053	normalizedOldRenderCost = oldRenderCost / mBoundingBox.GetVolume();
2054
2055	return renderCostDecrease;
2056	}
2057
2058
2059	float VspBspTree::EvalSplitPlaneCost(const Plane3 &candidatePlane,
2060	const VspBspTraversalData &data,
2061	BspNodeGeometry &geomFront,
2062	BspNodeGeometry &geomBack,
2063	float &pFront,
2064	float &pBack) const
2065	{
2066	float totalPvs = 0;
2067	float pvsFront = 0;
2068	float pvsBack = 0;
2069
2070	// overall probability is used as normalizer
2071	float pOverall = 0;
2072
2073	// probability that view point lies in back / front node
2074	pFront = 0;
2075	pBack = 0;
2076
2077	int numTests; // the number of tests
2078
2079	// if random samples shold be taken instead of testing all the rays
2080	bool useRand;
2081
2082	if ((int)data.mRays->size() > mMaxTests)
2083	{
2084	useRand = true;
2085	numTests = mMaxTests;
2086	}
2087	else
2088	{
2089	useRand = false;
2090	numTests = (int)data.mRays->size();
2091	}
2092
2093	// create unique ids for pvs heuristics
2094	GenerateUniqueIdsForPvs();
2095
2096	for (int i = 0; i < numTests; ++ i)
2097	{
2098	const int testIdx = useRand ?
2099	(int)RandomValue(0, (Real)((int)data.mRays->size() - 1)) : i;
2100	RayInfo rayInf = (*data.mRays)[testIdx];
2101
2102	float t;
2103	VssRay *ray = rayInf.mRay;
2104	const int cf = rayInf.ComputeRayIntersection(candidatePlane, t);
2105
2106	// find front and back pvs for origing and termination object
2107	AddObjToPvs(ray->mTerminationObject, cf, pvsFront, pvsBack, totalPvs);
2108
2109	if (COUNT_ORIGIN_OBJECTS)
2110	{
2111	AddObjToPvs(ray->mOriginObject, cf, pvsFront, pvsBack, totalPvs);
2112	}
2113	}
2114
2115	// construct child geometry with regard to the candidate split plane
2116	bool splitSuccessFull = data.mGeometry->SplitGeometry(geomFront,
2117	geomBack,
2118	candidatePlane,
2119	mBoundingBox,
2120	//0.0f);
2121	mEpsilon);
2122
2123	pOverall = data.mProbability;
2124
2125	if (!mUseAreaForPvs)
2126	{
2127	pFront = geomFront.GetVolume();
2128	pBack = pOverall - pFront;
2129
2130	// HACK: precision issues possible for unbalanced split => don't take this split!
2131	if (1 &&
2132	(!splitSuccessFull \|\| (pFront <= 0) \|\| (pBack <= 0) \|\|
2133	!geomFront.Valid() \|\| !geomBack.Valid()))
2134	{
2135	//Debug << "error f: " << pFront << " b: " << pBack << endl;
2136
2137	// high penalty for degenerated / wrong split
2138	return 99999.9f;
2139	}
2140	}
2141	else
2142	{
2143	// use front and back cell areas to approximate volume
2144	pFront = geomFront.GetArea();
2145	pBack = geomBack.GetArea();
2146	}
2147
2148	////////
2149	//-- pvs rendering heuristics
2150
2151	const float lowerPvsLimit = (float)mViewCellsManager->GetMinPvsSize();
2152	const float upperPvsLimit = (float)mViewCellsManager->GetMaxPvsSize();
2153
2154	// only render cost heuristics or combined with standard deviation
2155	const float penaltyOld = EvalPvsPenalty(totalPvs, lowerPvsLimit, upperPvsLimit);
2156	const float penaltyFront = EvalPvsPenalty(pvsFront, lowerPvsLimit, upperPvsLimit);
2157	const float penaltyBack = EvalPvsPenalty(pvsBack, lowerPvsLimit, upperPvsLimit);
2158
2159	const float oldRenderCost = pOverall * penaltyOld;
2160	const float newRenderCost = penaltyFront * pFront + penaltyBack * pBack;
2161
2162	float oldCost, newCost;
2163
2164	// only render cost
2165	if (1)
2166	{
2167	oldCost = oldRenderCost;
2168	newCost = newRenderCost;
2169	}
2170	else // also considering standard deviation
2171	{
2172	// standard deviation is difference of back and front pvs
2173	const float expectedCost = 0.5f * (penaltyFront + penaltyBack);
2174
2175	const float newDeviation = 0.5f *
2176	fabs(penaltyFront - expectedCost) + fabs(penaltyBack - expectedCost);
2177
2178	const float oldDeviation = penaltyOld;
2179
2180	newCost = mRenderCostWeight * newRenderCost + (1.0f - mRenderCostWeight) * newDeviation;
2181	oldCost = mRenderCostWeight * oldRenderCost + (1.0f - mRenderCostWeight) * oldDeviation;
2182	}
2183
2184	const float cost = mPvsFactor * newCost / (oldCost + Limits::Small);
2185
2186
2187	#ifdef GTP_DEBUG
2188	Debug << "totalpvs: " << data.mPvs << " ptotal: " << pOverall
2189	<< " frontpvs: " << pvsFront << " pFront: " << pFront
2190	<< " backpvs: " << pvsBack << " pBack: " << pBack << endl << endl;
2191	Debug << "cost: " << cost << endl;
2192	#endif
2193
2194	return cost;
2195	}
2196
2197
2198	int VspBspTree::ComputeBoxIntersections(const AxisAlignedBox3 &box,
2199	ViewCellContainer &viewCells) const
2200	{
2201	stack<bspNodePair> nodeStack;
2202	BspNodeGeometry *rgeom = new BspNodeGeometry();
2203
2204	ConstructGeometry(mRoot, *rgeom);
2205
2206	nodeStack.push(bspNodePair(mRoot, rgeom));
2207
2208	ViewCell::NewMail();
2209
2210	while (!nodeStack.empty())
2211	{
2212	BspNode *node = nodeStack.top().first;
2213	BspNodeGeometry *geom = nodeStack.top().second;
2214	nodeStack.pop();
2215
2216	const int side = geom->ComputeIntersection(box);
2217
2218	switch (side)
2219	{
2220	case -1:
2221	// node geometry is contained in box
2222	CollectViewCells(node, true, viewCells, true);
2223	break;
2224
2225	case 0:
2226	if (node->IsLeaf())
2227	{
2228	BspLeaf leaf = static_cast<BspLeaf >(node);
2229
2230	if (!leaf->GetViewCell()->Mailed() && leaf->TreeValid())
2231	{
2232	leaf->GetViewCell()->Mail();
2233	viewCells.push_back(leaf->GetViewCell());
2234	}
2235	}
2236	else
2237	{
2238	BspInterior interior = static_cast<BspInterior >(node);
2239
2240	BspNode *first = interior->GetFront();
2241	BspNode *second = interior->GetBack();
2242
2243	BspNodeGeometry *firstGeom = new BspNodeGeometry();
2244	BspNodeGeometry *secondGeom = new BspNodeGeometry();
2245
2246	geom->SplitGeometry(*firstGeom,
2247	*secondGeom,
2248	interior->GetPlane(),
2249	mBoundingBox,
2250	//0.0000001f);
2251	mEpsilon);
2252
2253	nodeStack.push(bspNodePair(first, firstGeom));
2254	nodeStack.push(bspNodePair(second, secondGeom));
2255	}
2256
2257	break;
2258	default:
2259	// default: cull
2260	break;
2261	}
2262
2263	DEL_PTR(geom);
2264
2265	}
2266
2267	return (int)viewCells.size();
2268	}
2269
2270
2271	float VspBspTree::EvalAxisAlignedSplitCost(const VspBspTraversalData &data,
2272	const AxisAlignedBox3 &box,
2273	const int axis,
2274	const float &position,
2275	float &pFront,
2276	float &pBack) const
2277	{
2278	float pvsTotal = 0;
2279	float pvsFront = 0;
2280	float pvsBack = 0;
2281
2282	// create unique ids for pvs heuristics
2283	GenerateUniqueIdsForPvs();
2284
2285	const int pvsSize = data.mPvs;
2286
2287	RayInfoContainer::const_iterator rit, rit_end = data.mRays->end();
2288
2289	// this is the main ray classification loop!
2290	for(rit = data.mRays->begin(); rit != rit_end; ++ rit)
2291	{
2292	// determine the side of this ray with respect to the plane
2293	float t;
2294	const int side = (*rit).ComputeRayIntersection(axis, position, t);
2295
2296	AddObjToPvs((*rit).mRay->mTerminationObject, side, pvsFront, pvsBack, pvsTotal);
2297
2298	if (COUNT_ORIGIN_OBJECTS)
2299	{
2300	AddObjToPvs((*rit).mRay->mOriginObject, side, pvsFront, pvsBack, pvsTotal);
2301	}
2302	}
2303
2304
2305	//-- pvs heuristics
2306
2307	float pOverall = data.mProbability;
2308
2309	// note: we use a simplified computation assuming that we always do a
2310	// spatial mid split
2311
2312	if (!mUseAreaForPvs)
2313	{
2314	// volume
2315	pBack = pFront = pOverall * 0.5f;
2316	#if 0
2317	// box length substitute for probability
2318	const float minBox = box.Min(axis);
2319	const float maxBox = box.Max(axis);
2320
2321	pBack = position - minBox;
2322	pFront = maxBox - position;
2323	pOverall = maxBox - minBox;
2324	#endif
2325	}
2326	else //-- area substitute for probability
2327	{
2328	const int axis2 = (axis + 1) % 3;
2329	const int axis3 = (axis + 2) % 3;
2330
2331	const float faceArea =
2332	(box.Max(axis2) - box.Min(axis2)) *
2333	(box.Max(axis3) - box.Min(axis3));
2334
2335	pBack = pFront = pOverall * 0.5f + faceArea;
2336	}
2337
2338	#ifdef GTP_DEBUG
2339	Debug << "axis: " << axis << " " << pvsSize << " " << pvsBack << " " << pvsFront << endl;
2340	Debug << "p: " << pFront << " " << pBack << " " << pOverall << endl;
2341	#endif
2342
2343
2344	const float newCost = pvsBack * pBack + pvsFront * pFront;
2345	const float oldCost = (float)pvsSize * pOverall + Limits::Small;
2346
2347	return (mCtDivCi + newCost) / oldCost;
2348	}
2349
2350
2351	inline void VspBspTree::AddObjToPvs(Intersectable *obj,
2352	const int cf,
2353	float &frontPvs,
2354	float &backPvs,
2355	float &totalPvs) const
2356	{
2357	if (!obj)
2358	return;
2359	#if 0
2360	const float renderCost = mViewCellsManager->EvalRenderCost(obj);
2361	#else
2362	const int renderCost = 1;
2363	#endif
2364	// new object
2365	if ((obj->mMailbox != sFrontId) &&
2366	(obj->mMailbox != sBackId) &&
2367	(obj->mMailbox != sFrontAndBackId))
2368	{
2369	totalPvs += renderCost;
2370	}
2371
2372	// TODO: does this really belong to no pvs?
2373	//if (cf == Ray::COINCIDENT) return;
2374
2375	// object belongs to both PVS
2376	if (cf >= 0)
2377	{
2378	if ((obj->mMailbox != sFrontId) &&
2379	(obj->mMailbox != sFrontAndBackId))
2380	{
2381	frontPvs += renderCost;
2382
2383	if (obj->mMailbox == sBackId)
2384	obj->mMailbox = sFrontAndBackId;
2385	else
2386	obj->mMailbox = sFrontId;
2387	}
2388	}
2389
2390	if (cf <= 0)
2391	{
2392	if ((obj->mMailbox != sBackId) &&
2393	(obj->mMailbox != sFrontAndBackId))
2394	{
2395	backPvs += renderCost;
2396
2397	if (obj->mMailbox == sFrontId)
2398	obj->mMailbox = sFrontAndBackId;
2399	else
2400	obj->mMailbox = sBackId;
2401	}
2402	}
2403	}
2404
2405
2406	void VspBspTree::CollectLeaves(vector<BspLeaf *> &leaves,
2407	const bool onlyUnmailed,
2408	const int maxPvsSize) const
2409	{
2410	stack<BspNode *> nodeStack;
2411	nodeStack.push(mRoot);
2412
2413	while (!nodeStack.empty())
2414	{
2415	BspNode *node = nodeStack.top();
2416	nodeStack.pop();
2417
2418	if (node->IsLeaf())
2419	{
2420	// test if this leaf is in valid view space
2421	BspLeaf leaf = static_cast<BspLeaf >(node);
2422	if (leaf->TreeValid() &&
2423	(!onlyUnmailed \|\| !leaf->Mailed()) &&
2424	((maxPvsSize < 0) \|\| (leaf->GetViewCell()->GetPvs().EvalPvsCost() <= maxPvsSize)))
2425	{
2426	leaves.push_back(leaf);
2427	}
2428	}
2429	else
2430	{
2431	BspInterior interior = static_cast<BspInterior >(node);
2432
2433	nodeStack.push(interior->GetBack());
2434	nodeStack.push(interior->GetFront());
2435	}
2436	}
2437	}
2438
2439
2440	AxisAlignedBox3 VspBspTree::GetBoundingBox() const
2441	{
2442	return mBoundingBox;
2443	}
2444
2445
2446	BspNode *VspBspTree::GetRoot() const
2447	{
2448	return mRoot;
2449	}
2450
2451
2452	void VspBspTree::EvaluateLeafStats(const VspBspTraversalData &data)
2453	{
2454	// the node became a leaf -> evaluate stats for leafs
2455	BspLeaf leaf = static_cast<BspLeaf >(data.mNode);
2456
2457
2458	if (data.mPvs > mBspStats.maxPvs)
2459	{
2460	mBspStats.maxPvs = data.mPvs;
2461	}
2462
2463	mBspStats.pvs += data.mPvs;
2464
2465	if (data.mDepth < mBspStats.minDepth)
2466	{
2467	mBspStats.minDepth = data.mDepth;
2468	}
2469
2470	if (data.mDepth >= mTermMaxDepth)
2471	{
2472	++ mBspStats.maxDepthNodes;
2473	//Debug << "new max depth: " << mBspStats.maxDepthNodes << endl;
2474	}
2475
2476	// accumulate rays to compute rays / leaf
2477	mBspStats.accumRays += (int)data.mRays->size();
2478
2479	if (data.mPvs < mTermMinPvs)
2480	++ mBspStats.minPvsNodes;
2481
2482	if ((int)data.mRays->size() < mTermMinRays)
2483	++ mBspStats.minRaysNodes;
2484
2485	if (data.GetAvgRayContribution() > mTermMaxRayContribution)
2486	++ mBspStats.maxRayContribNodes;
2487
2488	if (data.mProbability <= mTermMinProbability)
2489	++ mBspStats.minProbabilityNodes;
2490
2491	// accumulate depth to compute average depth
2492	mBspStats.accumDepth += data.mDepth;
2493
2494	++ mCreatedViewCells;
2495
2496	#ifdef GTP_DEBUG
2497	Debug << "BSP stats: "
2498	<< "Depth: " << data.mDepth << " (max: " << mTermMaxDepth << "), "
2499	<< "PVS: " << data.mPvs << " (min: " << mTermMinPvs << "), "
2500	<< "#rays: " << (int)data.mRays->size() << " (max: " << mTermMinRays << "), "
2501	<< "#pvs: " << leaf->GetViewCell()->GetPvs().EvalPvsCost() << "), "
2502	<< "#avg ray contrib (pvs): " << (float)data.mPvs / (float)data.mRays->size() << endl;
2503	#endif
2504	}
2505
2506
2507	int VspBspTree::CastRay(Ray &ray)
2508	{
2509	int hits = 0;
2510
2511	stack<BspRayTraversalData> tQueue;
2512
2513	float maxt, mint;
2514
2515	if (!mBoundingBox.GetRaySegment(ray, mint, maxt))
2516	return 0;
2517
2518	Intersectable::NewMail();
2519	ViewCell::NewMail();
2520
2521	Vector3 entp = ray.Extrap(mint);
2522	Vector3 extp = ray.Extrap(maxt);
2523
2524	BspNode *node = mRoot;
2525	BspNode *farChild = NULL;
2526
2527	while (1)
2528	{
2529	if (!node->IsLeaf())
2530	{
2531	BspInterior in = static_cast<BspInterior >(node);
2532
2533	Plane3 splitPlane = in->GetPlane();
2534	const int entSide = splitPlane.Side(entp);
2535	const int extSide = splitPlane.Side(extp);
2536
2537	if (entSide < 0)
2538	{
2539	node = in->GetBack();
2540
2541	if(extSide <= 0) // plane does not split ray => no far child
2542	continue;
2543
2544	farChild = in->GetFront(); // plane splits ray
2545
2546	} else if (entSide > 0)
2547	{
2548	node = in->GetFront();
2549
2550	if (extSide >= 0) // plane does not split ray => no far child
2551	continue;
2552
2553	farChild = in->GetBack(); // plane splits ray
2554	}
2555	else // ray and plane are coincident
2556	{
2557	// matt: WHAT TO DO IN THIS CASE ?
2558	//break;
2559	node = in->GetFront();
2560	continue;
2561	}
2562
2563	// push data for far child
2564	tQueue.push(BspRayTraversalData(farChild, extp, maxt));
2565
2566	// find intersection of ray segment with plane
2567	float t;
2568	extp = splitPlane.FindIntersection(ray.GetLoc(), extp, &t);
2569	maxt *= t;
2570	}
2571	else // reached leaf => intersection with view cell
2572	{
2573	BspLeaf leaf = static_cast<BspLeaf >(node);
2574
2575	if (!leaf->GetViewCell()->Mailed())
2576	{
2577	//ray.bspIntersections.push_back(Ray::VspBspIntersection(maxt, leaf));
2578	leaf->GetViewCell()->Mail();
2579	++ hits;
2580	}
2581
2582	//-- fetch the next far child from the stack
2583	if (tQueue.empty())
2584	break;
2585
2586	entp = extp;
2587	mint = maxt; // NOTE: need this?
2588
2589	if (ray.GetType() == Ray::LINE_SEGMENT && mint > 1.0f)
2590	break;
2591
2592	BspRayTraversalData &s = tQueue.top();
2593
2594	node = s.mNode;
2595	extp = s.mExitPoint;
2596	maxt = s.mMaxT;
2597
2598	tQueue.pop();
2599	}
2600	}
2601
2602	return hits;
2603	}
2604
2605
2606	void VspBspTree::CollectViewCells(ViewCellContainer &viewCells,
2607	bool onlyValid) const
2608	{
2609	ViewCell::NewMail();
2610	CollectViewCells(mRoot, onlyValid, viewCells, true);
2611	}
2612
2613
2614	void VspBspTree::CollectViewCells(BspNode *root,
2615	bool onlyValid,
2616	ViewCellContainer &viewCells,
2617	bool onlyUnmailed) const
2618	{
2619	stack<BspNode *> nodeStack;
2620
2621	if (!root)
2622	return;
2623
2624	nodeStack.push(root);
2625
2626	while (!nodeStack.empty())
2627	{
2628	BspNode *node = nodeStack.top();
2629	nodeStack.pop();
2630
2631	if (node->IsLeaf())
2632	{
2633	if (!onlyValid \|\| node->TreeValid())
2634	{
2635	ViewCellLeaf leafVc = static_cast<BspLeaf >(node)->GetViewCell();
2636
2637	ViewCell *viewCell = mViewCellsTree->GetActiveViewCell(leafVc);
2638
2639	if (!onlyUnmailed \|\| !viewCell->Mailed())
2640	{
2641	viewCell->Mail();
2642	viewCells.push_back(viewCell);
2643	}
2644	}
2645	}
2646	else
2647	{
2648	BspInterior interior = static_cast<BspInterior >(node);
2649
2650	nodeStack.push(interior->GetFront());
2651	nodeStack.push(interior->GetBack());
2652	}
2653	}
2654	}
2655
2656
2657	void VspBspTree::CollapseViewCells()
2658	{
2659	// TODO
2660	#if HAS_TO_BE_REDONE
2661	stack<BspNode *> nodeStack;
2662
2663	if (!mRoot)
2664	return;
2665
2666	nodeStack.push(mRoot);
2667
2668	while (!nodeStack.empty())
2669	{
2670	BspNode *node = nodeStack.top();
2671	nodeStack.pop();
2672
2673	if (node->IsLeaf())
2674	{
2675	BspViewCell viewCell = static_cast<BspLeaf >(node)->GetViewCell();
2676
2677	if (!viewCell->GetValid())
2678	{
2679	BspViewCell viewCell = static_cast<BspLeaf >(node)->GetViewCell();
2680
2681	ViewCellContainer leaves;
2682	mViewCellsTree->CollectLeaves(viewCell, leaves);
2683
2684	ViewCellContainer::const_iterator it, it_end = leaves.end();
2685
2686	for (it = leaves.begin(); it != it_end; ++ it)
2687	{
2688	BspLeaf l = static_cast<BspViewCell >(*it)->mLeaf;
2689	l->SetViewCell(GetOrCreateOutOfBoundsCell());
2690	++ mBspStats.invalidLeaves;
2691	}
2692
2693	// add to unbounded view cell
2694	GetOrCreateOutOfBoundsCell()->GetPvs().AddPvs(viewCell->GetPvs());
2695	DEL_PTR(viewCell);
2696	}
2697	}
2698	else
2699	{
2700	BspInterior interior = static_cast<BspInterior >(node);
2701
2702	nodeStack.push(interior->GetFront());
2703	nodeStack.push(interior->GetBack());
2704	}
2705	}
2706
2707	Debug << "invalid leaves: " << mBspStats.invalidLeaves << endl;
2708	#endif
2709	}
2710
2711
2712	void VspBspTree::CollectRays(VssRayContainer &rays)
2713	{
2714	vector<BspLeaf *> leaves;
2715
2716	vector<BspLeaf *>::const_iterator lit, lit_end = leaves.end();
2717
2718	for (lit = leaves.begin(); lit != lit_end; ++ lit)
2719	{
2720	BspLeaf leaf = lit;
2721	VssRayContainer::const_iterator rit, rit_end = leaf->mVssRays.end();
2722
2723	for (rit = leaf->mVssRays.begin(); rit != rit_end; ++ rit)
2724	rays.push_back(*rit);
2725	}
2726	}
2727
2728
2729	void VspBspTree::ValidateTree()
2730	{
2731	stack<BspNode *> nodeStack;
2732
2733	if (!mRoot)
2734	return;
2735
2736	nodeStack.push(mRoot);
2737
2738	mBspStats.invalidLeaves = 0;
2739	while (!nodeStack.empty())
2740	{
2741	BspNode *node = nodeStack.top();
2742	nodeStack.pop();
2743
2744	if (node->IsLeaf())
2745	{
2746	BspLeaf leaf = static_cast<BspLeaf >(node);
2747
2748	if (!leaf->GetViewCell()->GetValid())
2749	++ mBspStats.invalidLeaves;
2750
2751	// validity flags don't match => repair
2752	if (leaf->GetViewCell()->GetValid() != leaf->TreeValid())
2753	{
2754	leaf->SetTreeValid(leaf->GetViewCell()->GetValid());
2755	PropagateUpValidity(leaf);
2756	}
2757	}
2758	else
2759	{
2760	BspInterior interior = static_cast<BspInterior >(node);
2761
2762	nodeStack.push(interior->GetFront());
2763	nodeStack.push(interior->GetBack());
2764	}
2765	}
2766
2767	Debug << "invalid leaves: " << mBspStats.invalidLeaves << endl;
2768	}
2769
2770
2771	void VspBspTree::PreprocessPolygons(PolygonContainer &polys)
2772	{
2773	// preprocess: throw out polygons coincident to the view space box (not needed)
2774	PolygonContainer boxPolys;
2775
2776	mBoundingBox.ExtractPolys(boxPolys);
2777	vector<Plane3> boxPlanes;
2778
2779	PolygonContainer::iterator pit, pit_end = boxPolys.end();
2780
2781	// extract planes of box
2782	// TODO: can be done more elegantly than first extracting polygons
2783	// and take their planes
2784	for (pit = boxPolys.begin(); pit != pit_end; ++ pit)
2785	{
2786	boxPlanes.push_back((*pit)->GetSupportingPlane());
2787	}
2788
2789	pit_end = polys.end();
2790
2791	for (pit = polys.begin(); pit != pit_end; ++ pit)
2792	{
2793	vector<Plane3>::const_iterator bit, bit_end = boxPlanes.end();
2794
2795	for (bit = boxPlanes.begin(); (bit != bit_end) && (*pit); ++ bit)
2796	{
2797	const int cf = (pit)->ClassifyPlane(bit, mEpsilon);
2798
2799	if (cf == Polygon3::COINCIDENT)
2800	{
2801	DEL_PTR(*pit);
2802	//Debug << "coincident!!" << endl;
2803	}
2804	}
2805	}
2806
2807	// remove deleted entries after swapping them to end of vector
2808	for (int i = 0; i < (int)polys.size(); ++ i)
2809	{
2810	while (!polys[i] && (i < (int)polys.size()))
2811	{
2812	swap(polys[i], polys.back());
2813	polys.pop_back();
2814	}
2815	}
2816	}
2817
2818
2819	float VspBspTree::AccumulatedRayLength(const RayInfoContainer &rays) const
2820	{
2821	float len = 0;
2822
2823	RayInfoContainer::const_iterator it, it_end = rays.end();
2824
2825	for (it = rays.begin(); it != it_end; ++ it)
2826	len += (*it).SegmentLength();
2827
2828	return len;
2829	}
2830
2831
2832	int VspBspTree::SplitRays(const Plane3 &plane,
2833	RayInfoContainer &rays,
2834	RayInfoContainer &frontRays,
2835	RayInfoContainer &backRays) const
2836	{
2837	int splits = 0;
2838
2839	RayInfoContainer::const_iterator it, it_end = rays.end();
2840
2841	for (it = rays.begin(); it != it_end; ++ it)
2842	{
2843	RayInfo bRay = *it;
2844
2845	VssRay *ray = bRay.mRay;
2846	float t;
2847
2848	// get classification and receive new t
2849	const int cf = bRay.ComputeRayIntersection(plane, t);
2850
2851	switch (cf)
2852	{
2853	case -1:
2854	backRays.push_back(bRay);
2855	break;
2856	case 1:
2857	frontRays.push_back(bRay);
2858	break;
2859	case 0:
2860	{
2861	//-- split ray
2862	// test if start point behind or in front of plane
2863	const int side = plane.Side(bRay.ExtrapOrigin());
2864
2865	++ splits;
2866
2867	if (side <= 0)
2868	{
2869	backRays.push_back(RayInfo(ray, bRay.GetMinT(), t));
2870	frontRays.push_back(RayInfo(ray, t, bRay.GetMaxT()));
2871	}
2872	else
2873	{
2874	frontRays.push_back(RayInfo(ray, bRay.GetMinT(), t));
2875	backRays.push_back(RayInfo(ray, t, bRay.GetMaxT()));
2876	}
2877	}
2878	break;
2879	default:
2880	Debug << "Should not come here" << endl;
2881	break;
2882	}
2883	}
2884
2885	return splits;
2886	}
2887
2888
2889	void VspBspTree::ExtractHalfSpaces(BspNode *n, vector<Plane3> &halfSpaces) const
2890	{
2891	BspNode *lastNode;
2892
2893	do
2894	{
2895	lastNode = n;
2896
2897	// want to get planes defining geometry of this node => don't take
2898	// split plane of node itself
2899	n = n->GetParent();
2900
2901	if (n)
2902	{
2903	BspInterior interior = static_cast<BspInterior >(n);
2904	Plane3 halfSpace = static_cast<BspInterior *>(interior)->GetPlane();
2905
2906	if (interior->GetBack() != lastNode)
2907	halfSpace.ReverseOrientation();
2908
2909	halfSpaces.push_back(halfSpace);
2910	}
2911	}
2912	while (n);
2913	}
2914
2915
2916	void VspBspTree::ConstructGeometry(BspNode *n,
2917	BspNodeGeometry &geom) const
2918	{
2919	vector<Plane3> halfSpaces;
2920	ExtractHalfSpaces(n, halfSpaces);
2921
2922	PolygonContainer candidatePolys;
2923	vector<Plane3> candidatePlanes;
2924
2925	vector<Plane3>::const_iterator pit, pit_end = halfSpaces.end();
2926
2927	// bounded planes are added to the polygons
2928	for (pit = halfSpaces.begin(); pit != pit_end; ++ pit)
2929	{
2930	Polygon3 p = GetBoundingBox().CrossSection(pit);
2931
2932	if (p->Valid(mEpsilon))
2933	{
2934	candidatePolys.push_back(p);
2935	candidatePlanes.push_back(*pit);
2936	}
2937	}
2938
2939	// add faces of bounding box (also could be faces of the cell)
2940	for (int i = 0; i < 6; ++ i)
2941	{
2942	VertexContainer vertices;
2943
2944	for (int j = 0; j < 4; ++ j)
2945	{
2946	vertices.push_back(mBoundingBox.GetFace(i).mVertices[j]);
2947	}
2948
2949	Polygon3 *poly = new Polygon3(vertices);
2950
2951	candidatePolys.push_back(poly);
2952	candidatePlanes.push_back(poly->GetSupportingPlane());
2953	}
2954
2955	for (int i = 0; i < (int)candidatePolys.size(); ++ i)
2956	{
2957	// polygon is split by all other planes
2958	for (int j = 0; (j < (int)halfSpaces.size()) && candidatePolys[i]; ++ j)
2959	{
2960	if (i == j) // polygon and plane are coincident
2961	continue;
2962
2963	VertexContainer splitPts;
2964	Polygon3 frontPoly, backPoly;
2965
2966	const int cf =
2967	candidatePolys[i]->ClassifyPlane(halfSpaces[j],
2968	mEpsilon);
2969
2970	switch (cf)
2971	{
2972	case Polygon3::SPLIT:
2973	frontPoly = new Polygon3();
2974	backPoly = new Polygon3();
2975
2976	candidatePolys[i]->Split(halfSpaces[j],
2977	*frontPoly,
2978	*backPoly,
2979	mEpsilon);
2980
2981	DEL_PTR(candidatePolys[i]);
2982
2983	if (backPoly->Valid(mEpsilon))
2984	{
2985	candidatePolys[i] = backPoly;
2986	}
2987	else
2988	{
2989	DEL_PTR(backPoly);
2990	}
2991
2992	// outside, don't need this
2993	DEL_PTR(frontPoly);
2994	break;
2995
2996	// polygon outside of halfspace
2997	case Polygon3::FRONT_SIDE:
2998	DEL_PTR(candidatePolys[i]);
2999	break;
3000
3001	// just take polygon as it is
3002	case Polygon3::BACK_SIDE:
3003	case Polygon3::COINCIDENT:
3004	default:
3005	break;
3006	}
3007	}
3008
3009	if (candidatePolys[i])
3010	{
3011	geom.Add(candidatePolys[i], candidatePlanes[i]);
3012	}
3013	}
3014	}
3015
3016
3017	bool VspBspTree::IsOutOfBounds(ViewCell *vc) const
3018	{
3019	return vc->GetId() == OUT_OF_BOUNDS_ID;
3020	}
3021
3022
3023	void VspBspTree::SetViewCellsTree(ViewCellsTree *viewCellsTree)
3024	{
3025	mViewCellsTree = viewCellsTree;
3026	}
3027
3028
3029	void VspBspTree::ConstructGeometry(ViewCell *vc,
3030	BspNodeGeometry &vcGeom) const
3031	{
3032	// if false, cannot construct geometry for interior leaf
3033	if (!mViewCellsTree)
3034	return;
3035
3036	ViewCellContainer leaves;
3037	mViewCellsTree->CollectLeaves(vc, leaves);
3038
3039	ViewCellContainer::const_iterator it, it_end = leaves.end();
3040
3041	for (it = leaves.begin(); it != it_end; ++ it)
3042	{
3043	if (IsOutOfBounds(*it))
3044	continue;
3045
3046	BspViewCell bspVc = static_cast<BspViewCell >(*it);
3047	vector<BspLeaf *>::const_iterator bit, bit_end = bspVc->mLeaves.end();
3048
3049	for (bit = bspVc->mLeaves.begin(); bit != bit_end; ++ bit)
3050	{
3051	BspLeaf l = bit;
3052	ConstructGeometry(l, vcGeom);
3053	}
3054	}
3055	}
3056
3057
3058	int VspBspTree::FindNeighbors(BspNode n, vector<BspLeaf > &neighbors,
3059	const bool onlyUnmailed) const
3060	{
3061	stack<bspNodePair> nodeStack;
3062
3063	BspNodeGeometry nodeGeom;
3064	ConstructGeometry(n, nodeGeom);
3065	// const float eps = 0.5f;
3066	const float eps = 0.01f;
3067	// split planes from the root to this node
3068	// needed to verify that we found neighbor leaf
3069	// TODO: really needed?
3070	vector<Plane3> halfSpaces;
3071	ExtractHalfSpaces(n, halfSpaces);
3072
3073
3074	BspNodeGeometry *rgeom = new BspNodeGeometry();
3075	ConstructGeometry(mRoot, *rgeom);
3076
3077	nodeStack.push(bspNodePair(mRoot, rgeom));
3078
3079	while (!nodeStack.empty())
3080	{
3081	BspNode *node = nodeStack.top().first;
3082	BspNodeGeometry *geom = nodeStack.top().second;
3083
3084	nodeStack.pop();
3085
3086	if (node->IsLeaf())
3087	{
3088	// test if this leaf is in valid view space
3089	if (node->TreeValid() &&
3090	(node != n) &&
3091	(!onlyUnmailed \|\| !node->Mailed()))
3092	{
3093	bool isAdjacent = true;
3094
3095	if (1)
3096	{
3097	// test all planes of current node if still adjacent
3098	for (int i = 0; (i < halfSpaces.size()) && isAdjacent; ++ i)
3099	{
3100	const int cf =
3101	Polygon3::ClassifyPlane(geom->GetPolys(),
3102	halfSpaces[i],
3103	eps);
3104
3105	if (cf == Polygon3::FRONT_SIDE)
3106	{
3107	isAdjacent = false;
3108	}
3109	}
3110	}
3111	else
3112	{
3113	// TODO: why is this wrong??
3114	// test all planes of current node if still adjacent
3115	for (int i = 0; (i < nodeGeom.Size()) && isAdjacent; ++ i)
3116	{
3117	Polygon3 *poly = nodeGeom.GetPolys()[i];
3118
3119	const int cf =
3120	Polygon3::ClassifyPlane(geom->GetPolys(),
3121	poly->GetSupportingPlane(),
3122	eps);
3123
3124	if (cf == Polygon3::FRONT_SIDE)
3125	{
3126	isAdjacent = false;
3127	}
3128	}
3129	}
3130	// neighbor was found
3131	if (isAdjacent)
3132	{
3133	neighbors.push_back(static_cast<BspLeaf *>(node));
3134	}
3135	}
3136	}
3137	else
3138	{
3139	BspInterior interior = static_cast<BspInterior >(node);
3140
3141	const int cf = Polygon3::ClassifyPlane(nodeGeom.GetPolys(),
3142	interior->GetPlane(),
3143	eps);
3144
3145	BspNode *front = interior->GetFront();
3146	BspNode *back = interior->GetBack();
3147
3148	BspNodeGeometry *fGeom = new BspNodeGeometry();
3149	BspNodeGeometry *bGeom = new BspNodeGeometry();
3150
3151	geom->SplitGeometry(*fGeom,
3152	*bGeom,
3153	interior->GetPlane(),
3154	mBoundingBox,
3155	//0.0000001f);
3156	eps);
3157
3158	if (cf == Polygon3::BACK_SIDE)
3159	{
3160	nodeStack.push(bspNodePair(interior->GetBack(), bGeom));
3161	DEL_PTR(fGeom);
3162	}
3163	else
3164	{
3165	if (cf == Polygon3::FRONT_SIDE)
3166	{
3167	nodeStack.push(bspNodePair(interior->GetFront(), fGeom));
3168	DEL_PTR(bGeom);
3169	}
3170	else
3171	{ // random decision
3172	nodeStack.push(bspNodePair(front, fGeom));
3173	nodeStack.push(bspNodePair(back, bGeom));
3174	}
3175	}
3176	}
3177
3178	DEL_PTR(geom);
3179	}
3180
3181	return (int)neighbors.size();
3182	}
3183
3184
3185
3186	int VspBspTree::FindApproximateNeighbors(BspNode *n,
3187	vector<BspLeaf *> &neighbors,
3188	const bool onlyUnmailed) const
3189	{
3190	stack<bspNodePair> nodeStack;
3191
3192	BspNodeGeometry nodeGeom;
3193	ConstructGeometry(n, nodeGeom);
3194
3195	float eps = 0.01f;
3196	// split planes from the root to this node
3197	// needed to verify that we found neighbor leaf
3198	// TODO: really needed?
3199	vector<Plane3> halfSpaces;
3200	ExtractHalfSpaces(n, halfSpaces);
3201
3202
3203	BspNodeGeometry *rgeom = new BspNodeGeometry();
3204	ConstructGeometry(mRoot, *rgeom);
3205
3206	nodeStack.push(bspNodePair(mRoot, rgeom));
3207
3208	while (!nodeStack.empty())
3209	{
3210	BspNode *node = nodeStack.top().first;
3211	BspNodeGeometry *geom = nodeStack.top().second;
3212
3213	nodeStack.pop();
3214
3215	if (node->IsLeaf())
3216	{
3217	// test if this leaf is in valid view space
3218	if (node->TreeValid() &&
3219	(node != n) &&
3220	(!onlyUnmailed \|\| !node->Mailed()))
3221	{
3222	bool isAdjacent = true;
3223
3224	// neighbor was found
3225	if (isAdjacent)
3226	{
3227	neighbors.push_back(static_cast<BspLeaf *>(node));
3228	}
3229	}
3230	}
3231	else
3232	{
3233	BspInterior interior = static_cast<BspInterior >(node);
3234
3235	const int cf = Polygon3::ClassifyPlane(nodeGeom.GetPolys(),
3236	interior->GetPlane(),
3237	eps);
3238
3239	BspNode *front = interior->GetFront();
3240	BspNode *back = interior->GetBack();
3241
3242	BspNodeGeometry *fGeom = new BspNodeGeometry();
3243	BspNodeGeometry *bGeom = new BspNodeGeometry();
3244
3245	geom->SplitGeometry(*fGeom,
3246	*bGeom,
3247	interior->GetPlane(),
3248	mBoundingBox,
3249	//0.0000001f);
3250	eps);
3251
3252	if (cf == Polygon3::BACK_SIDE)
3253	{
3254	nodeStack.push(bspNodePair(interior->GetBack(), bGeom));
3255	DEL_PTR(fGeom);
3256	}
3257	else
3258	{
3259	if (cf == Polygon3::FRONT_SIDE)
3260	{
3261	nodeStack.push(bspNodePair(interior->GetFront(), fGeom));
3262	DEL_PTR(bGeom);
3263	}
3264	else
3265	{ // random decision
3266	nodeStack.push(bspNodePair(front, fGeom));
3267	nodeStack.push(bspNodePair(back, bGeom));
3268	}
3269	}
3270	}
3271
3272	DEL_PTR(geom);
3273	}
3274
3275	return (int)neighbors.size();
3276	}
3277
3278
3279
3280	BspLeaf *VspBspTree::GetRandomLeaf(const Plane3 &halfspace)
3281	{
3282	stack<BspNode *> nodeStack;
3283	nodeStack.push(mRoot);
3284
3285	int mask = rand();
3286
3287	while (!nodeStack.empty())
3288	{
3289	BspNode *node = nodeStack.top();
3290	nodeStack.pop();
3291
3292	if (node->IsLeaf())
3293	{
3294	return static_cast<BspLeaf *>(node);
3295	}
3296	else
3297	{
3298	BspInterior interior = static_cast<BspInterior >(node);
3299	BspNode *next;
3300	BspNodeGeometry geom;
3301
3302	// todo: not very efficient: constructs full cell everytime
3303	ConstructGeometry(interior, geom);
3304
3305	const int cf =
3306	Polygon3::ClassifyPlane(geom.GetPolys(), halfspace, mEpsilon);
3307
3308	if (cf == Polygon3::BACK_SIDE)
3309	next = interior->GetFront();
3310	else
3311	if (cf == Polygon3::FRONT_SIDE)
3312	next = interior->GetFront();
3313	else
3314	{
3315	// random decision
3316	if (mask & 1)
3317	next = interior->GetBack();
3318	else
3319	next = interior->GetFront();
3320	mask = mask >> 1;
3321	}
3322
3323	nodeStack.push(next);
3324	}
3325	}
3326
3327	return NULL;
3328	}
3329
3330
3331	BspLeaf *VspBspTree::GetRandomLeaf(const bool onlyUnmailed)
3332	{
3333	stack<BspNode *> nodeStack;
3334
3335	nodeStack.push(mRoot);
3336
3337	int mask = rand();
3338
3339	while (!nodeStack.empty())
3340	{
3341	BspNode *node = nodeStack.top();
3342	nodeStack.pop();
3343
3344	if (node->IsLeaf())
3345	{
3346	if ( (!onlyUnmailed \|\| !node->Mailed()) )
3347	return static_cast<BspLeaf *>(node);
3348	}
3349	else
3350	{
3351	BspInterior interior = static_cast<BspInterior >(node);
3352
3353	// random decision
3354	if (mask & 1)
3355	nodeStack.push(interior->GetBack());
3356	else
3357	nodeStack.push(interior->GetFront());
3358
3359	mask = mask >> 1;
3360	}
3361	}
3362
3363	return NULL;
3364	}
3365
3366
3367	int VspBspTree::ComputePvsSize(const RayInfoContainer &rays) const
3368	{
3369	int pvsSize = 0;
3370
3371	RayInfoContainer::const_iterator rit, rit_end = rays.end();
3372
3373	Intersectable::NewMail();
3374
3375	for (rit = rays.begin(); rit != rays.end(); ++ rit)
3376	{
3377	VssRay ray = (rit).mRay;
3378
3379	if (COUNT_ORIGIN_OBJECTS && ray->mOriginObject)
3380	{
3381	if (!ray->mOriginObject->Mailed())
3382	{
3383	ray->mOriginObject->Mail();
3384	++ pvsSize;
3385	}
3386	}
3387
3388	if (ray->mTerminationObject)
3389	{
3390	if (!ray->mTerminationObject->Mailed())
3391	{
3392	ray->mTerminationObject->Mail();
3393	++ pvsSize;
3394	}
3395	}
3396	}
3397
3398	return pvsSize;
3399	}
3400
3401
3402	float VspBspTree::GetEpsilon() const
3403	{
3404	return mEpsilon;
3405	}
3406
3407
3408	int VspBspTree::SplitPolygons(const Plane3 &plane,
3409	PolygonContainer &polys,
3410	PolygonContainer &frontPolys,
3411	PolygonContainer &backPolys,
3412	PolygonContainer &coincident) const
3413	{
3414	int splits = 0;
3415
3416	PolygonContainer::const_iterator it, it_end = polys.end();
3417
3418	for (it = polys.begin(); it != polys.end(); ++ it)
3419	{
3420	Polygon3 poly = it;
3421
3422	// classify polygon
3423	const int cf = poly->ClassifyPlane(plane, mEpsilon);
3424
3425	switch (cf)
3426	{
3427	case Polygon3::COINCIDENT:
3428	coincident.push_back(poly);
3429	break;
3430	case Polygon3::FRONT_SIDE:
3431	frontPolys.push_back(poly);
3432	break;
3433	case Polygon3::BACK_SIDE:
3434	backPolys.push_back(poly);
3435	break;
3436	case Polygon3::SPLIT:
3437	backPolys.push_back(poly);
3438	frontPolys.push_back(poly);
3439	++ splits;
3440	break;
3441	default:
3442	Debug << "SHOULD NEVER COME HERE\n";
3443	break;
3444	}
3445	}
3446
3447	return splits;
3448	}
3449
3450
3451	int VspBspTree::CastLineSegment(const Vector3 &origin,
3452	const Vector3 &termination,
3453	ViewCellContainer &viewcells)
3454	{
3455	int hits = 0;
3456	stack<BspRayTraversalData> tStack;
3457
3458	float mint = 0.0f, maxt = 1.0f;
3459
3460	//ViewCell::NewMail();
3461
3462	Vector3 entp = origin;
3463	Vector3 extp = termination;
3464
3465	BspNode *node = mRoot;
3466	BspNode *farChild = NULL;
3467
3468	float t;
3469	const float thresh = 1e-6f; // matt: change this to adjustable value
3470
3471	while (1)
3472	{
3473	if (!node->IsLeaf())
3474	{
3475	BspInterior in = static_cast<BspInterior >(node);
3476
3477	Plane3 &splitPlane = in->GetPlane();
3478
3479	const int entSide = splitPlane.Side(entp, thresh);
3480	const int extSide = splitPlane.Side(extp, thresh);
3481
3482	if (entSide < 0)
3483	{
3484	node = in->GetBack();
3485
3486	// plane does not split ray => no far child
3487	if (extSide <= 0)
3488	continue;
3489
3490	farChild = in->GetFront(); // plane splits ray
3491	}
3492	else if (entSide > 0)
3493	{
3494	node = in->GetFront();
3495
3496	if (extSide >= 0) // plane does not split ray => no far child
3497	continue;
3498
3499	farChild = in->GetBack(); // plane splits ray
3500	}
3501	else // one of the ray end points is on the plane
3502	{
3503	// NOTE: what to do if ray is coincident with plane?
3504	if (extSide < 0)
3505	node = in->GetBack();
3506	else //if (extSide > 0)
3507	node = in->GetFront();
3508	//else break; // coincident => count no intersections
3509
3510	continue; // no far child
3511	}
3512
3513	// push data for far child
3514	tStack.push(BspRayTraversalData(farChild, extp));
3515
3516	// find intersection of ray segment with plane
3517	extp = splitPlane.FindIntersection(origin, extp, &t);
3518	}
3519	else
3520	{
3521	// reached leaf => intersection with view cell
3522	BspLeaf leaf = static_cast<BspLeaf >(node);
3523	ViewCell *viewCell;
3524
3525	// question: always contribute to leaf or to currently active view cell?
3526	// if (0)
3527	// viewCell = mViewCellsTree->GetActiveViewCell(leaf->GetViewCell());
3528	// else
3529	viewCell = leaf->GetViewCell();
3530
3531	if (!viewCell->Mailed())
3532	{
3533	viewcells.push_back(viewCell);
3534	viewCell->Mail();
3535	++ hits;
3536	}
3537
3538	//-- fetch the next far child from the stack
3539	if (tStack.empty())
3540	break;
3541
3542	entp = extp;
3543
3544	const BspRayTraversalData &s = tStack.top();
3545
3546	node = s.mNode;
3547	extp = s.mExitPoint;
3548
3549	tStack.pop();
3550	}
3551	}
3552
3553	return hits;
3554	}
3555
3556
3557
3558
3559	int VspBspTree::TreeDistance(BspNode n1, BspNode n2) const
3560	{
3561	std::deque<BspNode *> path1;
3562	BspNode *p1 = n1;
3563
3564	// create path from node 1 to root
3565	while (p1)
3566	{
3567	if (p1 == n2) // second node on path
3568	return (int)path1.size();
3569
3570	path1.push_front(p1);
3571	p1 = p1->GetParent();
3572	}
3573
3574	int depth = n2->GetDepth();
3575	int d = depth;
3576
3577	BspNode *p2 = n2;
3578
3579	// compare with same depth
3580	while (1)
3581	{
3582	if ((d < (int)path1.size()) && (p2 == path1[d]))
3583	return (depth - d) + ((int)path1.size() - 1 - d);
3584
3585	-- d;
3586	p2 = p2->GetParent();
3587	}
3588
3589	return 0; // never come here
3590	}
3591
3592
3593	BspNode VspBspTree::CollapseTree(BspNode node, int &collapsed)
3594	{
3595	// TODO
3596	#if HAS_TO_BE_REDONE
3597	if (node->IsLeaf())
3598	return node;
3599
3600	BspInterior interior = static_cast<BspInterior >(node);
3601
3602	BspNode *front = CollapseTree(interior->GetFront(), collapsed);
3603	BspNode *back = CollapseTree(interior->GetBack(), collapsed);
3604
3605	if (front->IsLeaf() && back->IsLeaf())
3606	{
3607	BspLeaf frontLeaf = static_cast<BspLeaf >(front);
3608	BspLeaf backLeaf = static_cast<BspLeaf >(back);
3609
3610	//-- collapse tree
3611	if (frontLeaf->GetViewCell() == backLeaf->GetViewCell())
3612	{
3613	BspViewCell *vc = frontLeaf->GetViewCell();
3614
3615	BspLeaf *leaf = new BspLeaf(interior->GetParent(), vc);
3616	leaf->SetTreeValid(frontLeaf->TreeValid());
3617
3618	// replace a link from node's parent
3619	if (leaf->GetParent())
3620	leaf->GetParent()->ReplaceChildLink(node, leaf);
3621	else
3622	mRoot = leaf;
3623
3624	++ collapsed;
3625	delete interior;
3626
3627	return leaf;
3628	}
3629	}
3630	#endif
3631	return node;
3632	}
3633
3634
3635	int VspBspTree::CollapseTree()
3636	{
3637	int collapsed = 0;
3638	//TODO
3639	#if HAS_TO_BE_REDONE
3640	(void)CollapseTree(mRoot, collapsed);
3641
3642	// revalidate leaves
3643	RepairViewCellsLeafLists();
3644	#endif
3645	return collapsed;
3646	}
3647
3648
3649	void VspBspTree::RepairViewCellsLeafLists()
3650	{
3651	// TODO
3652	#if HAS_TO_BE_REDONE
3653	// list not valid anymore => clear
3654	stack<BspNode *> nodeStack;
3655	nodeStack.push(mRoot);
3656
3657	ViewCell::NewMail();
3658
3659	while (!nodeStack.empty())
3660	{
3661	BspNode *node = nodeStack.top();
3662	nodeStack.pop();
3663
3664	if (node->IsLeaf())
3665	{
3666	BspLeaf leaf = static_cast<BspLeaf >(node);
3667
3668	BspViewCell *viewCell = leaf->GetViewCell();
3669
3670	if (!viewCell->Mailed())
3671	{
3672	viewCell->mLeaves.clear();
3673	viewCell->Mail();
3674	}
3675
3676	viewCell->mLeaves.push_back(leaf);
3677
3678	}
3679	else
3680	{
3681	BspInterior interior = static_cast<BspInterior >(node);
3682
3683	nodeStack.push(interior->GetFront());
3684	nodeStack.push(interior->GetBack());
3685	}
3686	}
3687	// TODO
3688	#endif
3689	}
3690
3691
3692	int VspBspTree::CastBeam(Beam &beam)
3693	{
3694	stack<bspNodePair> nodeStack;
3695	BspNodeGeometry *rgeom = new BspNodeGeometry();
3696	ConstructGeometry(mRoot, *rgeom);
3697
3698	nodeStack.push(bspNodePair(mRoot, rgeom));
3699
3700	ViewCell::NewMail();
3701
3702	while (!nodeStack.empty())
3703	{
3704	BspNode *node = nodeStack.top().first;
3705	BspNodeGeometry *geom = nodeStack.top().second;
3706	nodeStack.pop();
3707
3708	AxisAlignedBox3 box;
3709	geom->GetBoundingBox(box);
3710
3711	const int side = beam.ComputeIntersection(box);
3712
3713	switch (side)
3714	{
3715	case -1:
3716	CollectViewCells(node, true, beam.mViewCells, true);
3717	break;
3718	case 0:
3719
3720	if (node->IsLeaf())
3721	{
3722	BspLeaf leaf = static_cast<BspLeaf >(node);
3723
3724	if (!leaf->GetViewCell()->Mailed() && leaf->TreeValid())
3725	{
3726	leaf->GetViewCell()->Mail();
3727	beam.mViewCells.push_back(leaf->GetViewCell());
3728	}
3729	}
3730	else
3731	{
3732	BspInterior interior = static_cast<BspInterior >(node);
3733
3734	BspNode *first = interior->GetFront();
3735	BspNode *second = interior->GetBack();
3736
3737	BspNodeGeometry *firstGeom = new BspNodeGeometry();
3738	BspNodeGeometry *secondGeom = new BspNodeGeometry();
3739
3740	geom->SplitGeometry(*firstGeom,
3741	*secondGeom,
3742	interior->GetPlane(),
3743	mBoundingBox,
3744	//0.0000001f);
3745	mEpsilon);
3746
3747	// decide on the order of the nodes
3748	if (DotProd(beam.mPlanes[0].mNormal,
3749	interior->GetPlane().mNormal) > 0)
3750	{
3751	swap(first, second);
3752	swap(firstGeom, secondGeom);
3753	}
3754
3755	nodeStack.push(bspNodePair(first, firstGeom));
3756	nodeStack.push(bspNodePair(second, secondGeom));
3757	}
3758
3759	break;
3760	default:
3761	// default: cull
3762	break;
3763	}
3764
3765	DEL_PTR(geom);
3766
3767	}
3768
3769	return (int)beam.mViewCells.size();
3770	}
3771
3772
3773	void VspBspTree::SetViewCellsManager(ViewCellsManager *vcm)
3774	{
3775	mViewCellsManager = vcm;
3776	}
3777
3778
3779	int VspBspTree::CollectMergeCandidates(const vector<BspLeaf *> leaves,
3780	vector<MergeCandidate> &candidates)
3781	{
3782	BspLeaf::NewMail();
3783
3784	vector<BspLeaf *>::const_iterator it, it_end = leaves.end();
3785
3786	int numCandidates = 0;
3787
3788	// find merge candidates and push them into queue
3789	for (it = leaves.begin(); it != it_end; ++ it)
3790	{
3791	BspLeaf leaf = it;
3792
3793	// the same leaves must not be part of two merge candidates
3794	leaf->Mail();
3795
3796	vector<BspLeaf *> neighbors;
3797
3798	// appoximate neighbor search has slightl relaxed constraints
3799	if (1)
3800	FindNeighbors(leaf, neighbors, true);
3801	else
3802	FindApproximateNeighbors(leaf, neighbors, true);
3803
3804	vector<BspLeaf *>::const_iterator nit, nit_end = neighbors.end();
3805
3806	// TODO: test if at least one ray goes from one leaf to the other
3807	for (nit = neighbors.begin(); nit != nit_end; ++ nit)
3808	{
3809	if ((*nit)->GetViewCell() != leaf->GetViewCell())
3810	{
3811	MergeCandidate mc(leaf->GetViewCell(), (*nit)->GetViewCell());
3812
3813	if (!leaf->GetViewCell()->GetPvs().Empty() \|\|
3814	!(*nit)->GetViewCell()->GetPvs().Empty() \|\|
3815	leaf->IsSibling(*nit))
3816	{
3817	candidates.push_back(mc);
3818	}
3819
3820	++ numCandidates;
3821	if ((numCandidates % 1000) == 0)
3822	{
3823	cout << "collected " << numCandidates << " merge candidates" << endl;
3824	}
3825	}
3826	}
3827	}
3828
3829	Debug << "merge queue: " << (int)candidates.size() << endl;
3830	Debug << "leaves in queue: " << numCandidates << endl;
3831
3832
3833	return (int)leaves.size();
3834	}
3835
3836
3837	int VspBspTree::CollectMergeCandidates(const VssRayContainer &rays,
3838	vector<MergeCandidate> &candidates)
3839	{
3840	ViewCell::NewMail();
3841	long startTime = GetTime();
3842
3843	map<BspLeaf , vector<BspLeaf> > neighborMap;
3844	ViewCellContainer::const_iterator iit;
3845
3846	int numLeaves = 0;
3847
3848	BspLeaf::NewMail();
3849
3850	for (int i = 0; i < (int)rays.size(); ++ i)
3851	{
3852	VssRay *ray = rays[i];
3853
3854	// traverse leaves stored in the rays and compare and
3855	// merge consecutive leaves (i.e., the neighbors in the tree)
3856	if (ray->mViewCells.size() < 2)
3857	continue;
3858
3859	iit = ray->mViewCells.begin();
3860	BspViewCell bspVc = static_cast<BspViewCell >(*(iit ++));
3861	BspLeaf *leaf = bspVc->mLeaves[0];
3862
3863	// traverse intersections
3864	// consecutive leaves are neighbors => add them to queue
3865	for (; iit != ray->mViewCells.end(); ++ iit)
3866	{
3867	// next pair
3868	BspLeaf *prevLeaf = leaf;
3869	bspVc = static_cast<BspViewCell >(iit);
3870	leaf = bspVc->mLeaves[0]; // exactly one leaf
3871
3872	// view space not valid or same view cell
3873	if (!leaf->TreeValid() \|\| !prevLeaf->TreeValid() \|\|
3874	(leaf->GetViewCell() == prevLeaf->GetViewCell()))
3875	continue;
3876
3877	vector<BspLeaf *> &neighbors = neighborMap[leaf];
3878
3879	bool found = false;
3880
3881	// both leaves inserted in queue already =>
3882	// look if double pair already exists
3883	if (leaf->Mailed() && prevLeaf->Mailed())
3884	{
3885	vector<BspLeaf *>::const_iterator it, it_end = neighbors.end();
3886
3887	for (it = neighbors.begin(); !found && (it != it_end); ++ it)
3888	if (*it == prevLeaf)
3889	found = true; // already in queue
3890	}
3891
3892	if (!found)
3893	{
3894	// this pair is not in map yet
3895	// => insert into the neighbor map and the queue
3896	neighbors.push_back(prevLeaf);
3897	neighborMap[prevLeaf].push_back(leaf);
3898
3899	leaf->Mail();
3900	prevLeaf->Mail();
3901
3902	MergeCandidate mc(leaf->GetViewCell(), prevLeaf->GetViewCell());
3903
3904	candidates.push_back(mc);
3905
3906	if (((int)candidates.size() % 1000) == 0)
3907	{
3908	cout << "collected " << (int)candidates.size() << " merge candidates" << endl;
3909	}
3910	}
3911	}
3912	}
3913
3914	Debug << "neighbormap size: " << (int)neighborMap.size() << endl;
3915	Debug << "merge queue: " << (int)candidates.size() << endl;
3916	Debug << "leaves in queue: " << numLeaves << endl;
3917
3918
3919	//-- collect the leaves which haven't been found by ray casting
3920	if (0)
3921	{
3922	cout << "finding additional merge candidates using geometry" << endl;
3923	vector<BspLeaf *> leaves;
3924	CollectLeaves(leaves, true);
3925	Debug << "found " << (int)leaves.size() << " new leaves" << endl << endl;
3926	CollectMergeCandidates(leaves, candidates);
3927	}
3928
3929	return numLeaves;
3930	}
3931
3932
3933
3934
3935	ViewCell *VspBspTree::GetViewCell(const Vector3 &point, const bool active)
3936	{
3937	if (mRoot == NULL)
3938	return NULL;
3939
3940	stack<BspNode *> nodeStack;
3941	nodeStack.push(mRoot);
3942
3943	ViewCellLeaf *viewcell = NULL;
3944
3945	while (!nodeStack.empty())
3946	{
3947	BspNode *node = nodeStack.top();
3948	nodeStack.pop();
3949
3950	if (node->IsLeaf())
3951	{
3952	viewcell = static_cast<BspLeaf *>(node)->GetViewCell();
3953	break;
3954	}
3955	else
3956	{
3957	BspInterior interior = static_cast<BspInterior >(node);
3958
3959	// random decision
3960	if (interior->GetPlane().Side(point) < 0)
3961	nodeStack.push(interior->GetBack());
3962	else
3963	nodeStack.push(interior->GetFront());
3964	}
3965	}
3966
3967	if (active)
3968	return mViewCellsTree->GetActiveViewCell(viewcell);
3969	else
3970	return viewcell;
3971	}
3972
3973
3974	bool VspBspTree::ViewPointValid(const Vector3 &viewPoint) const
3975	{
3976	BspNode *node = mRoot;
3977
3978	while (1)
3979	{
3980	// early exit
3981	if (node->TreeValid())
3982	return true;
3983
3984	if (node->IsLeaf())
3985	return false;
3986
3987	BspInterior in = static_cast<BspInterior >(node);
3988
3989	if (in->GetPlane().Side(viewPoint) <= 0)
3990	{
3991	node = in->GetBack();
3992	}
3993	else
3994	{
3995	node = in->GetFront();
3996	}
3997	}
3998
3999	// should never come here
4000	return false;
4001	}
4002
4003
4004	void VspBspTree::PropagateUpValidity(BspNode *node)
4005	{
4006	const bool isValid = node->TreeValid();
4007
4008	// propagative up invalid flag until only invalid nodes exist over this node
4009	if (!isValid)
4010	{
4011	while (!node->IsRoot() && node->GetParent()->TreeValid())
4012	{
4013	node = node->GetParent();
4014	node->SetTreeValid(false);
4015	}
4016	}
4017	else
4018	{
4019	// propagative up valid flag until one of the subtrees is invalid
4020	while (!node->IsRoot() && !node->TreeValid())
4021	{
4022	node = node->GetParent();
4023	BspInterior interior = static_cast<BspInterior >(node);
4024
4025	// the parent is valid iff both leaves are valid
4026	node->SetTreeValid(interior->GetBack()->TreeValid() &&
4027	interior->GetFront()->TreeValid());
4028	}
4029	}
4030	}
4031
4032
4033	bool VspBspTree::Export(OUT_STREAM &stream)
4034	{
4035	ExportNode(mRoot, stream);
4036	return true;
4037	}
4038
4039
4040	void VspBspTree::ExportNode(BspNode *node, OUT_STREAM &stream)
4041	{
4042	if (node->IsLeaf())
4043	{
4044	BspLeaf leaf = static_cast<BspLeaf >(node);
4045	ViewCell *viewCell = mViewCellsTree->GetActiveViewCell(leaf->GetViewCell());
4046
4047	int id = -1;
4048	if (viewCell != mOutOfBoundsCell)
4049	id = viewCell->GetId();
4050
4051	stream << "<Leaf viewCellId=\"" << id << "\" />" << endl;
4052	}
4053	else
4054	{
4055	BspInterior interior = static_cast<BspInterior >(node);
4056
4057	Plane3 plane = interior->GetPlane();
4058	stream << "<Interior plane=\"" << plane.mNormal.x << " "
4059	<< plane.mNormal.y << " " << plane.mNormal.z << " "
4060	<< plane.mD << "\">" << endl;
4061
4062	ExportNode(interior->GetBack(), stream);
4063	ExportNode(interior->GetFront(), stream);
4064
4065	stream << "</Interior>" << endl;
4066	}
4067	}
4068
4069	}

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

Download in other formats: