[1237] | 1 | #include <stack>
|
---|
| 2 | #include <time.h>
|
---|
| 3 | #include <iomanip>
|
---|
| 4 |
|
---|
| 5 | #include "ViewCell.h"
|
---|
| 6 | #include "Plane3.h"
|
---|
| 7 | #include "HierarchyManager.h"
|
---|
| 8 | #include "Mesh.h"
|
---|
| 9 | #include "common.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 "ViewCellsManager.h"
|
---|
| 17 | #include "Beam.h"
|
---|
| 18 | #include "KdTree.h"
|
---|
[1315] | 19 | #include "IntersectableWrapper.h"
|
---|
[1237] | 20 | #include "VspTree.h"
|
---|
| 21 | #include "OspTree.h"
|
---|
[1259] | 22 | #include "BvHierarchy.h"
|
---|
[1237] | 23 |
|
---|
| 24 |
|
---|
| 25 | namespace GtpVisibilityPreprocessor {
|
---|
| 26 |
|
---|
| 27 |
|
---|
| 28 | #define USE_FIXEDPOINT_T 0
|
---|
| 29 |
|
---|
| 30 |
|
---|
| 31 | /*******************************************************************/
|
---|
| 32 | /* class HierarchyManager implementation */
|
---|
| 33 | /*******************************************************************/
|
---|
| 34 |
|
---|
| 35 |
|
---|
[1421] | 36 | HierarchyManager::HierarchyManager(const int objectSpaceSubdivisionType):
|
---|
[1308] | 37 | mObjectSpaceSubdivisionType(objectSpaceSubdivisionType),
|
---|
[1279] | 38 | mOspTree(NULL),
|
---|
| 39 | mBvHierarchy(NULL)
|
---|
[1237] | 40 | {
|
---|
[1308] | 41 | switch(mObjectSpaceSubdivisionType)
|
---|
[1279] | 42 | {
|
---|
| 43 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 44 | mOspTree = new OspTree();
|
---|
| 45 | mOspTree->mVspTree = mVspTree;
|
---|
[1379] | 46 | mOspTree->mHierarchyManager = this;
|
---|
[1279] | 47 | break;
|
---|
| 48 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 49 | mBvHierarchy = new BvHierarchy();
|
---|
[1379] | 50 | mBvHierarchy->mHierarchyManager = this;
|
---|
[1279] | 51 | break;
|
---|
| 52 | default:
|
---|
| 53 | break;
|
---|
| 54 | }
|
---|
| 55 |
|
---|
[1379] | 56 | // hierarchy manager links view space partition and object space partition
|
---|
[1421] | 57 | mVspTree = new VspTree();
|
---|
[1379] | 58 | mVspTree->mHierarchyManager = this;
|
---|
| 59 |
|
---|
[1288] | 60 | ParseEnvironment();
|
---|
[1237] | 61 | }
|
---|
| 62 |
|
---|
| 63 |
|
---|
[1421] | 64 | HierarchyManager::HierarchyManager(KdTree *kdTree):
|
---|
[1308] | 65 | mObjectSpaceSubdivisionType(KD_BASED_OBJ_SUBDIV),
|
---|
[1279] | 66 | mBvHierarchy(NULL)
|
---|
| 67 | {
|
---|
| 68 | mOspTree = new OspTree(*kdTree);
|
---|
| 69 | mOspTree->mVspTree = mVspTree;
|
---|
| 70 |
|
---|
[1421] | 71 | mVspTree = new VspTree();
|
---|
[1379] | 72 | mVspTree->mHierarchyManager = this;
|
---|
[1279] | 73 |
|
---|
[1288] | 74 | ParseEnvironment();
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 |
|
---|
| 78 | void HierarchyManager::ParseEnvironment()
|
---|
| 79 | {
|
---|
[1279] | 80 | char subdivisionStatsLog[100];
|
---|
| 81 | Environment::GetSingleton()->GetStringValue("Hierarchy.subdivisionStats",
|
---|
| 82 | subdivisionStatsLog);
|
---|
| 83 | mSubdivisionStats.open(subdivisionStatsLog);
|
---|
[1288] | 84 |
|
---|
| 85 | Environment::GetSingleton()->GetFloatValue(
|
---|
| 86 | "Hierarchy.Termination.minGlobalCostRatio", mTermMinGlobalCostRatio);
|
---|
| 87 | Environment::GetSingleton()->GetIntValue(
|
---|
| 88 | "Hierarchy.Termination.globalCostMissTolerance", mTermGlobalCostMissTolerance);
|
---|
| 89 |
|
---|
[1370] | 90 | Environment::GetSingleton()->GetBoolValue(
|
---|
| 91 | "Hierarchy.Construction.startWithObjectSpace", mStartWithObjectSpace);
|
---|
| 92 |
|
---|
[1293] | 93 | Environment::GetSingleton()->GetIntValue(
|
---|
[1294] | 94 | "Hierarchy.Termination.maxLeaves", mTermMaxLeaves);
|
---|
| 95 |
|
---|
| 96 | Environment::GetSingleton()->GetIntValue(
|
---|
[1293] | 97 | "Hierarchy.Construction.type", mConstructionType);
|
---|
| 98 |
|
---|
[1311] | 99 | Environment::GetSingleton()->GetIntValue(
|
---|
| 100 | "Hierarchy.Construction.minDepthForOsp", mMinDepthForObjectSpaceSubdivion);
|
---|
[1370] | 101 |
|
---|
| 102 | Environment::GetSingleton()->GetIntValue(
|
---|
| 103 | "Hierarchy.Construction.minDepthForVsp", mMinDepthForViewSpaceSubdivion);
|
---|
[1311] | 104 |
|
---|
[1314] | 105 | Environment::GetSingleton()->GetBoolValue(
|
---|
| 106 | "Hierarchy.Construction.repairQueue", mRepairQueue);
|
---|
| 107 |
|
---|
[1449] | 108 | Environment::GetSingleton()->GetBoolValue(
|
---|
[1564] | 109 | "Hierarchy.Construction.useMultiLevel", mUseMultiLevelConstruction);
|
---|
[1449] | 110 |
|
---|
| 111 | mUseMultiLevelConstruction;
|
---|
[1294] | 112 | Debug << "******** Hierachy Manager Parameters ***********" << endl;
|
---|
| 113 | Debug << "max leaves: " << mTermMaxLeaves << endl;
|
---|
[1288] | 114 | Debug << "min global cost ratio: " << mTermMinGlobalCostRatio << endl;
|
---|
| 115 | Debug << "global cost miss tolerance: " << mTermGlobalCostMissTolerance << endl;
|
---|
[1314] | 116 | Debug << "construction type: " << mConstructionType << endl;
|
---|
| 117 | Debug << "min depth for object space subdivision: " << mMinDepthForObjectSpaceSubdivion << endl;
|
---|
| 118 | Debug << "repair queue: " << mRepairQueue << endl;
|
---|
[1449] | 119 | Debug << endl;
|
---|
[1279] | 120 | }
|
---|
| 121 |
|
---|
| 122 |
|
---|
| 123 | HierarchyManager::~HierarchyManager()
|
---|
| 124 | {
|
---|
| 125 | DEL_PTR(mOspTree);
|
---|
[1421] | 126 | DEL_PTR(mVspTree);
|
---|
[1279] | 127 | DEL_PTR(mBvHierarchy);
|
---|
| 128 | }
|
---|
| 129 |
|
---|
| 130 |
|
---|
[1370] | 131 | int HierarchyManager::GetObjectSpaceSubdivisionType() const
|
---|
| 132 | {
|
---|
| 133 | return mObjectSpaceSubdivisionType;
|
---|
| 134 | }
|
---|
| 135 |
|
---|
| 136 |
|
---|
| 137 | int HierarchyManager::GetViewSpaceSubdivisionType() const
|
---|
| 138 | {
|
---|
| 139 | return mViewSpaceSubdivisionType;
|
---|
| 140 | }
|
---|
| 141 |
|
---|
| 142 |
|
---|
[1279] | 143 | void HierarchyManager::SetViewCellsManager(ViewCellsManager *vcm)
|
---|
| 144 | {
|
---|
| 145 | mVspTree->SetViewCellsManager(vcm);
|
---|
| 146 |
|
---|
| 147 | if (mOspTree)
|
---|
[1576] | 148 | {
|
---|
[1279] | 149 | mOspTree->SetViewCellsManager(vcm);
|
---|
[1576] | 150 | }
|
---|
[1416] | 151 | else if (mBvHierarchy)
|
---|
[1576] | 152 | {
|
---|
[1279] | 153 | mBvHierarchy->SetViewCellsManager(vcm);
|
---|
[1576] | 154 | }
|
---|
[1279] | 155 | }
|
---|
| 156 |
|
---|
| 157 |
|
---|
| 158 | void HierarchyManager::SetViewCellsTree(ViewCellsTree *vcTree)
|
---|
| 159 | {
|
---|
| 160 | mVspTree->SetViewCellsTree(vcTree);
|
---|
| 161 | }
|
---|
| 162 |
|
---|
| 163 |
|
---|
[1379] | 164 | VspTree *HierarchyManager::GetVspTree()
|
---|
| 165 | {
|
---|
| 166 | return mVspTree;
|
---|
| 167 | }
|
---|
| 168 |
|
---|
[1563] | 169 | /*
|
---|
[1379] | 170 | AxisAlignedBox3 HierarchyManager::GetViewSpaceBox() const
|
---|
| 171 | {
|
---|
| 172 | return mVspTree->mBoundingBox;
|
---|
[1563] | 173 | }*/
|
---|
[1379] | 174 |
|
---|
| 175 |
|
---|
[1416] | 176 | AxisAlignedBox3 HierarchyManager::GetObjectSpaceBox() const
|
---|
| 177 | {
|
---|
| 178 | switch (mObjectSpaceSubdivisionType)
|
---|
| 179 | {
|
---|
| 180 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 181 | return mOspTree->mBoundingBox;
|
---|
| 182 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 183 | return mBvHierarchy->mBoundingBox;
|
---|
| 184 | default:
|
---|
[1576] | 185 | // hack: empty box
|
---|
[1416] | 186 | return AxisAlignedBox3();
|
---|
| 187 | }
|
---|
| 188 | }
|
---|
| 189 |
|
---|
| 190 |
|
---|
[1237] | 191 | SubdivisionCandidate *HierarchyManager::NextSubdivisionCandidate()
|
---|
| 192 | {
|
---|
| 193 | SubdivisionCandidate *splitCandidate = mTQueue.Top();
|
---|
| 194 | mTQueue.Pop();
|
---|
| 195 |
|
---|
| 196 | return splitCandidate;
|
---|
| 197 | }
|
---|
| 198 |
|
---|
| 199 |
|
---|
| 200 | void HierarchyManager::EvalSubdivisionStats(const SubdivisionCandidate &tData)
|
---|
| 201 | {
|
---|
| 202 | const float costDecr = tData.GetRenderCostDecrease();
|
---|
| 203 |
|
---|
[1576] | 204 | AddSubdivisionStats(mHierarchyStats.Leaves(),
|
---|
| 205 | costDecr,
|
---|
| 206 | mTotalCost,
|
---|
| 207 | mTotalPvsEntries
|
---|
| 208 | );
|
---|
[1237] | 209 | }
|
---|
| 210 |
|
---|
| 211 |
|
---|
| 212 | void HierarchyManager::AddSubdivisionStats(const int splits,
|
---|
| 213 | const float renderCostDecr,
|
---|
[1576] | 214 | const float totalRenderCost,
|
---|
| 215 | const int pvsEntries)
|
---|
[1237] | 216 | {
|
---|
[1308] | 217 | mSubdivisionStats
|
---|
[1237] | 218 | << "#Splits\n" << splits << endl
|
---|
| 219 | << "#RenderCostDecrease\n" << renderCostDecr << endl
|
---|
[1576] | 220 | << "#TotalPvsEntries\n" << pvsEntries << endl
|
---|
[1237] | 221 | << "#TotalRenderCost\n" << totalRenderCost << endl;
|
---|
| 222 | }
|
---|
| 223 |
|
---|
| 224 |
|
---|
| 225 | bool HierarchyManager::GlobalTerminationCriteriaMet(SubdivisionCandidate *candidate) const
|
---|
| 226 | {
|
---|
[1421] | 227 | const bool terminationCriteriaMet =
|
---|
| 228 | (0
|
---|
[1294] | 229 | || (mHierarchyStats.Leaves() >= mTermMaxLeaves)
|
---|
[1449] | 230 | || (mHierarchyStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
|
---|
| 231 | || (candidate->GlobalTerminationCriteriaMet())
|
---|
[1288] | 232 | );
|
---|
[1421] | 233 |
|
---|
[1522] | 234 | if (0 && terminationCriteriaMet)
|
---|
[1421] | 235 | {
|
---|
| 236 | Debug << "hierarchy global termination criteria met:" << endl;
|
---|
| 237 | Debug << "leaves: " << mHierarchyStats.Leaves() << " " << mTermMaxLeaves << endl;
|
---|
[1449] | 238 | Debug << "cost misses: " << mHierarchyStats.mGlobalCostMisses << " " << mTermGlobalCostMissTolerance << endl;
|
---|
[1421] | 239 | }
|
---|
| 240 | return terminationCriteriaMet;
|
---|
[1237] | 241 | }
|
---|
| 242 |
|
---|
| 243 |
|
---|
| 244 | void HierarchyManager::Construct(const VssRayContainer &sampleRays,
|
---|
[1311] | 245 | const ObjectContainer &objects,
|
---|
| 246 | AxisAlignedBox3 *forcedViewSpace)
|
---|
[1237] | 247 | {
|
---|
[1449] | 248 | if (mUseMultiLevelConstruction)
|
---|
| 249 | {
|
---|
| 250 | ConstructMultiLevel(sampleRays, objects, forcedViewSpace);
|
---|
| 251 | }
|
---|
| 252 | else
|
---|
| 253 | {
|
---|
| 254 | ConstructInterleaved(sampleRays, objects, forcedViewSpace);
|
---|
| 255 | }
|
---|
| 256 | }
|
---|
| 257 |
|
---|
| 258 |
|
---|
| 259 | void HierarchyManager::ConstructInterleaved(const VssRayContainer &sampleRays,
|
---|
| 260 | const ObjectContainer &objects,
|
---|
| 261 | AxisAlignedBox3 *forcedViewSpace)
|
---|
| 262 | {
|
---|
[1308] | 263 | mHierarchyStats.Reset();
|
---|
| 264 | mHierarchyStats.Start();
|
---|
[1449] | 265 | mHierarchyStats.nodes = 2; // two nodes for view space and object space
|
---|
| 266 |
|
---|
[1308] | 267 | mTotalCost = (float)objects.size();
|
---|
| 268 | Debug << "setting total cost to " << mTotalCost << endl;
|
---|
[1237] | 269 |
|
---|
[1311] | 270 | const long startTime = GetTime();
|
---|
[1308] | 271 | cout << "Constructing view space / object space tree ... \n";
|
---|
[1237] | 272 |
|
---|
[1379] | 273 | // compute view space bounding box
|
---|
| 274 | mVspTree->ComputeBoundingBox(sampleRays, forcedViewSpace);
|
---|
| 275 |
|
---|
[1323] | 276 | // use objects for evaluating vsp tree construction in the first levels
|
---|
| 277 | // of the subdivision
|
---|
| 278 | mSavedObjectSpaceSubdivisionType = mObjectSpaceSubdivisionType;
|
---|
| 279 | mObjectSpaceSubdivisionType = NO_OBJ_SUBDIV;
|
---|
| 280 |
|
---|
[1370] | 281 | mSavedViewSpaceSubdivisionType = mViewSpaceSubdivisionType;
|
---|
| 282 | mViewSpaceSubdivisionType = NO_VIEWSPACE_SUBDIV;
|
---|
| 283 |
|
---|
[1323] | 284 | // start with view space subdivison: prepare vsp tree for traversal
|
---|
[1329] | 285 | if (StartViewSpaceSubdivision())
|
---|
| 286 | {
|
---|
| 287 | mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
|
---|
[1379] | 288 | PrepareViewSpaceSubdivision(sampleRays, objects);
|
---|
[1329] | 289 | }
|
---|
| 290 |
|
---|
[1323] | 291 | // start object space subdivision immediately?
|
---|
| 292 | if (StartObjectSpaceSubdivision())
|
---|
| 293 | {
|
---|
| 294 | mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;
|
---|
| 295 | PrepareObjectSpaceSubdivision(sampleRays, objects);
|
---|
| 296 | }
|
---|
| 297 |
|
---|
[1294] | 298 | // process object space candidates
|
---|
[1449] | 299 | RunConstruction(mRepairQueue, sampleRays, objects, forcedViewSpace);
|
---|
[1308] | 300 |
|
---|
[1418] | 301 | cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;
|
---|
[1370] | 302 |
|
---|
[1563] | 303 | /*#if _DEBUG
|
---|
[1420] | 304 | cout << "view space: " << GetViewSpaceBox() << endl;
|
---|
| 305 | cout << "object space: " << GetObjectSpaceBox() << endl;
|
---|
[1563] | 306 | #endif*/
|
---|
[1420] | 307 |
|
---|
[1548] | 308 | mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;
|
---|
| 309 | mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
|
---|
| 310 |
|
---|
[1313] | 311 | mHierarchyStats.Stop();
|
---|
[1259] | 312 | mVspTree->mVspStats.Stop();
|
---|
[1418] | 313 | FinishObjectSpaceSubdivision(objects);
|
---|
[1237] | 314 | }
|
---|
| 315 |
|
---|
| 316 |
|
---|
[1311] | 317 | void HierarchyManager::PrepareViewSpaceSubdivision(const VssRayContainer &sampleRays,
|
---|
[1379] | 318 | const ObjectContainer &objects)
|
---|
[1311] | 319 | {
|
---|
[1486] | 320 | cout << "\nstarting view space hierarchy construction ... " << endl;
|
---|
[1548] | 321 | // hack: reset global cost misses
|
---|
| 322 | mHierarchyStats.mGlobalCostMisses = 0;
|
---|
[1370] | 323 |
|
---|
[1311] | 324 | RayInfoContainer *viewSpaceRays = new RayInfoContainer();
|
---|
| 325 | SubdivisionCandidate *vsc =
|
---|
[1379] | 326 | mVspTree->PrepareConstruction(sampleRays, *viewSpaceRays);
|
---|
[1311] | 327 |
|
---|
[1421] | 328 | mTotalCost = mVspTree->mTotalCost;
|
---|
| 329 | Debug << "\nreseting cost, new total cost: " << mTotalCost << endl;
|
---|
| 330 |
|
---|
[1311] | 331 | mTQueue.Push(vsc);
|
---|
| 332 | }
|
---|
| 333 |
|
---|
| 334 |
|
---|
[1308] | 335 | void HierarchyManager::PrepareObjectSpaceSubdivision(const VssRayContainer &sampleRays,
|
---|
| 336 | const ObjectContainer &objects)
|
---|
| 337 | {
|
---|
[1522] | 338 | mHierarchyStats.mGlobalCostMisses = 0; // hack: reset global cost misses
|
---|
| 339 |
|
---|
[1308] | 340 | if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
|
---|
| 341 | {
|
---|
| 342 | PrepareOspTree(sampleRays, objects);
|
---|
| 343 | }
|
---|
| 344 | else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
|
---|
| 345 | {
|
---|
| 346 | PrepareBvHierarchy(sampleRays, objects);
|
---|
| 347 | }
|
---|
| 348 | }
|
---|
[1294] | 349 |
|
---|
[1308] | 350 |
|
---|
| 351 | void HierarchyManager::PrepareBvHierarchy(const VssRayContainer &sampleRays,
|
---|
| 352 | const ObjectContainer &objects)
|
---|
| 353 |
|
---|
[1294] | 354 | {
|
---|
[1421] | 355 | const long startTime = GetTime();
|
---|
| 356 |
|
---|
| 357 | cout << "preparing bv hierarchy construction ... " << endl;
|
---|
[1548] | 358 |
|
---|
[1294] | 359 | // compute first candidate
|
---|
| 360 | SubdivisionCandidate *sc =
|
---|
| 361 | mBvHierarchy->PrepareConstruction(sampleRays, objects);
|
---|
| 362 |
|
---|
| 363 | mTotalCost = mBvHierarchy->mTotalCost;
|
---|
[1415] | 364 | Debug << "\nreseting cost, new total cost: " << mTotalCost << endl;
|
---|
[1294] | 365 |
|
---|
[1308] | 366 | mTQueue.Push(sc);
|
---|
[1548] | 367 | cout << "finished bv hierarchy preparation in "
|
---|
| 368 | << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;
|
---|
[1294] | 369 | }
|
---|
| 370 |
|
---|
| 371 |
|
---|
[1308] | 372 | void HierarchyManager::PrepareOspTree(const VssRayContainer &sampleRays,
|
---|
| 373 | const ObjectContainer &objects)
|
---|
[1294] | 374 | {
|
---|
[1370] | 375 | cout << "starting osp tree construction ... " << endl;
|
---|
| 376 |
|
---|
[1294] | 377 | RayInfoContainer *objectSpaceRays = new RayInfoContainer();
|
---|
| 378 |
|
---|
| 379 | // start with one big kd cell - all objects can be seen from everywhere
|
---|
| 380 | // note: only true for view space = object space
|
---|
| 381 |
|
---|
| 382 | // compute first candidate
|
---|
| 383 | SubdivisionCandidate *osc =
|
---|
| 384 | mOspTree->PrepareConstruction(sampleRays, objects, *objectSpaceRays);
|
---|
| 385 |
|
---|
| 386 | mTotalCost = mOspTree->mTotalCost;
|
---|
[1421] | 387 | Debug << "\nreseting cost, new total cost: " << mTotalCost << endl;
|
---|
[1294] | 388 |
|
---|
| 389 | mTQueue.Push(osc);
|
---|
| 390 | }
|
---|
| 391 |
|
---|
| 392 |
|
---|
[1287] | 393 | bool HierarchyManager::ApplySubdivisionCandidate(SubdivisionCandidate *sc)
|
---|
[1237] | 394 | {
|
---|
[1293] | 395 | const bool globalTerminationCriteriaMet = GlobalTerminationCriteriaMet(sc);
|
---|
[1237] | 396 | const bool vspSplit = (sc->Type() == SubdivisionCandidate::VIEW_SPACE);
|
---|
| 397 |
|
---|
[1444] | 398 | if (!globalTerminationCriteriaMet)
|
---|
| 399 | {
|
---|
| 400 | // cost ratio of cost decrease / totalCost
|
---|
| 401 | const float costRatio = mCurrentCandidate->GetRenderCostDecrease() / mTotalCost;
|
---|
[1522] | 402 | //Debug << "ratio: " << costRatio << " min ratio: " << mTermMinGlobalCostRatio << endl;
|
---|
[1444] | 403 |
|
---|
| 404 | if (costRatio < mTermMinGlobalCostRatio)
|
---|
| 405 | {
|
---|
[1449] | 406 | ++ mHierarchyStats.mGlobalCostMisses;
|
---|
[1444] | 407 | }
|
---|
| 408 |
|
---|
| 409 | mTotalCost -= mCurrentCandidate->GetRenderCostDecrease();
|
---|
| 410 | }
|
---|
| 411 |
|
---|
[1237] | 412 | if (vspSplit)
|
---|
| 413 | {
|
---|
[1259] | 414 | VspNode *n = mVspTree->Subdivide(mTQueue, sc, globalTerminationCriteriaMet);
|
---|
[1288] | 415 |
|
---|
| 416 | if (n->IsLeaf()) // local or global termination criteria failed
|
---|
| 417 | return false;
|
---|
[1237] | 418 | }
|
---|
| 419 | else
|
---|
| 420 | {
|
---|
[1308] | 421 | if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
|
---|
[1287] | 422 | {
|
---|
| 423 | KdNode *n = mOspTree->Subdivide(mTQueue, sc, globalTerminationCriteriaMet);
|
---|
[1416] | 424 | // local or global termination criteria failed
|
---|
| 425 | if (n->IsLeaf())
|
---|
[1288] | 426 | return false;
|
---|
[1287] | 427 | }
|
---|
[1308] | 428 | else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
|
---|
[1287] | 429 | {
|
---|
| 430 | BvhNode *n = mBvHierarchy->Subdivide(mTQueue, sc, globalTerminationCriteriaMet);
|
---|
[1416] | 431 | // local or global termination criteria failed
|
---|
| 432 | if (n->IsLeaf())
|
---|
[1288] | 433 | return false;
|
---|
[1287] | 434 | }
|
---|
[1237] | 435 | }
|
---|
[1415] | 436 |
|
---|
[1416] | 437 | return true;
|
---|
[1237] | 438 | }
|
---|
| 439 |
|
---|
| 440 |
|
---|
[1370] | 441 | int HierarchyManager::GetObjectSpaceSubdivisionDepth() const
|
---|
| 442 | {
|
---|
| 443 | int maxDepth = 0;
|
---|
| 444 |
|
---|
| 445 | if (mObjectSpaceSubdivisionType == KD_BASED_OBJ_SUBDIV)
|
---|
| 446 | {
|
---|
| 447 | maxDepth = mOspTree->mOspStats.maxDepth;
|
---|
| 448 | }
|
---|
| 449 | else if (mObjectSpaceSubdivisionType == BV_BASED_OBJ_SUBDIV)
|
---|
| 450 | {
|
---|
| 451 | maxDepth = mBvHierarchy->mBvhStats.maxDepth;
|
---|
| 452 | }
|
---|
| 453 |
|
---|
| 454 | return maxDepth;
|
---|
| 455 | }
|
---|
| 456 |
|
---|
| 457 |
|
---|
[1308] | 458 | bool HierarchyManager::StartObjectSpaceSubdivision() const
|
---|
[1237] | 459 | {
|
---|
[1370] | 460 | // view space construction already started
|
---|
| 461 | if (ObjectSpaceSubdivisionConstructed())
|
---|
| 462 | return false;
|
---|
| 463 |
|
---|
| 464 | // start immediately with object space subdivision?
|
---|
| 465 | if (mStartWithObjectSpace)
|
---|
| 466 | return true;
|
---|
| 467 |
|
---|
| 468 | // is the queue empty again?
|
---|
| 469 | if (ViewSpaceSubdivisionConstructed() && mTQueue.Empty())
|
---|
| 470 | return true;
|
---|
| 471 |
|
---|
| 472 | // has the depth for subdivision been reached?
|
---|
| 473 | return
|
---|
| 474 | ((mConstructionType == INTERLEAVED) &&
|
---|
| 475 | (mMinDepthForObjectSpaceSubdivion <= mVspTree->mVspStats.maxDepth));
|
---|
[1308] | 476 | }
|
---|
| 477 |
|
---|
| 478 |
|
---|
[1329] | 479 | bool HierarchyManager::StartViewSpaceSubdivision() const
|
---|
| 480 | {
|
---|
[1370] | 481 | // view space construction already started
|
---|
| 482 | if (ViewSpaceSubdivisionConstructed())
|
---|
| 483 | return false;
|
---|
| 484 |
|
---|
| 485 | // start immediately with view space subdivision?
|
---|
| 486 | if (!mStartWithObjectSpace)
|
---|
| 487 | return true;
|
---|
| 488 |
|
---|
| 489 | // is the queue empty again?
|
---|
| 490 | if (ObjectSpaceSubdivisionConstructed() && mTQueue.Empty())
|
---|
| 491 | return true;
|
---|
| 492 |
|
---|
| 493 | // has the depth for subdivision been reached?
|
---|
| 494 | return
|
---|
| 495 | ((mConstructionType == INTERLEAVED) &&
|
---|
| 496 | (mMinDepthForViewSpaceSubdivion <= GetObjectSpaceSubdivisionDepth()));
|
---|
[1329] | 497 | }
|
---|
| 498 |
|
---|
| 499 |
|
---|
[1449] | 500 | void HierarchyManager::RunConstruction(const bool repairQueue,
|
---|
| 501 | const VssRayContainer &sampleRays,
|
---|
[1311] | 502 | const ObjectContainer &objects,
|
---|
| 503 | AxisAlignedBox3 *forcedViewSpace)
|
---|
[1308] | 504 | {
|
---|
[1313] | 505 | int i = 0;
|
---|
| 506 | while (!FinishedConstruction())
|
---|
| 507 | {
|
---|
[1305] | 508 | mCurrentCandidate = NextSubdivisionCandidate();
|
---|
[1444] | 509 |
|
---|
[1415] | 510 | ///////////////////
|
---|
[1237] | 511 | //-- subdivide leaf node
|
---|
[1415] | 512 |
|
---|
[1294] | 513 | if (ApplySubdivisionCandidate(mCurrentCandidate))
|
---|
[1237] | 514 | {
|
---|
[1415] | 515 | cout << mCurrentCandidate->Type() << " ";
|
---|
[1576] | 516 |
|
---|
| 517 | // update stats
|
---|
[1288] | 518 | mHierarchyStats.nodes += 2;
|
---|
[1576] | 519 | mHierarchyStats.pvsEntries += mCurrentCandidate->GetPvsEntriesIncr();
|
---|
| 520 | mHierarchyStats.memory += 0; // TODO
|
---|
[1237] | 521 | // subdivision successful
|
---|
[1294] | 522 | EvalSubdivisionStats(*mCurrentCandidate);
|
---|
[1237] | 523 |
|
---|
[1305] | 524 | // reevaluate candidates affected by the split for view space splits,
|
---|
| 525 | // this would be object space splits and other way round
|
---|
[1576] | 526 | if (repairQueue)
|
---|
| 527 | {
|
---|
| 528 | RepairQueue();
|
---|
| 529 | }
|
---|
[1311] | 530 | }
|
---|
| 531 |
|
---|
[1313] | 532 | // we use objects for evaluating vsp tree construction until
|
---|
[1415] | 533 | // a certain depth once a certain depth existiert ...
|
---|
[1313] | 534 | if (StartObjectSpaceSubdivision())
|
---|
| 535 | {
|
---|
[1323] | 536 | mObjectSpaceSubdivisionType = mSavedObjectSpaceSubdivisionType;
|
---|
[1314] | 537 |
|
---|
[1415] | 538 | cout << "\nstarting object space subdivision at depth "
|
---|
[1329] | 539 | << mVspTree->mVspStats.maxDepth << " ("
|
---|
| 540 | << mMinDepthForObjectSpaceSubdivion << ") " << endl;
|
---|
| 541 |
|
---|
[1314] | 542 | PrepareObjectSpaceSubdivision(sampleRays, objects);
|
---|
| 543 |
|
---|
[1313] | 544 | cout << "reseting queue ... ";
|
---|
| 545 | ResetQueue();
|
---|
| 546 | cout << "finished" << endl;
|
---|
| 547 | }
|
---|
| 548 |
|
---|
[1329] | 549 | if (StartViewSpaceSubdivision())
|
---|
| 550 | {
|
---|
| 551 | mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
|
---|
| 552 |
|
---|
[1415] | 553 | cout << "\nstarting view space subdivision at depth "
|
---|
[1370] | 554 | << GetObjectSpaceSubdivisionDepth() << " ("
|
---|
| 555 | << mMinDepthForViewSpaceSubdivion << ") " << endl;
|
---|
[1329] | 556 |
|
---|
[1379] | 557 | PrepareViewSpaceSubdivision(sampleRays, objects);
|
---|
[1329] | 558 |
|
---|
| 559 | cout << "reseting queue ... ";
|
---|
| 560 | ResetQueue();
|
---|
| 561 | cout << "finished" << endl;
|
---|
| 562 | }
|
---|
| 563 |
|
---|
[1294] | 564 | DEL_PTR(mCurrentCandidate);
|
---|
[1237] | 565 | }
|
---|
| 566 | }
|
---|
| 567 |
|
---|
| 568 |
|
---|
[1449] | 569 |
|
---|
| 570 | void HierarchyManager::RunConstruction(const bool repairQueue)
|
---|
| 571 | {
|
---|
| 572 | int i = 0;
|
---|
| 573 | while (!FinishedConstruction())
|
---|
| 574 | {
|
---|
| 575 | mCurrentCandidate = NextSubdivisionCandidate();
|
---|
| 576 |
|
---|
| 577 | ///////////////////
|
---|
| 578 | //-- subdivide leaf node
|
---|
| 579 |
|
---|
| 580 | if (ApplySubdivisionCandidate(mCurrentCandidate))
|
---|
| 581 | {
|
---|
| 582 | cout << mCurrentCandidate->Type() << " ";
|
---|
| 583 | if (0) cout << "subdividing candidate " << ++ i << " of type "
|
---|
| 584 | << mCurrentCandidate->Type() << endl;
|
---|
| 585 | mHierarchyStats.nodes += 2;
|
---|
| 586 |
|
---|
| 587 | // subdivision successful
|
---|
| 588 | EvalSubdivisionStats(*mCurrentCandidate);
|
---|
| 589 |
|
---|
| 590 | // reevaluate candidates affected by the split for view space splits,
|
---|
| 591 | // this would be object space splits and other way round
|
---|
| 592 | if (repairQueue) RepairQueue();
|
---|
| 593 | }
|
---|
| 594 |
|
---|
| 595 | DEL_PTR(mCurrentCandidate);
|
---|
| 596 | }
|
---|
| 597 | }
|
---|
| 598 |
|
---|
| 599 |
|
---|
[1548] | 600 | void HierarchyManager::ResetObjectSpaceSubdivision(const VssRayContainer &sampleRays,
|
---|
| 601 | const ObjectContainer &objects)
|
---|
[1449] | 602 | {
|
---|
[1548] | 603 | #if 0
|
---|
| 604 | DEL_PTR(mBvHierarchy);
|
---|
| 605 | mBvHierarchy = new BvHierarchy();
|
---|
| 606 | mBvHierarchy->mHierarchyManager = this;
|
---|
| 607 |
|
---|
| 608 | PrepareObjectSpaceSubdivision(sampleRays, objects);
|
---|
[1557] | 609 | return;
|
---|
[1548] | 610 | #endif
|
---|
[1557] | 611 |
|
---|
| 612 | if (!ObjectSpaceSubdivisionConstructed())
|
---|
| 613 | {
|
---|
| 614 | return PrepareObjectSpaceSubdivision(sampleRays, objects);
|
---|
| 615 | }
|
---|
| 616 |
|
---|
| 617 | switch (mObjectSpaceSubdivisionType)
|
---|
| 618 | {
|
---|
| 619 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 620 | cout << "\nreseting bv hierarchy" << endl;
|
---|
| 621 | Debug << "old bv hierarchy:\n " << mBvHierarchy->mBvhStats << endl;
|
---|
| 622 |
|
---|
| 623 | mHierarchyStats.nodes -= mBvHierarchy->mBvhStats.nodes;
|
---|
| 624 | mTQueue.Push(mBvHierarchy->Reset(sampleRays, objects));
|
---|
| 625 | mTotalCost = mBvHierarchy->mTotalCost;
|
---|
[1548] | 626 | break;
|
---|
[1557] | 627 |
|
---|
[1548] | 628 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 629 | // TODO
|
---|
| 630 | break;
|
---|
| 631 | default:
|
---|
| 632 | break;
|
---|
| 633 | }
|
---|
[1449] | 634 | }
|
---|
| 635 |
|
---|
| 636 |
|
---|
[1557] | 637 | void HierarchyManager::ResetViewSpaceSubdivision(const VssRayContainer &sampleRays,
|
---|
| 638 | const ObjectContainer &objects)
|
---|
| 639 | {
|
---|
| 640 | DEL_PTR(mBvHierarchy);
|
---|
| 641 | mBvHierarchy = new BvHierarchy();
|
---|
| 642 | mBvHierarchy->mHierarchyManager = this;
|
---|
| 643 |
|
---|
| 644 | PrepareViewSpaceSubdivision(sampleRays, objects);
|
---|
| 645 | return;
|
---|
| 646 | }
|
---|
| 647 |
|
---|
| 648 |
|
---|
[1449] | 649 | void HierarchyManager::ConstructMultiLevel(const VssRayContainer &sampleRays,
|
---|
| 650 | const ObjectContainer &objects,
|
---|
| 651 | AxisAlignedBox3 *forcedViewSpace)
|
---|
| 652 | {
|
---|
| 653 | mHierarchyStats.Reset();
|
---|
| 654 | mHierarchyStats.Start();
|
---|
| 655 | mHierarchyStats.nodes = 2;
|
---|
| 656 |
|
---|
| 657 | mTotalCost = (float)objects.size();
|
---|
| 658 | Debug << "setting total cost to " << mTotalCost << endl;
|
---|
| 659 |
|
---|
| 660 | const long startTime = GetTime();
|
---|
| 661 | cout << "Constructing view space / object space tree ... \n";
|
---|
| 662 |
|
---|
| 663 | // compute view space bounding box
|
---|
| 664 | mVspTree->ComputeBoundingBox(sampleRays, forcedViewSpace);
|
---|
| 665 |
|
---|
| 666 | // use sah for evaluating object space construction for the first run
|
---|
| 667 | mSavedViewSpaceSubdivisionType = mViewSpaceSubdivisionType;
|
---|
| 668 | mViewSpaceSubdivisionType = NO_VIEWSPACE_SUBDIV;
|
---|
| 669 |
|
---|
[1557] | 670 | const int limit = 4;
|
---|
| 671 | int i = 0;
|
---|
[1449] | 672 |
|
---|
[1557] | 673 | // render cost optimization
|
---|
| 674 | // start with object space partiton
|
---|
| 675 | // then optimizate view space partition for the current osp
|
---|
| 676 | // and vice versa until iteration depth is reached.
|
---|
| 677 | while (1)
|
---|
[1548] | 678 | {
|
---|
[1557] | 679 | // first run object space subdivision
|
---|
[1548] | 680 | ResetObjectSpaceSubdivision(sampleRays, objects);
|
---|
[1557] | 681 |
|
---|
[1548] | 682 | // process object space candidates
|
---|
| 683 | RunConstruction(false);
|
---|
[1449] | 684 |
|
---|
[1557] | 685 | if ((++ i) >= limit)
|
---|
| 686 | break;
|
---|
| 687 |
|
---|
| 688 | /////////////////
|
---|
| 689 | // do view space subdivison with respect to the object space partition
|
---|
| 690 | ResetViewSpaceSubdivision(sampleRays, objects);
|
---|
| 691 |
|
---|
[1548] | 692 | // process view space candidates
|
---|
| 693 | RunConstruction(false);
|
---|
[1557] | 694 | mViewSpaceSubdivisionType = mSavedViewSpaceSubdivisionType;
|
---|
| 695 |
|
---|
| 696 | if ((++ i) >= limit)
|
---|
| 697 | break;
|
---|
| 698 |
|
---|
| 699 | cout << "iteration " << i << " of " << limit << " finished" << endl;
|
---|
[1548] | 700 | }
|
---|
| 701 |
|
---|
[1449] | 702 | cout << "\nfinished in " << TimeDiff(startTime, GetTime()) * 1e-3 << " secs" << endl;
|
---|
| 703 |
|
---|
[1563] | 704 | /*#if _DEBUG
|
---|
[1449] | 705 | cout << "view space: " << GetViewSpaceBox() << endl;
|
---|
| 706 | cout << "object space: " << GetObjectSpaceBox() << endl;
|
---|
[1563] | 707 | #endif*/
|
---|
[1449] | 708 |
|
---|
| 709 | mHierarchyStats.Stop();
|
---|
| 710 | mVspTree->mVspStats.Stop();
|
---|
| 711 | FinishObjectSpaceSubdivision(objects);
|
---|
| 712 | }
|
---|
| 713 |
|
---|
| 714 |
|
---|
[1237] | 715 | bool HierarchyManager::FinishedConstruction() const
|
---|
| 716 | {
|
---|
| 717 | return mTQueue.Empty();
|
---|
| 718 | }
|
---|
| 719 |
|
---|
| 720 |
|
---|
[1313] | 721 | bool HierarchyManager::ObjectSpaceSubdivisionConstructed() const
|
---|
[1311] | 722 | {
|
---|
| 723 | switch (mObjectSpaceSubdivisionType)
|
---|
| 724 | {
|
---|
| 725 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 726 | return mOspTree && mOspTree->GetRoot();
|
---|
| 727 | case BV_BASED_OBJ_SUBDIV:
|
---|
[1344] | 728 | return mBvHierarchy && mBvHierarchy->GetRoot();
|
---|
[1311] | 729 | default:
|
---|
| 730 | return false;
|
---|
| 731 | }
|
---|
| 732 | }
|
---|
| 733 |
|
---|
| 734 |
|
---|
[1329] | 735 | bool HierarchyManager::ViewSpaceSubdivisionConstructed() const
|
---|
| 736 | {
|
---|
| 737 | return mVspTree && mVspTree->GetRoot();
|
---|
| 738 | }
|
---|
| 739 |
|
---|
| 740 |
|
---|
[1294] | 741 | void HierarchyManager::CollectObjectSpaceDirtyList(SubdivisionCandidateContainer &dirtyList)
|
---|
[1259] | 742 | {
|
---|
[1308] | 743 | switch (mObjectSpaceSubdivisionType)
|
---|
[1259] | 744 | {
|
---|
| 745 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 746 | {
|
---|
| 747 | OspTree::OspSubdivisionCandidate *sc =
|
---|
| 748 | dynamic_cast<OspTree::OspSubdivisionCandidate *>(mCurrentCandidate);
|
---|
| 749 |
|
---|
| 750 | mOspTree->CollectDirtyCandidates(sc, dirtyList);
|
---|
| 751 | break;
|
---|
| 752 | }
|
---|
| 753 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 754 | {
|
---|
| 755 | BvHierarchy::BvhSubdivisionCandidate *sc =
|
---|
| 756 | dynamic_cast<BvHierarchy::BvhSubdivisionCandidate *>(mCurrentCandidate);
|
---|
| 757 |
|
---|
| 758 | mBvHierarchy->CollectDirtyCandidates(sc, dirtyList);
|
---|
| 759 | break;
|
---|
| 760 | }
|
---|
| 761 | default:
|
---|
| 762 | break;
|
---|
| 763 | }
|
---|
| 764 | }
|
---|
| 765 |
|
---|
| 766 |
|
---|
| 767 | void HierarchyManager::CollectViewSpaceDirtyList(SubdivisionCandidateContainer &dirtyList)
|
---|
| 768 | {
|
---|
| 769 | VspTree::VspSubdivisionCandidate *sc =
|
---|
| 770 | dynamic_cast<VspTree::VspSubdivisionCandidate *>(mCurrentCandidate);
|
---|
| 771 |
|
---|
| 772 | mVspTree->CollectDirtyCandidates(sc, dirtyList);
|
---|
| 773 | }
|
---|
| 774 |
|
---|
| 775 |
|
---|
| 776 | void HierarchyManager::CollectDirtyCandidates(SubdivisionCandidateContainer &dirtyList)
|
---|
[1302] | 777 | {
|
---|
[1237] | 778 | // we have either a object space or view space split
|
---|
| 779 | if (mCurrentCandidate->Type() == SubdivisionCandidate::VIEW_SPACE)
|
---|
| 780 | {
|
---|
[1259] | 781 | CollectViewSpaceDirtyList(dirtyList);
|
---|
[1237] | 782 | }
|
---|
| 783 | else // object space split
|
---|
[1305] | 784 | {
|
---|
[1259] | 785 | CollectObjectSpaceDirtyList(dirtyList);
|
---|
[1237] | 786 | }
|
---|
| 787 | }
|
---|
| 788 |
|
---|
| 789 |
|
---|
| 790 | void HierarchyManager::RepairQueue()
|
---|
| 791 | {
|
---|
| 792 | // for each update of the view space partition:
|
---|
| 793 | // the candidates from object space partition which
|
---|
| 794 | // have been afected by the view space split (the kd split candidates
|
---|
| 795 | // which saw the view cell which was split) must be reevaluated
|
---|
| 796 | // (maybe not locally, just reinsert them into the queue)
|
---|
| 797 | //
|
---|
| 798 | // vice versa for the view cells
|
---|
| 799 | // for each update of the object space partition
|
---|
| 800 | // reevaluate split candidate for view cells which saw the split kd cell
|
---|
| 801 | //
|
---|
| 802 | // the priority queue update can be solved by implementing a binary heap
|
---|
| 803 | // (explicit data structure, binary tree)
|
---|
| 804 | // *) inserting and removal is efficient
|
---|
| 805 | // *) search is not efficient => store queue position with each
|
---|
| 806 | // split candidate
|
---|
| 807 |
|
---|
| 808 | // collect list of "dirty" candidates
|
---|
[1313] | 809 | long startTime = GetTime();
|
---|
| 810 |
|
---|
[1237] | 811 | vector<SubdivisionCandidate *> dirtyList;
|
---|
| 812 | CollectDirtyCandidates(dirtyList);
|
---|
[1415] | 813 | if (0) cout << "repairing " << (int)dirtyList.size() << " candidates ... ";
|
---|
[1313] | 814 |
|
---|
[1415] | 815 | /////////////////////////////////
|
---|
[1305] | 816 | //-- reevaluate the dirty list
|
---|
[1415] | 817 |
|
---|
[1313] | 818 | SubdivisionCandidateContainer::const_iterator sit, sit_end = dirtyList.end();
|
---|
[1302] | 819 |
|
---|
[1237] | 820 | for (sit = dirtyList.begin(); sit != sit_end; ++ sit)
|
---|
| 821 | {
|
---|
| 822 | SubdivisionCandidate* sc = *sit;
|
---|
[1305] | 823 | const float rcd = sc->GetRenderCostDecrease();
|
---|
[1302] | 824 |
|
---|
| 825 | mTQueue.Erase(sc); // erase from queue
|
---|
| 826 | sc->EvalPriority(); // reevaluate
|
---|
| 827 |
|
---|
[1305] | 828 | /*
|
---|
| 829 | Debug << "candidate " << sc << " reevaluated\n"
|
---|
| 830 | << "render cost decrease diff " << rcd - sc->GetRenderCostDecrease()
|
---|
| 831 | << " old: " << rcd << " new " << sc->GetRenderCostDecrease() << endl;*/
|
---|
| 832 | if (0)
|
---|
| 833 | {
|
---|
| 834 | const float rcDiff = rcd - sc->GetRenderCostDecrease();
|
---|
| 835 | mTotalCost += rcDiff;
|
---|
| 836 | }
|
---|
[1302] | 837 | mTQueue.Push(sc); // reinsert
|
---|
[1237] | 838 | }
|
---|
[1313] | 839 |
|
---|
| 840 | long endTime = GetTime();
|
---|
| 841 | Real timeDiff = TimeDiff(startTime, endTime);
|
---|
| 842 |
|
---|
| 843 | mHierarchyStats.repairTime += timeDiff;
|
---|
| 844 |
|
---|
[1415] | 845 | if (0) cout << "finished in " << timeDiff * 1e-3f << " secs" << endl;
|
---|
[1237] | 846 | }
|
---|
| 847 |
|
---|
[1259] | 848 |
|
---|
[1313] | 849 | void HierarchyManager::ResetQueue()
|
---|
| 850 | {
|
---|
| 851 | SubdivisionCandidateContainer mCandidateBuffer;
|
---|
| 852 |
|
---|
| 853 | // remove from queue
|
---|
| 854 | while (!mTQueue.Empty())
|
---|
| 855 | {
|
---|
| 856 | SubdivisionCandidate *candidate = NextSubdivisionCandidate();
|
---|
| 857 | candidate->EvalPriority(); // reevaluate
|
---|
| 858 | cout << ".";
|
---|
| 859 | mCandidateBuffer.push_back(candidate);
|
---|
| 860 | }
|
---|
| 861 |
|
---|
| 862 | // put back into queue
|
---|
| 863 | SubdivisionCandidateContainer::const_iterator sit, sit_end = mCandidateBuffer.end();
|
---|
| 864 | for (sit = mCandidateBuffer.begin(); sit != sit_end; ++ sit)
|
---|
| 865 | {cout << ":";
|
---|
| 866 | mTQueue.Push(*sit);
|
---|
| 867 | }
|
---|
| 868 | }
|
---|
| 869 |
|
---|
| 870 |
|
---|
[1279] | 871 | void HierarchyManager::ExportObjectSpaceHierarchy(OUT_STREAM &stream)
|
---|
| 872 | {
|
---|
| 873 | // the type of the view cells hierarchy
|
---|
[1308] | 874 | switch (mObjectSpaceSubdivisionType)
|
---|
[1279] | 875 | {
|
---|
| 876 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 877 | stream << "<ObjectSpaceHierarchy type=\"osp\">" << endl;
|
---|
| 878 | mOspTree->Export(stream);
|
---|
| 879 | stream << endl << "</ObjectSpaceHierarchy>" << endl;
|
---|
[1305] | 880 | break;
|
---|
[1279] | 881 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 882 | stream << "<ObjectSpaceHierarchy type=\"bvh\">" << endl;
|
---|
| 883 | mBvHierarchy->Export(stream);
|
---|
| 884 | stream << endl << "</ObjectSpaceHierarchy>" << endl;
|
---|
| 885 | break;
|
---|
| 886 | }
|
---|
| 887 | }
|
---|
| 888 |
|
---|
| 889 |
|
---|
| 890 | bool HierarchyManager::AddSampleToPvs(Intersectable *obj,
|
---|
| 891 | const Vector3 &hitPoint,
|
---|
| 892 | ViewCell *vc,
|
---|
| 893 | const float pdf,
|
---|
| 894 | float &contribution) const
|
---|
| 895 | {
|
---|
| 896 | if (!obj) return false;
|
---|
| 897 |
|
---|
[1308] | 898 | switch (mObjectSpaceSubdivisionType)
|
---|
[1279] | 899 | {
|
---|
| 900 | case NO_OBJ_SUBDIV:
|
---|
[1486] | 901 | {
|
---|
| 902 | // potentially visible objects
|
---|
| 903 | return vc->AddPvsSample(obj, pdf, contribution);
|
---|
| 904 | }
|
---|
[1279] | 905 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 906 | {
|
---|
| 907 | // potentially visible kd cells
|
---|
| 908 | KdLeaf *leaf = mOspTree->GetLeaf(hitPoint/*ray->mOriginNode*/);
|
---|
| 909 | return mOspTree->AddLeafToPvs(leaf, vc, pdf, contribution);
|
---|
| 910 | }
|
---|
| 911 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 912 | {
|
---|
| 913 | BvhLeaf *leaf = mBvHierarchy->GetLeaf(obj);
|
---|
[1370] | 914 | BvhIntersectable *bvhObj = mBvHierarchy->GetOrCreateBvhIntersectable(leaf);
|
---|
| 915 |
|
---|
| 916 | return vc->AddPvsSample(bvhObj, pdf, contribution);
|
---|
[1279] | 917 | }
|
---|
| 918 | default:
|
---|
| 919 | return false;
|
---|
| 920 | }
|
---|
| 921 | }
|
---|
| 922 |
|
---|
| 923 |
|
---|
[1421] | 924 | void HierarchyManager::PrintHierarchyStatistics(ostream &stream) const
|
---|
[1279] | 925 | {
|
---|
[1313] | 926 | stream << mHierarchyStats << endl;
|
---|
| 927 | stream << "\nview space:" << endl << endl;
|
---|
| 928 | stream << mVspTree->GetStatistics() << endl;
|
---|
| 929 | stream << "\nobject space:" << endl << endl;
|
---|
[1370] | 930 |
|
---|
[1308] | 931 | switch (mObjectSpaceSubdivisionType)
|
---|
[1279] | 932 | {
|
---|
| 933 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 934 | {
|
---|
[1313] | 935 | stream << mOspTree->GetStatistics() << endl;
|
---|
[1279] | 936 | break;
|
---|
| 937 | }
|
---|
| 938 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 939 | {
|
---|
[1313] | 940 | stream << mBvHierarchy->GetStatistics() << endl;
|
---|
[1279] | 941 | break;
|
---|
| 942 | }
|
---|
| 943 | default:
|
---|
| 944 | break;
|
---|
| 945 | }
|
---|
| 946 | }
|
---|
| 947 |
|
---|
| 948 |
|
---|
[1287] | 949 | void HierarchyManager::ExportObjectSpaceHierarchy(Exporter *exporter,
|
---|
[1416] | 950 | const ObjectContainer &objects,
|
---|
[1418] | 951 | const AxisAlignedBox3 *bbox,
|
---|
| 952 | const bool exportBounds) const
|
---|
[1279] | 953 | {
|
---|
[1308] | 954 | switch (mObjectSpaceSubdivisionType)
|
---|
[1286] | 955 | {
|
---|
| 956 | case KD_BASED_OBJ_SUBDIV:
|
---|
[1279] | 957 | {
|
---|
[1287] | 958 | ExportOspTree(exporter, objects);
|
---|
[1286] | 959 | break;
|
---|
| 960 | }
|
---|
| 961 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 962 | {
|
---|
[1418] | 963 | exporter->ExportBvHierarchy(*mBvHierarchy, 0, bbox, exportBounds);
|
---|
[1286] | 964 | break;
|
---|
| 965 | }
|
---|
| 966 | default:
|
---|
| 967 | break;
|
---|
| 968 | }
|
---|
| 969 | }
|
---|
[1279] | 970 |
|
---|
[1286] | 971 |
|
---|
[1287] | 972 | void HierarchyManager::ExportOspTree(Exporter *exporter,
|
---|
| 973 | const ObjectContainer &objects) const
|
---|
[1286] | 974 | {
|
---|
[1287] | 975 | if (0) exporter->ExportGeometry(objects);
|
---|
[1279] | 976 |
|
---|
[1287] | 977 | exporter->SetWireframe();
|
---|
| 978 | exporter->ExportOspTree(*mOspTree, 0);
|
---|
[1286] | 979 | }
|
---|
| 980 |
|
---|
| 981 |
|
---|
[1418] | 982 | Intersectable *HierarchyManager::GetIntersectable(const VssRay &ray,
|
---|
| 983 | const bool isTermination) const
|
---|
| 984 | {
|
---|
| 985 |
|
---|
| 986 | Intersectable *obj;
|
---|
| 987 | Vector3 pt;
|
---|
| 988 | KdNode *node;
|
---|
| 989 |
|
---|
| 990 | ray.GetSampleData(isTermination, pt, &obj, &node);
|
---|
| 991 |
|
---|
| 992 | if (!obj) return NULL;
|
---|
| 993 |
|
---|
| 994 | switch (mObjectSpaceSubdivisionType)
|
---|
| 995 | {
|
---|
| 996 | case HierarchyManager::KD_BASED_OBJ_SUBDIV:
|
---|
| 997 | {
|
---|
| 998 | KdLeaf *leaf = mOspTree->GetLeaf(pt, node);
|
---|
| 999 | return mOspTree->GetOrCreateKdIntersectable(leaf);
|
---|
| 1000 | }
|
---|
| 1001 | case HierarchyManager::BV_BASED_OBJ_SUBDIV:
|
---|
| 1002 | {
|
---|
| 1003 | BvhLeaf *leaf = mBvHierarchy->GetLeaf(obj);
|
---|
| 1004 | return mBvHierarchy->GetOrCreateBvhIntersectable(leaf);
|
---|
| 1005 | }
|
---|
| 1006 | default:
|
---|
| 1007 | return obj;
|
---|
| 1008 | }
|
---|
| 1009 | }
|
---|
| 1010 |
|
---|
| 1011 |
|
---|
[1313] | 1012 | void HierarchyStatistics::Print(ostream &app) const
|
---|
| 1013 | {
|
---|
| 1014 | app << "=========== Hierarchy statistics ===============\n";
|
---|
| 1015 |
|
---|
| 1016 | app << setprecision(4);
|
---|
| 1017 |
|
---|
| 1018 | app << "#N_CTIME ( Construction time [s] )\n" << Time() << " \n";
|
---|
| 1019 |
|
---|
| 1020 | app << "#N_RTIME ( Repair time [s] )\n" << repairTime * 1e-3f << " \n";
|
---|
| 1021 |
|
---|
| 1022 | app << "#N_NODES ( Number of nodes )\n" << nodes << "\n";
|
---|
| 1023 |
|
---|
| 1024 | app << "#N_INTERIORS ( Number of interior nodes )\n" << Interior() << "\n";
|
---|
| 1025 |
|
---|
| 1026 | app << "#N_LEAVES ( Number of leaves )\n" << Leaves() << "\n";
|
---|
| 1027 |
|
---|
| 1028 | app << "#N_PMAXDEPTH ( Maximal reached depth )\n" << maxDepth << endl;
|
---|
[1449] | 1029 |
|
---|
| 1030 | app << "#N_GLOBALCOSTMISSES ( Global cost misses )\n" << mGlobalCostMisses << endl;
|
---|
[1313] | 1031 |
|
---|
| 1032 | app << "========== END OF Hierarchy statistics ==========\n";
|
---|
| 1033 | }
|
---|
| 1034 |
|
---|
| 1035 |
|
---|
[1418] | 1036 | static void RemoveRayRefs(const ObjectContainer &objects)
|
---|
[1370] | 1037 | {
|
---|
[1418] | 1038 | ObjectContainer::const_iterator oit, oit_end = objects.end();
|
---|
| 1039 | for (oit = objects.begin(); oit != oit_end; ++ oit)
|
---|
| 1040 | {
|
---|
| 1041 | (*oit)->mVssRays.clear();
|
---|
| 1042 | }
|
---|
| 1043 | }
|
---|
| 1044 |
|
---|
| 1045 |
|
---|
| 1046 | void HierarchyManager::FinishObjectSpaceSubdivision(const ObjectContainer &objects) const
|
---|
| 1047 | {
|
---|
[1370] | 1048 | switch (mObjectSpaceSubdivisionType)
|
---|
| 1049 | {
|
---|
| 1050 | case KD_BASED_OBJ_SUBDIV:
|
---|
| 1051 | {
|
---|
| 1052 | mOspTree->mOspStats.Stop();
|
---|
| 1053 | break;
|
---|
| 1054 | }
|
---|
| 1055 | case BV_BASED_OBJ_SUBDIV:
|
---|
| 1056 | {
|
---|
| 1057 | mBvHierarchy->mBvhStats.Stop();
|
---|
[1418] | 1058 | RemoveRayRefs(objects);
|
---|
[1370] | 1059 | break;
|
---|
| 1060 | }
|
---|
| 1061 | default:
|
---|
| 1062 | break;
|
---|
| 1063 | }
|
---|
| 1064 | }
|
---|
| 1065 |
|
---|
[1237] | 1066 | } |
---|