Context Navigation

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

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

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

Download in other formats: