Context Navigation

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

Revision 1765, 98.1 KB checked in by mattausch, 18 years ago (diff)

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

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

Download in other formats: