Context Navigation

source: trunk/VUT/GtpVisibilityPreprocessor/src/SamplingPreprocessor.cpp @ 380

Revision 380, 25.6 KB checked in by mattausch, 19 years ago (diff)

Line
1	#include "SceneGraph.h"
2	#include "KdTree.h"
3	#include "SamplingPreprocessor.h"
4	#include "X3dExporter.h"
5	#include "Environment.h"
6	#include "MutualVisibility.h"
7	#include "Polygon3.h"
8	#include "ViewCell.h"
9
10	SamplingPreprocessor::SamplingPreprocessor(): mPass(0), mSampleRays(NULL)
11	{
12	// this should increase coherence of the samples
13	environment->GetIntValue("Sampling.samplesPerPass", mSamplesPerPass);
14	environment->GetIntValue("Sampling.totalSamples", mTotalSamples);
15	environment->GetIntValue("BspTree.Construction.samples", mBspConstructionSamples);
16	environment->GetIntValue("ViewCells.PostProcessing.samples", mPostProcessSamples);
17	mKdPvsDepth = 100;
18	mStats.open("stats.log");
19
20	}
21
22	SamplingPreprocessor::~SamplingPreprocessor()
23	{
24	CLEAR_CONTAINER(mSampleRays);
25	}
26
27	void
28	SamplingPreprocessor::SetupRay(Ray &ray,
29	const Vector3 &point,
30	const Vector3 &direction,
31	const int type)
32	{
33	ray.intersections.clear();
34	ray.kdLeaves.clear();
35	ray.testedObjects.clear();
36	ray.bspIntersections.clear();
37	ray.mFlags \|= Ray::STORE_KDLEAVES \| Ray::STORE_BSP_INTERSECTIONS;
38	// cout<<point<<" "<<direction<<endl;
39	ray.Init(point, direction, type);
40	}
41
42	KdNode *
43	SamplingPreprocessor::GetNodeForPvs(KdLeaf *leaf)
44	{
45	KdNode *node = leaf;
46	while (node->mParent && node->mDepth > mKdPvsDepth)
47	node = node->mParent;
48	return node;
49	}
50
51	bool
52	SamplingPreprocessor::BuildBspTree()
53	{
54	// delete old tree
55	DEL_PTR(mBspTree);
56	mBspTree = new BspTree(&mUnbounded);
57	ObjectContainer objects;
58
59	switch (BspTree::sConstructionMethod)
60	{
61	case BspTree::FROM_INPUT_VIEW_CELLS:
62	mBspTree->SetGenerateViewCells(false);
63	mBspTree->Construct(mViewCells);
64	break;
65	case BspTree::FROM_SCENE_GEOMETRY:
66	DeleteViewCells(); // we generate new view cells
67	mBspTree->SetGenerateViewCells(true);
68	mSceneGraph->CollectObjects(&objects);
69	mBspTree->Construct(objects);
70	break;
71	case BspTree::FROM_RAYS:
72	DeleteViewCells(); // we generate new view cells
73	mBspTree->SetGenerateViewCells(true);
74	mBspTree->Construct(mSampleRays);
75	break;
76	default:
77	Debug << "Error: Method not available\n";
78	break;
79	}
80
81
82	return true;
83	}
84
85	int
86	SamplingPreprocessor::AddNodeSamples(const Ray &ray,
87	Intersectable *sObject,
88	Intersectable *tObject
89	)
90	{
91	int contributingSamples = 0;
92	int j;
93	int objects = 0;
94	if (sObject)
95	objects++;
96	if (tObject)
97	objects++;
98
99	if (objects) {
100	for (j=0; j < ray.kdLeaves.size(); j++) {
101	KdNode *node = GetNodeForPvs( ray.kdLeaves[j] );
102	if (sObject)
103	contributingSamples += sObject->mKdPvs.AddSample(node);
104	if (tObject)
105	contributingSamples += tObject->mKdPvs.AddSample(node);
106	}
107	}
108
109	for (j=1; j < ((int)ray.kdLeaves.size() - 1); j++) {
110	ray.kdLeaves[j]->AddPassingRay2(ray,
111	objects,
112	ray.kdLeaves.size()
113	);
114	}
115
116	return contributingSamples;
117	}
118
119
120	int SamplingPreprocessor::AddObjectSamples(Intersectable *obj, const Ray &ray)
121	{
122	int contributingSamples = 0;
123	int j;
124
125	// object can be seen from the view cell => add to view cell pvs
126	for (j=0; j < ray.bspIntersections.size(); ++ j)
127	{
128	BspLeaf *leaf = ray.bspIntersections[j].mLeaf;
129	// if ray not in unbounded space
130	if (leaf->GetViewCell() != &mUnbounded)
131	contributingSamples +=
132	leaf->GetViewCell()->GetPvs().AddSample(obj);
133	}
134
135	// rays passing through this viewcell
136	if (mPass > 1)
137	for (j=1; j < ((int)ray.bspIntersections.size() - 1); ++ j)
138	{
139	BspLeaf *leaf = ray.bspIntersections[j].mLeaf;
140
141	if (leaf->GetViewCell() != &mUnbounded)
142	leaf->GetViewCell()->
143	AddPassingRay(ray, contributingSamples ? 1 : 0);
144	}
145
146	return contributingSamples;
147	}
148
149
150	void
151	SamplingPreprocessor::HoleSamplingPass()
152	{
153	vector<KdLeaf *> leaves;
154	mKdTree->CollectLeaves(leaves);
155
156	// go through all the leaves and evaluate their passing contribution
157	for (int i=0 ; i < leaves.size(); i++) {
158	KdLeaf *leaf = leaves[i];
159	cout<<leaf->mPassingRays<<endl;
160	}
161	}
162
163
164	int
165	SamplingPreprocessor::CastRay(Intersectable *object,
166	Ray &ray
167	)
168	{
169	int sampleContributions = 0;
170
171	long t1 = GetRealTime();
172	// cast ray to KD tree to find intersection with other objects
173	mKdTree->CastRay(ray);
174	long t2 = GetRealTime();
175
176	if (0 && object && object->GetId() > 2197) {
177	object->Describe(cout)<<endl;
178	cout<<ray<<endl;
179	}
180
181	if (ViewCell::sHierarchy == ViewCell::BSP)
182	{
183	// cast ray to BSP tree to get intersection with view cells
184	if (mBspTree)
185	{
186	mBspTree->CastRay(ray);
187
188	if (object)
189	sampleContributions += AddObjectSamples(object, ray);
190
191	if (!ray.intersections.empty()) // second intersection found
192	{
193	sampleContributions +=
194	AddObjectSamples(ray.intersections[0].mObject, ray);
195	}
196	}
197	}
198	else
199	{
200	if (ray.kdLeaves.size()) {
201	Intersectable *terminator =
202	ray.intersections.size() ? ray.intersections[0].mObject: NULL;
203
204	sampleContributions += AddNodeSamples(ray,
205	object,
206	terminator);
207	}
208	}
209
210	return sampleContributions;
211	}
212
213	// void
214	// SamplingPreprocessor::AvsGenerateRandomRay(Ray &ray)
215	// {
216	// int objId = RandomValue(0, mObjects.size());
217	// Intersectable *object = objects[objId];
218	// object->GetRandomSurfacePoint(point, normal);
219	// direction = UniformRandomVector(normal);
220	// SetupRay(ray, point, direction);
221	// }
222
223	// void
224	// SamplingPreprocessor::AvsHandleRay(Ray &ray)
225	// {
226	// int sampleContributions = 0;
227
228	// mKdTree->CastRay(ray);
229
230	// if (ray.leaves.size()) {
231	// sampleContributions += AddNodeSamples(object, ray, pass);
232
233	// if (ray.intersections.size()) {
234	// sampleContributions += AddNodeSamples(ray.intersections[0].mObject, ray, pass);
235	// }
236	// }
237	// }
238
239	// void
240	// SamplingPreprocessor::AvsBorderSampling(Ray &ray)
241	// {
242
243
244	// }
245
246	// void
247	// SamplingPreprocessor::AvsPass()
248	// {
249	// Ray ray;
250	// while (1) {
251	// AvsGenerateRay(ray);
252	// HandleRay(ray);
253	// while ( !mRayQueue.empty() ) {
254	// Ray ray = mRayQueue.pop();
255	// mRayQueue.pop();
256	// AdaptiveBorderSampling(ray);
257	// }
258	// }
259
260
261
262	// }
263
264
265	int
266	SamplingPreprocessor::CastEdgeSamples(
267	Intersectable *object,
268	const Vector3 &point,
269	MeshInstance *mi,
270	const int samples
271	)
272	{
273	Ray ray;
274	int maxTries = samples*10;
275	int i;
276	int rays = 0;
277	int edgeSamplesContributions = 0;
278	for (i=0; i < maxTries && rays < samples; i++) {
279	// pickup a random face of each mesh
280	Mesh *mesh = mi->GetMesh();
281	int face = RandomValue(0, mesh->mFaces.size()-1);
282
283	Polygon3 poly(mesh->mFaces[face], mesh);
284	poly.Scale(1.001);
285	// now extend a random edge of the face
286	int edge = RandomValue(0, poly.mVertices.size()-1);
287	float t = RandomValue(0.0f,1.0f);
288	Vector3 target = tpoly.mVertices[edge] + (1.0f-t)poly.mVertices[(edge + 1)%
289	poly.mVertices.size()];
290	SetupRay(ray, point, target - point, Ray::LOCAL_RAY);
291	if (!mesh->CastRay(ray, mi)) {
292	// the rays which intersect the mesh have been discarded since they are not tangent
293	// to the mesh
294	rays++;
295	edgeSamplesContributions += CastRay(object, ray);
296	}
297	}
298	return edgeSamplesContributions;
299	}
300
301	KdNode *
302	SamplingPreprocessor::GetNodeToSample(Intersectable *object)
303	{
304	int pvsSize = object->mKdPvs.GetSize();
305	KdNode *nodeToSample = NULL;
306
307	bool samplePvsBoundary = false;
308	if (pvsSize && samplePvsBoundary) {
309	// this samples the nodes from the boundary of the current PVS
310	// mail all nodes from the pvs
311	Intersectable::NewMail();
312	KdPvsMap::iterator i = object->mKdPvs.mEntries.begin();
313
314	for (; i != object->mKdPvs.mEntries.end(); i++) {
315	KdNode node = (i).first;
316	node->Mail();
317	}
318
319	int maxTries = 2*pvsSize;
320	Debug << "Finding random neighbour" << endl;
321	for (int tries = 0; tries < 10; tries++) {
322	int index = RandomValue(0, pvsSize - 1);
323	KdPvsData data;
324	KdNode *node;
325	object->mKdPvs.GetData(index, node, data);
326	nodeToSample = mKdTree->FindRandomNeighbor(node, true);
327	if (nodeToSample)
328	break;
329	}
330	} else {
331	// just pickup a random node
332	// nodeToSample = mKdTree->GetRandomLeaf(Plane3(normal, point));
333	nodeToSample = mKdTree->GetRandomLeaf();
334	}
335	return nodeToSample;
336	}
337
338	void
339	SamplingPreprocessor::VerifyVisibility(Intersectable *object)
340	{
341	// mail all nodes from the pvs
342	Intersectable::NewMail();
343	KdPvsMap::iterator i = object->mKdPvs.mEntries.begin();
344	for (; i != object->mKdPvs.mEntries.end(); i++) {
345	KdNode node = (i).first;
346	node->Mail();
347	}
348	Debug << "Get all neighbours from PVS" << endl;
349	vector<KdNode *> invisibleNeighbors;
350	// get all neighbors of all PVS nodes
351	i = object->mKdPvs.mEntries.begin();
352	for (; i != object->mKdPvs.mEntries.end(); i++) {
353	KdNode node = (i).first;
354	mKdTree->FindNeighbors(node, invisibleNeighbors, true);
355	AxisAlignedBox3 box = object->GetBox();
356	for (int j=0; j < invisibleNeighbors.size(); j++) {
357	int visibility = ComputeBoxVisibility(mSceneGraph,
358	mKdTree,
359	box,
360	mKdTree->GetBox(invisibleNeighbors[j]),
361	1e-6f);
362	// exit(0);
363	}
364	// now rank all the neighbors according to probability that a new
365	// sample creates some contribution
366	}
367	}
368
369	bool
370	SamplingPreprocessor::ComputeVisibility()
371	{
372
373	// pickup an object
374	ObjectContainer objects;
375
376	mSceneGraph->CollectObjects(&objects);
377
378	Vector3 point, normal, direction;
379	Ray ray;
380
381	long startTime = GetTime();
382
383	int i;
384	int totalSamples = 0;
385
386	int pvsOut = Min((int)objects.size(), 10);
387
388	vector<Ray> rays[10];
389
390	while (totalSamples < mTotalSamples) {
391	int passContributingSamples = 0;
392	int passSampleContributions = 0;
393	int passSamples = 0;
394	int index = 0;
395
396	int reverseSamples = 0;
397
398
399	//cout << "totalSamples: " << totalSamples << endl;
400
401	for (i = 0; i < objects.size(); i++) {
402
403	KdNode *nodeToSample = NULL;
404	Intersectable *object = objects[i];
405
406	int pvsSize = 0;
407	if (ViewCell::sHierarchy == ViewCell::KD)
408	pvsSize = object->mKdPvs.GetSize();
409
410
411	if (0 && pvsSize && mPass == 1000 ) {
412	VerifyVisibility(object);
413	}
414
415	int faceIndex = object->GetRandomSurfacePoint(point, normal);
416
417	bool viewcellSample = true;
418	int sampleContributions;
419	bool debug = false; //(object->GetId() >= 2199);
420	if (viewcellSample) {
421	//mKdTree->GetRandomLeaf(Plane3(normal, point));
422
423	nodeToSample = GetNodeToSample(object);
424
425	for (int k=0; k < mSamplesPerPass; k++) {
426	bool reverseSample = false;
427
428
429	if (nodeToSample) {
430	AxisAlignedBox3 box = mKdTree->GetBox(nodeToSample);
431	Vector3 pointToSample = box.GetRandomPoint();
432	// pointToSample.y = 0.9box.Min().y + 0.1box.Max().y;
433	if (object->GetRandomVisibleSurfacePoint( point, normal, pointToSample, 3 )) {
434	direction = pointToSample - point;
435	} else {
436	reverseSamples++;
437	reverseSample = true;
438	direction = point - pointToSample;
439	point = pointToSample;
440	}
441	}
442	else {
443	direction = UniformRandomVector(normal);
444	}
445
446	// construct a ray
447	SetupRay(ray, point, direction, Ray::LOCAL_RAY);
448
449	sampleContributions = CastRay(reverseSample ? NULL : object, ray);
450
451	//-- CORR matt: put block inside loop
452	if (sampleContributions) {
453	passContributingSamples ++;
454	passSampleContributions += sampleContributions;
455	}
456
457	if ( i < pvsOut )
458	rays[i].push_back(ray);
459
460	if (!ray.intersections.empty()) {
461	// check whether we can add this to the rays
462	for (int j = 0; j < pvsOut; j++) {
463	if (objects[j] == ray.intersections[0].mObject) {
464	rays[j].push_back(ray);
465	}
466	}
467	}
468	//-------------------
469	if (ViewCell::sHierarchy == ViewCell::BSP)
470	{
471	ProcessBspViewCells(ray,
472	object,
473	faceIndex,
474	passContributingSamples,
475	passSampleContributions);
476	}
477	}
478	} else {
479	// edge samples
480	// get random visible mesh
481	// object->GetRandomVisibleMesh(Plane3(normal, point));
482	}
483
484	// CORR matt: must add all samples
485	passSamples += mSamplesPerPass;
486	}
487
488	totalSamples += passSamples;
489
490	// if (pass>10)
491	// HoleSamplingPass();
492
493	mPass++;
494
495	int pvsSize = 0;
496
497	if (ViewCell::sHierarchy == ViewCell::BSP) {
498	for (i=0; i < mViewCells.size(); i++) {
499	ViewCell *vc = mViewCells[i];
500	pvsSize += vc->GetPvs().GetSize();
501	}
502	} else {
503	for (i=0; i < objects.size(); i++) {
504	Intersectable *object = objects[i];
505	pvsSize += object->mKdPvs.GetSize();
506	}
507	}
508
509	float avgRayContrib = (passContributingSamples > 0) ?
510	passSampleContributions/(float)passContributingSamples : 0;
511
512	cout << "#Pass " << mPass << " : t = " << TimeDiff(startTime, GetTime())*1e-3 << "s" << endl;
513	cout << "#TotalSamples=" << totalSamples/1000
514	<< "k #SampleContributions=" << passSampleContributions << " ("
515	<< 100*passContributingSamples/(float)passSamples<<"%)" << " avgPVS="
516	<< pvsSize /(float)objects.size() << endl
517	<< "avg ray contrib=" << avgRayContrib << endl
518	<< "reverse samples [%]" << reverseSamples/(float)passSamples*100.0f << endl;
519
520	mStats <<
521	"#Pass\n" <<mPass<<endl<<
522	"#Time\n" << TimeDiff(startTime, GetTime())*1e-3 << endl<<
523	"#TotalSamples\n" << totalSamples<< endl<<
524	"#SampleContributions\n" << passSampleContributions << endl <<
525	"#PContributingSamples\n"<<100*passContributingSamples/(float)passSamples<<endl <<
526	"#AvgPVS\n"<< pvsSize/(float)objects.size() << endl <<
527	"#AvgRayContrib\n" << avgRayContrib << endl;
528	}
529
530	if (ViewCell::sHierarchy == ViewCell::KD)
531	cout << "#totalPvsSize=" << mKdTree->CollectLeafPvs() << endl;
532
533	if (mBspTree)
534	{
535	//-- render simulation
536	cout << "\nevaluating render time before merge ... ";
537	Real rt = SimulateRendering();
538
539	cout << "avg render time: " << rt * 1e-3 << endl;
540	Debug << "avg render time: " << rt * 1e-3 << endl;
541
542	//-- post processing of bsp view cells
543	int vcSize = 0;
544	int pvsSize = 0;
545
546	BspViewCellsStatistics stat;
547
548	Debug << "overall scene size: " << objects.size() << endl;
549	mBspTree->EvaluateViewCellsStats(stat);
550
551	Debug << "original view cell partition:\n" << stat << endl;
552
553	if (1) // export view cells
554	{
555	cout << "exporting view cells ... ";
556	Exporter *exporter = Exporter::GetExporter("view_cells.x3d");
557	if (exporter)
558	{
559	exporter->ExportBspViewCellPartition(*mBspTree, stat.maxPvs);
560	//exporter->ExportBspViewCellPartition(*mBspTree, 0);
561	delete exporter;
562	}
563	cout << "finished" << endl;
564	}
565
566	cout << "starting post processing using " << (int)mSampleRays.size() << " samples ... ";
567
568	long startTime = GetTime();
569	int merged = PostprocessViewCells(mSampleRays);
570
571	cout << "finished" << endl;
572	cout << "merged " << merged << " view cells in "
573	<< TimeDiff(startTime, GetTime()) *1e-3 << " secs" << endl;
574
575	//-- recount pvs
576	mBspTree->EvaluateViewCellsStats(stat);
577
578	Debug << "after post processing:\n" << stat << endl;
579
580	//-- render simulation
581	cout << "\nevaluating render time after merge ... ";
582
583	rt = SimulateRendering();
584
585	cout << "render time: " << rt * 1e-3 << endl;
586	Debug << "render time: " << rt * 1e-3 << endl;
587
588	if (1) // export view cells
589	{
590	cout << "exporting view cells after merge ... ";
591	Exporter *exporter = Exporter::GetExporter("merged_view_cells.x3d");
592	if (exporter)
593	{
594	exporter->ExportBspViewCellPartition(*mBspTree, stat.maxPvs);
595	//exporter->ExportBspViewCellPartition(*mBspTree, 0);
596	delete exporter;
597	}
598
599	cout << "finished" << endl;
600	}
601
602	//-- visualization of the bsp splits
603	bool exportSplits = false;
604	environment->GetBoolValue("BspTree.exportSplits", exportSplits);
605
606
607	cout << "exporting splits ... ";
608	if (exportSplits)
609	ExportSplits(objects);
610	cout << "finished" << endl;
611
612	// export the PVS of sample view cells
613	if (1)
614	ExportBspPvs(objects);
615	}
616
617	// HoleSamplingPass();
618	if (0) {
619	Exporter *exporter = Exporter::GetExporter("ray-density.x3d");
620	exporter->SetExportRayDensity(true);
621	exporter->ExportKdTree(*mKdTree);
622
623	if (mBspTree && (ViewCell::sHierarchy == ViewCell::BSP))
624	exporter->ExportBspTree(*mBspTree);
625
626	delete exporter;
627	}
628
629	bool exportRays = false;
630	if (exportRays) {
631	Exporter *exporter = NULL;
632	exporter = Exporter::GetExporter("sample-rays.x3d");
633	exporter->SetWireframe();
634	exporter->ExportKdTree(*mKdTree);
635	exporter->ExportBspTree(*mBspTree);
636
637	for (i=0; i < pvsOut; i++)
638	exporter->ExportRays(rays[i], 1000, RgbColor(1, 0, 0));
639	exporter->SetFilled();
640
641	delete exporter;
642	}
643
644	//-- several visualizations and statistics
645	if (1) {
646
647	for (int k=0; k < pvsOut; k++) {
648	Intersectable *object = objects[k];
649	char s[64];
650	sprintf(s, "sample-pvs%04d.x3d", k);
651	Exporter *exporter = Exporter::GetExporter(s);
652	exporter->SetWireframe();
653
654
655	KdPvsMap::iterator i = object->mKdPvs.mEntries.begin();
656	Intersectable::NewMail();
657
658	// avoid adding the object to the list
659	object->Mail();
660	ObjectContainer visibleObjects;
661
662	for (; i != object->mKdPvs.mEntries.end(); i++)
663	{
664	KdNode node = (i).first;
665	exporter->ExportBox(mKdTree->GetBox(node));
666	mKdTree->CollectObjects(node, visibleObjects);
667	}
668
669	exporter->ExportRays(rays[k], 1000, RgbColor(0, 1, 0));
670	exporter->SetFilled();
671
672	for (int j = 0; j < visibleObjects.size(); j++)
673	exporter->ExportIntersectable(visibleObjects[j]);
674
675
676	Material m;
677	m.mDiffuseColor = RgbColor(1, 0, 0);
678	exporter->SetForcedMaterial(m);
679	exporter->ExportIntersectable(object);
680
681	delete exporter;
682	}
683	}
684
685	return true;
686	}
687
688	void SamplingPreprocessor::ProcessBspViewCells(Ray &ray,
689	Intersectable *object,
690	int faceIndex,
691	int &contributingSamples,
692	int &sampleContributions)
693	{
694	// save rays for bsp tree construction
695	if (!mBspTree)
696	{
697	if ((BspTree::sConstructionMethod == BspTree::FROM_RAYS) &&
698	((int)mSampleRays.size() < mBspConstructionSamples))
699	{
700	// also add origin to sample in order to extract it as input polygons
701	MeshInstance mi = dynamic_cast<MeshInstance >(object);
702	ray.sourceObject = Ray::Intersection(0.0, mi, faceIndex);
703
704	mSampleRays.push_back(new Ray(ray));
705	Debug << "abba " << mSampleRays.size() << endl;
706	}
707	else
708	{
709	// construct BSP tree using the samples
710	cout << "building bsp tree from " << mSampleRays.size() << " samples " << endl;
711	BuildBspTree();
712
713	// add contributions of saved samples to PVS
714	contributingSamples += mBspTree->GetStat().contributingSamples;
715	sampleContributions += mBspTree->GetStat().sampleContributions;
716
717	BspTreeStatistics(Debug);
718
719	if (0) Export("vc_bsptree.x3d", false, false, true);
720
721	// throw away samples because BSP leaves not stored in order
722	// Need ordered rays for post processing => collect new rays
723	CLEAR_CONTAINER(mSampleRays);
724	}
725	}
726	// save rays for post processing
727	else if ((int)mSampleRays.size() < mPostProcessSamples)
728	{
729	Debug << "police " << mSampleRays.size() << endl;
730	mSampleRays.push_back(new Ray(ray));
731	}
732	}
733
734	// merge or subdivide view cells
735	int SamplingPreprocessor::PostprocessViewCells(const RayContainer &rays)
736	{
737	int merged = 0;
738
739	RayContainer::const_iterator rit, rit_end = rays.end();
740	vector<Ray::BspIntersection>::const_iterator iit;
741
742	for (rit = rays.begin(); rit != rays.end(); ++ rit)
743	{
744	// traverse leaves stored in the rays and compare and merge consecutive
745	// leaves (i.e., the neighbors in the tree)
746	if ((*rit)->bspIntersections.empty())
747	continue;
748
749	iit = (*rit)->bspIntersections.begin();
750
751	BspLeaf previousLeaf = (iit).mLeaf;
752	++ iit;
753
754	for (; iit != (*rit)->bspIntersections.end(); ++ iit)
755	{
756	BspLeaf leaf = (iit).mLeaf;
757
758	if (mBspTree->ShouldMerge(leaf, previousLeaf))
759	{
760	mBspTree->MergeViewCells(leaf, previousLeaf);
761
762	++ merged;
763	}
764	previousLeaf = leaf;
765	}
766	}
767
768	return merged;
769	}
770
771	void SamplingPreprocessor::ExportSplits(const ObjectContainer &objects)
772	{
773	Exporter *exporter = Exporter::GetExporter("bsp_splits.x3d");
774
775	if (exporter)
776	{
777	Material m;
778	m.mDiffuseColor = RgbColor(1, 0, 0);
779	exporter->SetForcedMaterial(m);
780	exporter->SetWireframe();
781	exporter->ExportBspSplits(*mBspTree);
782
783	// take forced material, else big scenes cannot be viewed
784	m.mDiffuseColor = RgbColor(0, 1, 0);
785	exporter->SetForcedMaterial(m);
786	exporter->SetFilled();
787
788	exporter->ResetForcedMaterial();
789
790	// export rays
791	if (0)
792	{
793	RayContainer outRays;
794
795	for (int i = 0; i < mSampleRays.size(); ++ i)
796	{
797	// only rays piercing geometry
798	if (!mSampleRays[i]->intersections.empty())
799	outRays.push_back(mSampleRays[i]);
800	}
801	if (BspTree::sConstructionMethod == BspTree::FROM_RAYS)
802	{
803	// export rays
804	exporter->ExportRays(outRays, 1000, RgbColor(1, 1, 0));
805	}
806	}
807
808	// export scene geometry
809	if (0)
810	{
811	Material m;//= RandomMaterial();
812	m.mDiffuseColor = RgbColor(0, 1, 0);
813	exporter->SetForcedMaterial(m);
814	exporter->SetWireframe();
815
816	for (int j = 0; j < objects.size(); ++ j)
817	exporter->ExportIntersectable(objects[j]);
818	}
819
820	delete exporter;
821	}
822	}
823
824	void SamplingPreprocessor::ExportBspPvs(const ObjectContainer &objects)
825	{
826	//-- some random view cells and rays for output
827	const int leafOut = 10;
828
829	vector<Ray> vcRays[leafOut];
830	vector<BspLeaf *> bspLeaves;
831
832	for (int i = 0; i < leafOut; ++ i)
833	bspLeaves.push_back(mBspTree->GetRandomLeaf());
834
835	const int raysOut = min((int)mSampleRays.size(), 20000);
836
837	ViewCell::NewMail();
838
839	for (int i = 0; i < bspLeaves.size(); ++ i)
840	{
841	cout << "creating output for view cell " << i << " ... ";
842	// check whether we can add the current ray to the output rays
843	for (int k = 0; k < raysOut; ++ k)
844	{
845	Ray *ray = mSampleRays[k];
846
847	for (int j = 0; j < (int)ray->bspIntersections.size(); ++ j)
848	{
849	BspLeaf *leaf = ray->bspIntersections[j].mLeaf;
850
851	if (bspLeaves[i]->GetViewCell() == leaf->GetViewCell())
852	{
853	vcRays[i].push_back(*ray);
854	}
855	}
856	}
857
858	Intersectable::NewMail();
859
860	ViewCell *vc = bspLeaves[i]->GetViewCell();
861
862	//bspLeaves[j]->Mail();
863	char s[64]; sprintf(s, "bsp-pvs%04d.x3d", i);
864
865	Exporter *exporter = Exporter::GetExporter(s);
866	exporter->SetFilled();
867
868	ViewCellPvsMap::iterator it = vc->GetPvs().mEntries.begin();
869
870	exporter->SetWireframe();
871
872	Material m;//= RandomMaterial();
873	m.mDiffuseColor = RgbColor(0, 1, 0);
874	exporter->SetForcedMaterial(m);
875
876	if (vc->GetMesh())
877	exporter->ExportViewCell(vc);
878	else
879	{
880	PolygonContainer cell;
881	// export view cell
882	mBspTree->ConstructGeometry(bspLeaves[i]->GetViewCell(), cell);
883	exporter->ExportPolygons(cell);
884	CLEAR_CONTAINER(cell);
885	}
886
887	Debug << i << ": pvs size=" << (int)vc->GetPvs().GetSize()
888	<< ", piercing rays=" << (int)vcRays[i].size() << endl;
889
890	// export view cells
891	if (0)
892	{
893	m.mDiffuseColor = RgbColor(1, 0, 1);
894	exporter->SetForcedMaterial(m);
895	exporter->ExportViewCells(mViewCells);
896	}
897
898	// export rays piercing this view cell
899	exporter->ExportRays(vcRays[i], 1000, RgbColor(0, 1, 0));
900
901	m.mDiffuseColor = RgbColor(1, 0, 0);
902	exporter->SetForcedMaterial(m);
903
904	// output PVS of view cell
905	for (; it != vc->GetPvs().mEntries.end(); ++ it)
906	{
907	Intersectable intersect = (it).first;
908	if (!intersect->Mailed())
909	{
910	exporter->ExportIntersectable(intersect);
911	intersect->Mail();
912	}
913	}
914
915	// output rest of the objects
916	if (0)
917	{
918	Material m;//= RandomMaterial();
919	m.mDiffuseColor = RgbColor(0, 0, 1);
920	exporter->SetForcedMaterial(m);
921
922	for (int j = 0; j < objects.size(); ++ j)
923	if (!objects[j]->Mailed())
924	{
925	exporter->SetForcedMaterial(m);
926	exporter->ExportIntersectable(objects[j]);
927	objects[j]->Mail();
928	}
929	}
930	DEL_PTR(exporter);
931	cout << "finished" << endl;
932	}
933	}
934
935
936	Real SamplingPreprocessor::RenderPvs(ViewCell &viewCell,
937	const float objRenderTime) const
938	{
939	return viewCell.GetPvs().GetSize() * objRenderTime;
940	}
941
942	Real SamplingPreprocessor::SimulateRendering()
943	{
944	Real renderTime = 0;
945
946	// render time for 1 object of PVS
947	const float objRt = 1.0f;
948	// const overhead for crossing a view cell border
949	const float vcOverhead = 0.01f;
950
951	// total area of view cells
952	float totalArea = 0;//= mKdTree->GetBox().SurfaceArea();
953
954	ViewCellContainer viewCells;
955
956	mBspTree->CollectViewCells(viewCells);
957
958	ViewCellContainer::const_iterator it, it_end = viewCells.end();
959	PolygonContainer::const_iterator pit;
960
961	for (it = viewCells.begin(); it != it_end; ++ it)
962	{
963	// surface area substitute for probability
964	PolygonContainer cell;
965	float area = 0;
966
967	mBspTree->ConstructGeometry(dynamic_cast<BspViewCell >(it), cell);
968
969	for (pit = cell.begin(); pit != cell.end(); ++ pit)
970	area += (*pit)->GetArea();
971
972	renderTime += area * RenderPvs((it), objRt);
973	totalArea += area;
974	}
975
976	renderTime /= totalArea;
977
978	Debug << "render time without overhead: " << renderTime * 1e-3 << endl;
979
980	renderTime += (float)viewCells.size() * vcOverhead;
981
982	return renderTime;
983	}

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

Download in other formats: