Context Navigation

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

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

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

Download in other formats: