[1010] | 1 | #include <time.h>
|
---|
| 2 | #include <iomanip>
|
---|
| 3 | #include <stack>
|
---|
| 4 |
|
---|
| 5 |
|
---|
[235] | 6 | #include "ViewCell.h"
|
---|
| 7 | #include "Mesh.h"
|
---|
[308] | 8 | #include "Intersectable.h"
|
---|
[1121] | 9 | #include "KdTree.h"
|
---|
[235] | 10 | #include "Triangle3.h"
|
---|
[580] | 11 | #include "common.h"
|
---|
| 12 | #include "Environment.h"
|
---|
| 13 | #include "ViewCellsManager.h"
|
---|
| 14 | #include "Exporter.h"
|
---|
| 15 |
|
---|
[235] | 16 |
|
---|
[863] | 17 | namespace GtpVisibilityPreprocessor {
|
---|
[580] | 18 |
|
---|
| 19 |
|
---|
[955] | 20 |
|
---|
[580] | 21 | template <typename T> class myless
|
---|
| 22 | {
|
---|
| 23 | public:
|
---|
| 24 | bool operator() (T v1, T v2) const
|
---|
| 25 | {
|
---|
[600] | 26 | return (v1->GetMergeCost() < v2->GetMergeCost());
|
---|
[580] | 27 | }
|
---|
| 28 | };
|
---|
| 29 |
|
---|
| 30 |
|
---|
[1121] | 31 | typedef priority_queue<ViewCell *, vector<ViewCell *>,
|
---|
| 32 | myless<vector<ViewCell *>::value_type> > TraversalQueue;
|
---|
[580] | 33 |
|
---|
[1221] | 34 | int ViewCell::sMailId = 0;//21843194198;
|
---|
[580] | 35 | int ViewCell::sReservedMailboxes = 1;
|
---|
| 36 |
|
---|
[882] | 37 |
|
---|
[580] | 38 | float MergeCandidate::sRenderCostWeight = 0;
|
---|
| 39 |
|
---|
| 40 |
|
---|
| 41 | // pvs penalty can be different from pvs size
|
---|
[882] | 42 | inline static float EvalPvsPenalty(const int pvs,
|
---|
| 43 | const int lower,
|
---|
| 44 | const int upper)
|
---|
[580] | 45 | {
|
---|
| 46 | // clamp to minmax values
|
---|
[728] | 47 | if (pvs < lower)
|
---|
[580] | 48 | return (float)lower;
|
---|
| 49 | if (pvs > upper)
|
---|
| 50 | return (float)upper;
|
---|
[752] | 51 |
|
---|
[580] | 52 | return (float)pvs;
|
---|
| 53 | }
|
---|
| 54 |
|
---|
[1002] | 55 | /// Counts differences between pvss.
|
---|
[585] | 56 | inline int CountDiffPvs(ViewCell *vc)
|
---|
| 57 | {
|
---|
| 58 | int count = 0;
|
---|
| 59 |
|
---|
| 60 | ObjectPvsMap::const_iterator it, it_end = vc->GetPvs().mEntries.end();
|
---|
| 61 | for (it = vc->GetPvs().mEntries.begin(); it != it_end; ++ it)
|
---|
| 62 | {
|
---|
| 63 | if (!(*it).first->Mailed())
|
---|
| 64 | {
|
---|
| 65 | (*it).first->Mail();
|
---|
| 66 | ++ count;
|
---|
| 67 | }
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 | return count;
|
---|
| 71 | }
|
---|
| 72 |
|
---|
[1233] | 73 |
|
---|
[729] | 74 | /// Fast computation of merged pvs size
|
---|
[752] | 75 | static int ComputeMergedPvsSize(const ObjectPvs &pvs1, const ObjectPvs &pvs2)
|
---|
[580] | 76 | {
|
---|
[729] | 77 | // add first pvs
|
---|
[580] | 78 | int pvs = pvs1.GetSize();
|
---|
| 79 |
|
---|
| 80 | ObjectPvsMap::const_iterator it, it_end = pvs1.mEntries.end();
|
---|
| 81 |
|
---|
| 82 | Intersectable::NewMail();
|
---|
| 83 |
|
---|
[729] | 84 | // mail all objects in first pvs
|
---|
[580] | 85 | for (it = pvs1.mEntries.begin(); it != it_end; ++ it)
|
---|
| 86 | {
|
---|
| 87 | (*it).first->Mail();
|
---|
| 88 | }
|
---|
| 89 |
|
---|
| 90 | it_end = pvs2.mEntries.end();
|
---|
| 91 |
|
---|
[1189] | 92 | // look if the entries are also in second pvs
|
---|
[580] | 93 | for (it = pvs2.mEntries.begin(); it != it_end; ++ it)
|
---|
| 94 | {
|
---|
| 95 | Intersectable *obj = (*it).first;
|
---|
| 96 | if (!obj->Mailed())
|
---|
| 97 | ++ pvs;
|
---|
| 98 | }
|
---|
| 99 |
|
---|
| 100 | return pvs;
|
---|
| 101 | }
|
---|
| 102 |
|
---|
| 103 |
|
---|
[478] | 104 | ViewCell::ViewCell():
|
---|
| 105 | MeshInstance(NULL),
|
---|
| 106 | mPiercingRays(0),
|
---|
[551] | 107 | mArea(-1),
|
---|
| 108 | mVolume(-1),
|
---|
[580] | 109 | mValid(true),
|
---|
| 110 | mParent(NULL),
|
---|
[600] | 111 | mMergeCost(0),
|
---|
[752] | 112 | mPvsSize(0),
|
---|
[1160] | 113 | mEntriesInPvs(0),
|
---|
[752] | 114 | mPvsSizeValid(false)
|
---|
[265] | 115 | {
|
---|
| 116 | }
|
---|
[235] | 117 |
|
---|
[478] | 118 | ViewCell::ViewCell(Mesh *mesh):
|
---|
| 119 | MeshInstance(mesh),
|
---|
| 120 | mPiercingRays(0),
|
---|
[551] | 121 | mArea(-1),
|
---|
| 122 | mVolume(-1),
|
---|
[580] | 123 | mValid(true),
|
---|
| 124 | mParent(NULL),
|
---|
[600] | 125 | mMergeCost(0),
|
---|
[752] | 126 | mPvsSize(0),
|
---|
| 127 | mPvsSizeValid(false)
|
---|
[372] | 128 | {
|
---|
| 129 | }
|
---|
| 130 |
|
---|
[503] | 131 |
|
---|
[469] | 132 | const ObjectPvs &ViewCell::GetPvs() const
|
---|
[419] | 133 | {
|
---|
| 134 | return mPvs;
|
---|
| 135 | }
|
---|
| 136 |
|
---|
[752] | 137 |
|
---|
[469] | 138 | ObjectPvs &ViewCell::GetPvs()
|
---|
[372] | 139 | {
|
---|
| 140 | return mPvs;
|
---|
| 141 | }
|
---|
| 142 |
|
---|
[503] | 143 |
|
---|
[880] | 144 | void ViewCell::SetPvs(const ObjectPvs &pvs)
|
---|
| 145 | {
|
---|
| 146 | mPvs = pvs;
|
---|
| 147 | }
|
---|
| 148 |
|
---|
| 149 |
|
---|
[235] | 150 | int ViewCell::Type() const
|
---|
| 151 | {
|
---|
[308] | 152 | return VIEW_CELL;
|
---|
[235] | 153 | }
|
---|
| 154 |
|
---|
[503] | 155 |
|
---|
[469] | 156 | float ViewCell::GetVolume() const
|
---|
| 157 | {
|
---|
| 158 | return mVolume;
|
---|
| 159 | }
|
---|
| 160 |
|
---|
[478] | 161 |
|
---|
[469] | 162 | void ViewCell::SetVolume(float volume)
|
---|
| 163 | {
|
---|
| 164 | mVolume = volume;
|
---|
| 165 | }
|
---|
| 166 |
|
---|
[503] | 167 |
|
---|
| 168 | void ViewCell::SetMesh(Mesh *mesh)
|
---|
| 169 | {
|
---|
| 170 | mMesh = mesh;
|
---|
| 171 | }
|
---|
| 172 |
|
---|
| 173 |
|
---|
[478] | 174 | float ViewCell::GetArea() const
|
---|
| 175 | {
|
---|
| 176 | return mArea;
|
---|
| 177 | }
|
---|
| 178 |
|
---|
| 179 |
|
---|
| 180 | void ViewCell::SetArea(float area)
|
---|
| 181 | {
|
---|
| 182 | mArea = area;
|
---|
| 183 | }
|
---|
| 184 |
|
---|
| 185 |
|
---|
[752] | 186 | void ViewCell::SetColor(const RgbColor &color)
|
---|
| 187 | {
|
---|
| 188 | mColor = color;
|
---|
| 189 | }
|
---|
| 190 |
|
---|
| 191 |
|
---|
| 192 | RgbColor ViewCell::GetColor() const
|
---|
| 193 | {
|
---|
| 194 | return mColor;
|
---|
| 195 | }
|
---|
| 196 |
|
---|
| 197 |
|
---|
[547] | 198 | void ViewCell::SetValid(const bool valid)
|
---|
| 199 | {
|
---|
[564] | 200 | mValid = valid;
|
---|
[547] | 201 | }
|
---|
| 202 |
|
---|
| 203 |
|
---|
| 204 | bool ViewCell::GetValid() const
|
---|
| 205 | {
|
---|
| 206 | return mValid;
|
---|
| 207 | }
|
---|
| 208 |
|
---|
| 209 |
|
---|
[580] | 210 | void ViewCell::SetParent(ViewCellInterior *parent)
|
---|
| 211 | {
|
---|
| 212 | mParent = parent;
|
---|
| 213 | }
|
---|
| 214 |
|
---|
| 215 |
|
---|
| 216 | bool ViewCell::IsRoot() const
|
---|
| 217 | {
|
---|
| 218 | return !mParent;
|
---|
| 219 | }
|
---|
| 220 |
|
---|
| 221 |
|
---|
| 222 | ViewCellInterior *ViewCell::GetParent() const
|
---|
| 223 | {
|
---|
| 224 | return mParent;
|
---|
| 225 | }
|
---|
| 226 |
|
---|
| 227 |
|
---|
[600] | 228 | void ViewCell::SetMergeCost(const float mergeCost)
|
---|
[580] | 229 | {
|
---|
[600] | 230 | mMergeCost = mergeCost;
|
---|
[580] | 231 | }
|
---|
| 232 |
|
---|
| 233 |
|
---|
[728] | 234 | float ViewCell::GetRenderCost() const
|
---|
| 235 | {
|
---|
[801] | 236 | //return (float)mPvs.GetSize() * GetVolume();
|
---|
| 237 | return (float)mPvsSize * GetVolume();
|
---|
[728] | 238 | }
|
---|
| 239 |
|
---|
| 240 |
|
---|
[600] | 241 | float ViewCell::GetMergeCost() const
|
---|
[580] | 242 | {
|
---|
[600] | 243 | return mMergeCost;
|
---|
[580] | 244 | }
|
---|
| 245 |
|
---|
[1002] | 246 |
|
---|
| 247 | bool ViewCell::AddPvsSample(Intersectable *sample,
|
---|
| 248 | const float pdf,
|
---|
| 249 | float &contribution)
|
---|
| 250 | {
|
---|
| 251 | const bool result = mPvs.AddSample(sample, pdf, contribution);
|
---|
[1179] | 252 |
|
---|
| 253 | mPvsSizeValid = false; // have to recompute pvs size
|
---|
[1002] | 254 |
|
---|
| 255 | return result;
|
---|
| 256 | }
|
---|
| 257 |
|
---|
| 258 |
|
---|
[1133] | 259 |
|
---|
[462] | 260 | /************************************************************************/
|
---|
[580] | 261 | /* class ViewCellInterior implementation */
|
---|
| 262 | /************************************************************************/
|
---|
| 263 |
|
---|
| 264 |
|
---|
| 265 | ViewCellInterior::ViewCellInterior()
|
---|
| 266 | {
|
---|
| 267 | }
|
---|
| 268 |
|
---|
| 269 |
|
---|
| 270 | ViewCellInterior::~ViewCellInterior()
|
---|
| 271 | {
|
---|
| 272 | ViewCellContainer::const_iterator it, it_end = mChildren.end();
|
---|
| 273 |
|
---|
| 274 | for (it = mChildren.begin(); it != it_end; ++ it)
|
---|
| 275 | delete (*it);
|
---|
| 276 | }
|
---|
| 277 |
|
---|
| 278 |
|
---|
| 279 | ViewCellInterior::ViewCellInterior(Mesh *mesh):
|
---|
| 280 | ViewCell(mesh)
|
---|
| 281 | {
|
---|
| 282 | }
|
---|
| 283 |
|
---|
| 284 |
|
---|
| 285 | bool ViewCellInterior::IsLeaf() const
|
---|
| 286 | {
|
---|
| 287 | return false;
|
---|
| 288 | }
|
---|
| 289 |
|
---|
| 290 |
|
---|
[650] | 291 | void ViewCellInterior::SetupChildLink(ViewCell *vc)
|
---|
[580] | 292 | {
|
---|
[650] | 293 | mChildren.push_back(vc);
|
---|
[1002] | 294 | vc->SetParent(this);
|
---|
[580] | 295 | }
|
---|
| 296 |
|
---|
| 297 |
|
---|
[586] | 298 | void ViewCellInterior::RemoveChildLink(ViewCell *l)
|
---|
| 299 | {
|
---|
| 300 | // erase leaf from old view cell
|
---|
| 301 | ViewCellContainer::iterator it = mChildren.begin();
|
---|
[580] | 302 |
|
---|
[586] | 303 | for (; (*it) != l; ++ it);
|
---|
| 304 | if (it == mChildren.end())
|
---|
| 305 | Debug << "error" << endl;
|
---|
| 306 | else
|
---|
| 307 | mChildren.erase(it);
|
---|
| 308 | }
|
---|
| 309 |
|
---|
[703] | 310 |
|
---|
[580] | 311 | /************************************************************************/
|
---|
[462] | 312 | /* class ViewCellsStatistics implementation */
|
---|
| 313 | /************************************************************************/
|
---|
| 314 |
|
---|
[580] | 315 |
|
---|
| 316 |
|
---|
| 317 |
|
---|
[463] | 318 | void ViewCellsStatistics::Print(ostream &app) const
|
---|
| 319 | {
|
---|
| 320 | app << "=========== View Cells Statistics ===============\n";
|
---|
| 321 |
|
---|
| 322 | app << setprecision(4);
|
---|
| 323 |
|
---|
| 324 | //app << "#N_CTIME ( Construction time [s] )\n" << Time() << " \n";
|
---|
| 325 |
|
---|
[613] | 326 | app << "#N_OVERALLPVS ( objects in PVS )\n" << pvsSize << endl;
|
---|
[463] | 327 |
|
---|
| 328 | app << "#N_PMAXPVS ( largest PVS )\n" << maxPvs << endl;
|
---|
| 329 |
|
---|
| 330 | app << "#N_PMINPVS ( smallest PVS )\n" << minPvs << endl;
|
---|
| 331 |
|
---|
| 332 | app << "#N_PAVGPVS ( average PVS )\n" << AvgPvs() << endl;
|
---|
| 333 |
|
---|
[485] | 334 | app << "#N_PEMPTYPVS ( view cells with empty PVS )\n" << emptyPvs << endl;
|
---|
[463] | 335 |
|
---|
| 336 | app << "#N_VIEWCELLS ( number of view cells)\n" << viewCells << endl;
|
---|
| 337 |
|
---|
| 338 | app << "#N_AVGLEAVES (average number of leaves per view cell )\n" << AvgLeaves() << endl;
|
---|
| 339 |
|
---|
| 340 | app << "#N_MAXLEAVES ( maximal number of leaves per view cell )\n" << maxLeaves << endl;
|
---|
| 341 |
|
---|
[564] | 342 | app << "#N_INVALID ( number of invalid view cells )\n" << invalid << endl;
|
---|
| 343 |
|
---|
[463] | 344 | app << "========== End of View Cells Statistics ==========\n";
|
---|
[580] | 345 | }
|
---|
| 346 |
|
---|
| 347 |
|
---|
| 348 | /*************************************************************************/
|
---|
| 349 | /* class ViewCellsTree implementation */
|
---|
| 350 | /*************************************************************************/
|
---|
| 351 |
|
---|
| 352 |
|
---|
[1004] | 353 | ViewCellsTree::ViewCellsTree(ViewCellsManager *vcm):
|
---|
[580] | 354 | mRoot(NULL),
|
---|
| 355 | mUseAreaForPvs(false),
|
---|
[584] | 356 | mViewCellsManager(vcm),
|
---|
[752] | 357 | #if 0
|
---|
| 358 | mViewCellsStorage(PVS_IN_INTERIORS)
|
---|
| 359 | #else
|
---|
| 360 | mViewCellsStorage(PVS_IN_LEAVES)
|
---|
| 361 | #endif
|
---|
[580] | 362 | {
|
---|
[1264] | 363 | ReadEnvironment();
|
---|
| 364 | MergeCandidate::sRenderCostWeight = mRenderCostWeight;
|
---|
| 365 | }
|
---|
| 366 |
|
---|
| 367 |
|
---|
| 368 | ViewCellsTree::ViewCellsTree():
|
---|
| 369 | mRoot(NULL),
|
---|
| 370 | mUseAreaForPvs(false),
|
---|
| 371 | mViewCellsManager(NULL),
|
---|
| 372 | #if 0
|
---|
| 373 | mViewCellsStorage(PVS_IN_INTERIORS)
|
---|
| 374 | #else
|
---|
| 375 | mViewCellsStorage(PVS_IN_LEAVES)
|
---|
| 376 | #endif
|
---|
| 377 | {
|
---|
| 378 | ReadEnvironment();
|
---|
| 379 | MergeCandidate::sRenderCostWeight = mRenderCostWeight;
|
---|
| 380 | }
|
---|
| 381 |
|
---|
| 382 |
|
---|
| 383 | void ViewCellsTree::ReadEnvironment()
|
---|
| 384 | {
|
---|
[1004] | 385 | Environment::GetSingleton()->GetBoolValue("ViewCells.Visualization.exportMergedViewCells", mExportMergedViewCells);
|
---|
| 386 | Environment::GetSingleton()->GetFloatValue("ViewCells.maxStaticMemory", mMaxMemory);
|
---|
[580] | 387 |
|
---|
| 388 | //-- merge options
|
---|
[1004] | 389 | Environment::GetSingleton()->GetFloatValue("ViewCells.PostProcess.renderCostWeight", mRenderCostWeight);
|
---|
| 390 | Environment::GetSingleton()->GetIntValue("ViewCells.PostProcess.minViewCells", mMergeMinViewCells);
|
---|
| 391 | Environment::GetSingleton()->GetFloatValue("ViewCells.PostProcess.maxCostRatio", mMergeMaxCostRatio);
|
---|
| 392 | Environment::GetSingleton()->GetBoolValue("ViewCells.PostProcess.refine", mRefineViewCells);
|
---|
[582] | 393 |
|
---|
[1004] | 394 | Environment::GetSingleton()->GetIntValue("ViewCells.PostProcess.maxMergesPerPass", mMaxMergesPerPass);
|
---|
| 395 | Environment::GetSingleton()->GetFloatValue("ViewCells.PostProcess.avgCostMaxDeviation", mAvgCostMaxDeviation);
|
---|
[586] | 396 |
|
---|
[938] | 397 | Debug << "============= view cell tree options ================\n";
|
---|
[582] | 398 | Debug << "minimum view cells: " << mMergeMinViewCells << endl;
|
---|
| 399 | Debug << "max cost ratio: " << mMergeMaxCostRatio << endl;
|
---|
| 400 | Debug << "max memory: " << mMaxMemory << endl;
|
---|
[586] | 401 | Debug << "refining view cells: " << mRefineViewCells << endl;
|
---|
[1027] | 402 | Debug << "=========== end view cell tree options ===============\n";
|
---|
[580] | 403 | }
|
---|
| 404 |
|
---|
| 405 |
|
---|
[582] | 406 | // return memory usage in MB
|
---|
| 407 | float ViewCellsTree::GetMemUsage() const
|
---|
| 408 | {
|
---|
[752] | 409 | // TODO
|
---|
[582] | 410 | return 0;
|
---|
| 411 | /*(sizeof(ViewCellsTree) +
|
---|
| 412 | mBspStats.Leaves() * sizeof(BspLeaf) +
|
---|
| 413 | mBspStats.Interior() * sizeof(BspInterior) +
|
---|
| 414 | mBspStats.accumRays * sizeof(RayInfo)) / (1024.0f * 1024.0f);*/
|
---|
| 415 | }
|
---|
| 416 |
|
---|
| 417 |
|
---|
[736] | 418 | int ViewCellsTree::GetNumInitialViewCells(ViewCell *vc) const
|
---|
[580] | 419 | {
|
---|
| 420 | int vcSize = 0;
|
---|
| 421 |
|
---|
| 422 | stack<ViewCell *> tstack;
|
---|
| 423 |
|
---|
| 424 | tstack.push(vc);
|
---|
| 425 |
|
---|
| 426 | while (!tstack.empty())
|
---|
| 427 | {
|
---|
| 428 | ViewCell *vc = tstack.top();
|
---|
| 429 | tstack.pop();
|
---|
| 430 |
|
---|
| 431 | if (vc->IsLeaf())
|
---|
| 432 | {
|
---|
| 433 | ++ vcSize;
|
---|
| 434 | }
|
---|
| 435 | else
|
---|
| 436 | {
|
---|
| 437 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[1233] | 438 |
|
---|
[580] | 439 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[1233] | 440 |
|
---|
[580] | 441 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
[1233] | 442 | {
|
---|
[580] | 443 | tstack.push(*it);
|
---|
[1233] | 444 | }
|
---|
[580] | 445 |
|
---|
| 446 | }
|
---|
| 447 | }
|
---|
| 448 |
|
---|
| 449 | return vcSize;
|
---|
| 450 | }
|
---|
| 451 |
|
---|
| 452 |
|
---|
| 453 | void ViewCellsTree::CollectLeaves(ViewCell *vc, ViewCellContainer &leaves) const
|
---|
| 454 | {
|
---|
| 455 | stack<ViewCell *> tstack;
|
---|
| 456 |
|
---|
| 457 | tstack.push(vc);
|
---|
| 458 |
|
---|
| 459 | while (!tstack.empty())
|
---|
| 460 | {
|
---|
| 461 | ViewCell *vc = tstack.top();
|
---|
| 462 | tstack.pop();
|
---|
| 463 |
|
---|
| 464 | if (vc->IsLeaf())
|
---|
| 465 | {
|
---|
| 466 | leaves.push_back(vc);
|
---|
| 467 | }
|
---|
| 468 | else
|
---|
| 469 | {
|
---|
| 470 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
| 471 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[664] | 472 |
|
---|
[580] | 473 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
[664] | 474 | {
|
---|
[580] | 475 | tstack.push(*it);
|
---|
[664] | 476 | }
|
---|
[580] | 477 |
|
---|
| 478 | }
|
---|
| 479 | }
|
---|
| 480 | }
|
---|
| 481 |
|
---|
| 482 |
|
---|
| 483 | ViewCellsTree::~ViewCellsTree()
|
---|
| 484 | {
|
---|
| 485 | DEL_PTR(mRoot);
|
---|
| 486 | }
|
---|
| 487 |
|
---|
| 488 |
|
---|
| 489 | int ViewCellsTree::ConstructMergeTree(const VssRayContainer &rays,
|
---|
| 490 | const ObjectContainer &objects)
|
---|
| 491 | {
|
---|
[582] | 492 | mNumActiveViewCells = (int)mViewCellsManager->GetViewCells().size();
|
---|
[580] | 493 |
|
---|
| 494 | float variance = 0;
|
---|
| 495 | int totalPvs = 0;
|
---|
[600] | 496 | float totalRenderCost = 0;
|
---|
[580] | 497 |
|
---|
| 498 | //-- compute statistics values of initial view cells
|
---|
[600] | 499 | mViewCellsManager->EvaluateRenderStatistics(totalRenderCost,
|
---|
[580] | 500 | mExpectedCost,
|
---|
| 501 | mDeviation,
|
---|
| 502 | variance,
|
---|
| 503 | totalPvs,
|
---|
| 504 | mAvgRenderCost);
|
---|
| 505 |
|
---|
| 506 |
|
---|
| 507 | //-- fill merge queue
|
---|
| 508 | vector<MergeCandidate> candidates;
|
---|
| 509 |
|
---|
| 510 | mViewCellsManager->CollectMergeCandidates(rays, candidates);
|
---|
[703] | 511 |
|
---|
[580] | 512 | while(!candidates.empty())
|
---|
| 513 | {
|
---|
| 514 | MergeCandidate mc = candidates.back();
|
---|
| 515 | candidates.pop_back();
|
---|
| 516 | EvalMergeCost(mc);
|
---|
| 517 | mMergeQueue.push(mc);
|
---|
| 518 | }
|
---|
| 519 |
|
---|
| 520 | Debug << "************************* merge ***********************************" << endl;
|
---|
| 521 | Debug << "deviation: " << mDeviation << endl;
|
---|
| 522 | Debug << "avg render cost: " << mAvgRenderCost << endl;
|
---|
[600] | 523 | Debug << "expected cost: " << mExpectedCost << endl;
|
---|
[580] | 524 |
|
---|
| 525 |
|
---|
| 526 | ViewCellsManager::PvsStatistics pvsStats;
|
---|
| 527 | mViewCellsManager->GetPvsStatistics(pvsStats);
|
---|
| 528 |
|
---|
[605] | 529 | //static float expectedValue = pvsStats.avgPvs;
|
---|
[580] | 530 |
|
---|
[881] | 531 | //-- the current view cells are kept in this container
|
---|
| 532 | //-- we start with the current view cells from the view cell manager.
|
---|
| 533 | //-- The active view cells will change with subsequent merges
|
---|
[752] | 534 |
|
---|
[720] | 535 | // todo: should rather take initial view cells
|
---|
| 536 | ViewCellContainer &activeViewCells = mViewCellsManager->GetViewCells();
|
---|
| 537 |
|
---|
[752] | 538 |
|
---|
[580] | 539 | ViewCell::NewMail();
|
---|
| 540 |
|
---|
| 541 | MergeStatistics mergeStats;
|
---|
| 542 | mergeStats.Start();
|
---|
| 543 |
|
---|
| 544 | long startTime = GetTime();
|
---|
| 545 |
|
---|
| 546 | mergeStats.collectTime = TimeDiff(startTime, GetTime());
|
---|
| 547 | mergeStats.candidates = (int)mMergeQueue.size();
|
---|
| 548 | startTime = GetTime();
|
---|
| 549 |
|
---|
| 550 | // frequency stats are updated
|
---|
[650] | 551 | const int statsOut = 500;
|
---|
[734] | 552 |
|
---|
[580] | 553 | // passes are needed for statistics, because we don't want to record
|
---|
| 554 | // every merge
|
---|
| 555 | int pass = 0;
|
---|
| 556 | int mergedPerPass = 0;
|
---|
| 557 | float realExpectedCost = mExpectedCost;
|
---|
| 558 | float realAvgRenderCost = mAvgRenderCost;
|
---|
[582] | 559 | int realNumActiveViewCells = mNumActiveViewCells;
|
---|
[580] | 560 |
|
---|
| 561 | // maximal ratio of old expected render cost to expected render
|
---|
| 562 | // when the the render queue has to be reset.
|
---|
[582] | 563 | int numMergedViewCells = 0;
|
---|
[938] | 564 |
|
---|
[580] | 565 |
|
---|
| 566 | cout << "actual merge starts now ... " << endl;
|
---|
[604] | 567 |
|
---|
[580] | 568 | //-- use priority queue to merge leaf pairs
|
---|
[612] | 569 |
|
---|
[881] | 570 | while (!mMergeQueue.empty())
|
---|
[580] | 571 | {
|
---|
| 572 | //-- reset merge queue if the ratio of current expected cost / real expected cost
|
---|
| 573 | // too small or after a given number of merges
|
---|
[938] | 574 | if ((mergedPerPass > mMaxMergesPerPass) ||
|
---|
| 575 | (mAvgCostMaxDeviation > mAvgRenderCost / realAvgRenderCost))
|
---|
[580] | 576 | {
|
---|
| 577 | Debug << "************ reset queue *****************\n"
|
---|
[938] | 578 | << "ratios: " << mAvgCostMaxDeviation
|
---|
[580] | 579 | << " real avg render cost " << realAvgRenderCost << " average render cost " << mAvgRenderCost
|
---|
[938] | 580 | << " merged per pass : " << mergedPerPass << " of maximal " << mMaxMergesPerPass << endl;
|
---|
[580] | 581 |
|
---|
| 582 | Debug << "Values before reset: "
|
---|
| 583 | << " erc: " << mExpectedCost
|
---|
| 584 | << " avgrc: " << mAvgRenderCost
|
---|
| 585 | << " dev: " << mDeviation << endl;
|
---|
| 586 |
|
---|
| 587 | // adjust render cost
|
---|
| 588 | ++ pass;
|
---|
| 589 |
|
---|
| 590 | mergedPerPass = 0;
|
---|
| 591 | mExpectedCost = realExpectedCost;
|
---|
| 592 | mAvgRenderCost = realAvgRenderCost;
|
---|
[582] | 593 | mNumActiveViewCells = realNumActiveViewCells;
|
---|
[580] | 594 |
|
---|
[582] | 595 | const int numMergedViewCells = UpdateActiveViewCells(activeViewCells);
|
---|
| 596 |
|
---|
[720] | 597 |
|
---|
| 598 | //-- resets / refines the view cells
|
---|
| 599 | //-- priorities are recomputed
|
---|
| 600 | //-- the candidates are put back into merge queue
|
---|
[586] | 601 | if (mRefineViewCells)
|
---|
| 602 | RefineViewCells(rays, objects);
|
---|
| 603 | else
|
---|
| 604 | ResetMergeQueue();
|
---|
[580] | 605 |
|
---|
| 606 | Debug << "Values after reset: "
|
---|
| 607 | << " erc: " << mExpectedCost
|
---|
| 608 | << " avg: " << mAvgRenderCost
|
---|
| 609 | << " dev: " << mDeviation << endl;
|
---|
| 610 |
|
---|
| 611 | if (mExportMergedViewCells)
|
---|
| 612 | {
|
---|
[582] | 613 | ExportMergedViewCells(activeViewCells, objects, numMergedViewCells);
|
---|
[580] | 614 | }
|
---|
| 615 | }
|
---|
| 616 |
|
---|
| 617 |
|
---|
| 618 | MergeCandidate mc = mMergeQueue.top();
|
---|
| 619 | mMergeQueue.pop();
|
---|
| 620 |
|
---|
[710] | 621 | // both view cells equal because of previous merges
|
---|
[582] | 622 | // NOTE: do I really still need this? probably cannot happen!!
|
---|
[580] | 623 | if (mc.mLeftViewCell == mc.mRightViewCell)
|
---|
| 624 | continue;
|
---|
| 625 |
|
---|
| 626 | if (mc.IsValid())
|
---|
| 627 | {
|
---|
| 628 | ViewCell::NewMail();
|
---|
[600] | 629 |
|
---|
| 630 | //-- update statistical values
|
---|
[582] | 631 | -- realNumActiveViewCells;
|
---|
[580] | 632 | ++ mergeStats.merged;
|
---|
| 633 | ++ mergedPerPass;
|
---|
| 634 |
|
---|
[600] | 635 | const float renderCostIncr = mc.GetRenderCost();
|
---|
| 636 | const float mergeCostIncr = mc.GetMergeCost();
|
---|
[580] | 637 |
|
---|
[600] | 638 | totalRenderCost += renderCostIncr;
|
---|
[580] | 639 | mDeviation += mc.GetDeviationIncr();
|
---|
[710] | 640 |
|
---|
| 641 |
|
---|
| 642 | //-- merge the view cells of leaf1 and leaf2
|
---|
[580] | 643 | int pvsDiff;
|
---|
| 644 | ViewCellInterior *mergedVc =
|
---|
| 645 | MergeViewCells(mc.mLeftViewCell, mc.mRightViewCell, pvsDiff);
|
---|
[710] | 646 |
|
---|
[580] | 647 |
|
---|
[600] | 648 | // total render cost and deviation has changed
|
---|
| 649 | // real expected cost will be larger than expected cost used for the
|
---|
| 650 | // cost heuristics, but cannot recompute costs on each increase of the
|
---|
| 651 | // expected cost
|
---|
[580] | 652 | totalPvs += pvsDiff;
|
---|
[600] | 653 | realExpectedCost = totalRenderCost / (float)realNumActiveViewCells;
|
---|
| 654 | realAvgRenderCost = (float)totalPvs / (float)realNumActiveViewCells;
|
---|
| 655 |
|
---|
[801] | 656 | // set merge cost to this node for priority traversal
|
---|
[837] | 657 | mergedVc->SetMergeCost(totalRenderCost);
|
---|
| 658 |
|
---|
| 659 | // HACK
|
---|
| 660 | //mergedVc->SetMergeCost(1.0f / (float)realNumActiveViewCells);
|
---|
[582] | 661 |
|
---|
[837] | 662 | // check if "siblings (back and front node of the same parent)
|
---|
| 663 | if (0 && mViewCellsManager->EqualToSpatialNode(mergedVc))
|
---|
| 664 | ++ mergeStats.siblings;
|
---|
| 665 | // set the coŽst for rendering a view cell
|
---|
[608] | 666 | mergedVc->SetCost(realExpectedCost);
|
---|
[607] | 667 |
|
---|
[650] | 668 | if ((mergeStats.merged % statsOut) == 0)
|
---|
[580] | 669 | cout << "merged " << mergeStats.merged << " view cells" << endl;
|
---|
| 670 |
|
---|
| 671 | }
|
---|
| 672 | else
|
---|
| 673 | {
|
---|
| 674 | // merge candidate not valid, because one of the leaves was already
|
---|
| 675 | // merged with another one => validate and reinsert into queue
|
---|
[582] | 676 | if (ValidateMergeCandidate(mc))
|
---|
| 677 | {
|
---|
| 678 | EvalMergeCost(mc);
|
---|
| 679 | mMergeQueue.push(mc);
|
---|
| 680 | }
|
---|
[580] | 681 | }
|
---|
[612] | 682 |
|
---|
[580] | 683 | }
|
---|
| 684 |
|
---|
| 685 | // adjust stats and reset queue one final time
|
---|
| 686 | mExpectedCost = realExpectedCost;
|
---|
| 687 | mAvgRenderCost = realAvgRenderCost;
|
---|
[582] | 688 | mNumActiveViewCells = realNumActiveViewCells;
|
---|
[580] | 689 |
|
---|
[582] | 690 | UpdateActiveViewCells(activeViewCells);
|
---|
[580] | 691 |
|
---|
[586] | 692 | // refine view cells and reset costs
|
---|
| 693 | if (mRefineViewCells)
|
---|
| 694 | RefineViewCells(rays, objects);
|
---|
| 695 | else
|
---|
| 696 | ResetMergeQueue();
|
---|
| 697 |
|
---|
[708] | 698 |
|
---|
[580] | 699 | // create a root node if the merge was not done till root level,
|
---|
| 700 | // else take the single node as new root
|
---|
[582] | 701 | if ((int)activeViewCells.size() > 1)
|
---|
[580] | 702 | {
|
---|
[587] | 703 | Debug << "creating root of view cell hierarchy for "
|
---|
| 704 | << (int)activeViewCells.size() << " view cells" << endl;
|
---|
[612] | 705 |
|
---|
[582] | 706 | ViewCellInterior *root = mViewCellsManager->MergeViewCells(activeViewCells);
|
---|
[710] | 707 |
|
---|
| 708 | ViewCellContainer::const_iterator it, it_end = root->mChildren.end();
|
---|
| 709 |
|
---|
| 710 | for (it = root->mChildren.begin(); it != it_end; ++ it)
|
---|
| 711 | (*it)->SetParent(root);
|
---|
| 712 |
|
---|
[600] | 713 | root->SetMergeCost(totalRenderCost);
|
---|
[608] | 714 | // $$JB keep this 0 temporarilly
|
---|
| 715 | root->SetCost(0.0f);
|
---|
[612] | 716 |
|
---|
[580] | 717 | mRoot = root;
|
---|
| 718 | }
|
---|
[710] | 719 | // normal case
|
---|
| 720 | else if (!activeViewCells.empty())
|
---|
[580] | 721 | {
|
---|
[582] | 722 | Debug << "setting root of the merge history" << endl;
|
---|
| 723 | mRoot = activeViewCells[0];
|
---|
[580] | 724 | }
|
---|
[752] | 725 | else
|
---|
| 726 | {
|
---|
| 727 | Debug << "big error, root is NULL" << endl;
|
---|
| 728 | }
|
---|
[708] | 729 |
|
---|
[644] | 730 | //-- empty merge queue just in case
|
---|
[600] | 731 | while (!mMergeQueue.empty())
|
---|
| 732 | {
|
---|
| 733 | mMergeQueue.pop();
|
---|
| 734 | }
|
---|
[837] | 735 |
|
---|
| 736 | // test if voluje is equal
|
---|
| 737 | Debug << "volume of the root view cell: " << mRoot->GetVolume() << " " << mViewCellsManager->GetViewSpaceBox().GetVolume() << endl;
|
---|
| 738 |
|
---|
| 739 | //hack!!
|
---|
| 740 | //mRoot->GetPvs().Clear();
|
---|
| 741 |
|
---|
| 742 | // TODO: delete because makes no sense here
|
---|
[580] | 743 | mergeStats.expectedRenderCost = realExpectedCost;
|
---|
| 744 | mergeStats.deviation = mDeviation;
|
---|
| 745 |
|
---|
| 746 | // we want to optimize this heuristics
|
---|
| 747 | mergeStats.heuristics =
|
---|
| 748 | mDeviation * (1.0f - mRenderCostWeight) +
|
---|
| 749 | mExpectedCost * mRenderCostWeight;
|
---|
| 750 |
|
---|
| 751 | mergeStats.mergeTime = TimeDiff(startTime, GetTime());
|
---|
| 752 | mergeStats.Stop();
|
---|
| 753 | Debug << mergeStats << endl << endl;
|
---|
| 754 |
|
---|
[608] | 755 | // assign colors for the view cells so that at least one is always consistent
|
---|
| 756 | AssignRandomColors();
|
---|
[708] | 757 |
|
---|
[580] | 758 | //TODO: should return sample contributions?
|
---|
| 759 | return mergeStats.merged;
|
---|
| 760 | }
|
---|
| 761 |
|
---|
| 762 |
|
---|
[584] | 763 | ViewCell *ViewCellsTree::GetRoot() const
|
---|
[581] | 764 | {
|
---|
| 765 | return mRoot;
|
---|
| 766 | }
|
---|
| 767 |
|
---|
| 768 |
|
---|
[580] | 769 | void ViewCellsTree::ResetMergeQueue()
|
---|
| 770 | {
|
---|
| 771 | cout << "reset merge queue ... ";
|
---|
| 772 |
|
---|
| 773 | vector<MergeCandidate> buf;
|
---|
| 774 | buf.reserve(mMergeQueue.size());
|
---|
| 775 |
|
---|
| 776 |
|
---|
| 777 | // store merge candidates in intermediate buffer
|
---|
| 778 | while (!mMergeQueue.empty())
|
---|
| 779 | {
|
---|
| 780 | MergeCandidate mc = mMergeQueue.top();
|
---|
| 781 | mMergeQueue.pop();
|
---|
| 782 |
|
---|
| 783 | // recalculate cost
|
---|
[582] | 784 | if (ValidateMergeCandidate(mc))
|
---|
| 785 | {
|
---|
| 786 | EvalMergeCost(mc);
|
---|
| 787 | buf.push_back(mc);
|
---|
| 788 | }
|
---|
[580] | 789 | }
|
---|
| 790 |
|
---|
| 791 | vector<MergeCandidate>::const_iterator bit, bit_end = buf.end();
|
---|
| 792 |
|
---|
| 793 | // reinsert back into queue
|
---|
| 794 | for (bit = buf.begin(); bit != bit_end; ++ bit)
|
---|
| 795 | {
|
---|
| 796 | mMergeQueue.push(*bit);
|
---|
| 797 | }
|
---|
| 798 |
|
---|
| 799 | cout << "finished" << endl;
|
---|
| 800 | }
|
---|
| 801 |
|
---|
| 802 |
|
---|
[1002] | 803 | float ViewCellsTree::ComputeMergedPvsCost(const ObjectPvs &pvs1,
|
---|
| 804 | const ObjectPvs &pvs2) const
|
---|
| 805 | {
|
---|
| 806 | // computes render cost of merge
|
---|
| 807 | float renderCost = 0;
|
---|
| 808 |
|
---|
| 809 | // compute new pvs size
|
---|
| 810 | ObjectPvsMap::const_iterator it, it_end = pvs1.mEntries.end();
|
---|
| 811 |
|
---|
| 812 | Intersectable::NewMail();
|
---|
| 813 |
|
---|
| 814 | // first mail all objects in first pvs
|
---|
| 815 | for (it = pvs1.mEntries.begin(); it != it_end; ++ it)
|
---|
| 816 | {
|
---|
| 817 | Intersectable *obj = (*it).first;
|
---|
| 818 |
|
---|
| 819 | obj->Mail();
|
---|
| 820 | renderCost += mViewCellsManager->EvalRenderCost(obj);
|
---|
| 821 | }
|
---|
| 822 |
|
---|
| 823 | it_end = pvs2.mEntries.end();
|
---|
| 824 |
|
---|
| 825 |
|
---|
| 826 | for (it = pvs2.mEntries.begin(); it != it_end; ++ it)
|
---|
| 827 | {
|
---|
| 828 | Intersectable *obj = (*it).first;
|
---|
| 829 |
|
---|
| 830 | // test if object already considered
|
---|
| 831 | if (!obj->Mailed())
|
---|
| 832 | {
|
---|
| 833 | renderCost += mViewCellsManager->EvalRenderCost(obj);
|
---|
| 834 | }
|
---|
| 835 | }
|
---|
| 836 |
|
---|
| 837 | return renderCost;
|
---|
| 838 | }
|
---|
| 839 |
|
---|
| 840 |
|
---|
[582] | 841 | int ViewCellsTree::UpdateActiveViewCells(ViewCellContainer &viewCells)
|
---|
[580] | 842 | {
|
---|
[582] | 843 | int numMergedViewCells = 0;
|
---|
[580] | 844 |
|
---|
[584] | 845 | Debug << "updating active vc: " << (int)viewCells.size() << endl;
|
---|
[1141] | 846 |
|
---|
| 847 | // find all already merged view cells and remove them from the
|
---|
| 848 | // container view cells
|
---|
[582] | 849 |
|
---|
| 850 | // sort out all view cells which are not active anymore, i.e., they
|
---|
| 851 | // were already part of a merge
|
---|
[580] | 852 | int i = 0;
|
---|
| 853 |
|
---|
[582] | 854 | ViewCell::NewMail();
|
---|
| 855 |
|
---|
[580] | 856 | while (1)
|
---|
| 857 | {
|
---|
[582] | 858 | // remove all merged view cells from end of the vector
|
---|
| 859 | while (!viewCells.empty() && (viewCells.back()->GetParent()))
|
---|
[580] | 860 | {
|
---|
| 861 | viewCells.pop_back();
|
---|
| 862 | }
|
---|
| 863 |
|
---|
| 864 | // all merged view cells have been found
|
---|
[710] | 865 | if (i >= (int)viewCells.size())
|
---|
[580] | 866 | break;
|
---|
| 867 |
|
---|
[710] | 868 | // already merged this view cell, put it to end of vector
|
---|
[582] | 869 | if (viewCells[i]->GetParent())
|
---|
[580] | 870 | swap(viewCells[i], viewCells.back());
|
---|
| 871 |
|
---|
[752] | 872 | // mail view cell that it has not been merged
|
---|
[710] | 873 | viewCells[i]->Mail();
|
---|
| 874 |
|
---|
| 875 | // increase loop counter
|
---|
| 876 | ++ i;
|
---|
[580] | 877 | }
|
---|
| 878 |
|
---|
[582] | 879 |
|
---|
[580] | 880 | // add new view cells to container only if they don't have been
|
---|
| 881 | // merged in the mean time
|
---|
[582] | 882 | ViewCellContainer::const_iterator ait, ait_end = mMergedViewCells.end();
|
---|
[752] | 883 |
|
---|
[582] | 884 | for (ait = mMergedViewCells.begin(); ait != ait_end; ++ ait)
|
---|
[580] | 885 | {
|
---|
[582] | 886 | ViewCell *vc = mMergedViewCells.back();
|
---|
| 887 | if (!vc->GetParent() && !vc->Mailed())
|
---|
[580] | 888 | {
|
---|
[582] | 889 | vc->Mail();
|
---|
| 890 | viewCells.push_back(vc);
|
---|
| 891 | ++ numMergedViewCells;
|
---|
[580] | 892 | }
|
---|
| 893 | }
|
---|
| 894 |
|
---|
[752] | 895 | // dispose old merged view cells
|
---|
[582] | 896 | mMergedViewCells.clear();
|
---|
| 897 |
|
---|
[580] | 898 | // update standard deviation
|
---|
| 899 | ViewCellContainer::const_iterator vit, vit_end = viewCells.end();
|
---|
| 900 |
|
---|
| 901 | mDeviation = 0;
|
---|
| 902 |
|
---|
| 903 | for (vit = viewCells.begin(); vit != vit_end; ++ vit)
|
---|
| 904 | {
|
---|
[728] | 905 | const int lower = mViewCellsManager->GetMinPvsSize();
|
---|
| 906 | const int upper = mViewCellsManager->GetMaxPvsSize();
|
---|
[752] | 907 |
|
---|
[1168] | 908 | const float penalty = EvalPvsPenalty((*vit)->GetPvs().CountObjectsInPvs(), lower, upper);
|
---|
[580] | 909 |
|
---|
| 910 | mDeviation += fabs(mAvgRenderCost - penalty);
|
---|
| 911 | }
|
---|
| 912 |
|
---|
| 913 | mDeviation /= (float)viewCells.size();
|
---|
[582] | 914 |
|
---|
| 915 | return numMergedViewCells;
|
---|
[580] | 916 | }
|
---|
| 917 |
|
---|
| 918 |
|
---|
| 919 | void ViewCellsTree::ExportMergedViewCells(ViewCellContainer &viewCells,
|
---|
| 920 | const ObjectContainer &objects,
|
---|
[582] | 921 | const int numMergedViewCells)
|
---|
[580] | 922 | {
|
---|
| 923 |
|
---|
| 924 |
|
---|
| 925 | char s[64];
|
---|
| 926 |
|
---|
| 927 | sprintf(s, "merged_viewcells%07d.x3d", (int)viewCells.size());
|
---|
| 928 | Exporter *exporter = Exporter::GetExporter(s);
|
---|
| 929 |
|
---|
| 930 | if (exporter)
|
---|
| 931 | {
|
---|
| 932 | cout << "exporting " << (int)viewCells.size() << " merged view cells ... ";
|
---|
| 933 | exporter->ExportGeometry(objects);
|
---|
| 934 | //Debug << "vc size " << (int)viewCells.size() << " merge queue size: " << (int)mMergeQueue.size() << endl;
|
---|
| 935 | ViewCellContainer::const_iterator it, it_end = viewCells.end();
|
---|
| 936 |
|
---|
| 937 | int i = 0;
|
---|
| 938 | for (it = viewCells.begin(); it != it_end; ++ it)
|
---|
| 939 | {
|
---|
| 940 | Material m;
|
---|
| 941 | // assign special material to new view cells
|
---|
| 942 | // new view cells are on the back of container
|
---|
[582] | 943 | if (i ++ >= (viewCells.size() - numMergedViewCells))
|
---|
[580] | 944 | {
|
---|
| 945 | //m = RandomMaterial();
|
---|
| 946 | m.mDiffuseColor.r = RandomValue(0.5f, 1.0f);
|
---|
| 947 | m.mDiffuseColor.g = RandomValue(0.5f, 1.0f);
|
---|
| 948 | m.mDiffuseColor.b = RandomValue(0.5f, 1.0f);
|
---|
| 949 | }
|
---|
| 950 | else
|
---|
| 951 | {
|
---|
| 952 | float col = RandomValue(0.1f, 0.4f);
|
---|
| 953 | m.mDiffuseColor.r = col;
|
---|
| 954 | m.mDiffuseColor.g = col;
|
---|
| 955 | m.mDiffuseColor.b = col;
|
---|
| 956 | }
|
---|
| 957 |
|
---|
| 958 | exporter->SetForcedMaterial(m);
|
---|
| 959 | mViewCellsManager->ExportViewCellGeometry(exporter, *it);
|
---|
| 960 | }
|
---|
| 961 | delete exporter;
|
---|
| 962 | cout << "finished" << endl;
|
---|
| 963 | }
|
---|
| 964 | }
|
---|
| 965 |
|
---|
| 966 |
|
---|
| 967 | // TODO: should be done in view cells manager
|
---|
[1141] | 968 | ViewCellInterior *ViewCellsTree::MergeViewCells(ViewCell *left,
|
---|
| 969 | ViewCell *right,
|
---|
[586] | 970 | int &pvsDiff) //const
|
---|
[580] | 971 | {
|
---|
[1141] | 972 | // create merged view cell
|
---|
| 973 | ViewCellInterior *vc =
|
---|
| 974 | mViewCellsManager->MergeViewCells(left, right);
|
---|
[580] | 975 |
|
---|
| 976 | // if merge was unsuccessful
|
---|
| 977 | if (!vc) return NULL;
|
---|
| 978 |
|
---|
[752] | 979 | // set to the new parent view cell
|
---|
[1141] | 980 | left->SetParent(vc);
|
---|
| 981 | right->SetParent(vc);
|
---|
[710] | 982 |
|
---|
[1141] | 983 |
|
---|
[580] | 984 | if (mUseAreaForPvs)
|
---|
[710] | 985 | {
|
---|
[1141] | 986 | // set new area of view cell
|
---|
| 987 | // not not correct, but costly to compute real area!!
|
---|
| 988 | vc->SetArea(left->GetArea() + right->GetArea());
|
---|
[710] | 989 | }
|
---|
[580] | 990 | else
|
---|
[1141] | 991 | { // set new volume of view cell
|
---|
| 992 | vc->SetVolume(left->GetVolume() + right->GetVolume());
|
---|
[602] | 993 | }
|
---|
[710] | 994 |
|
---|
| 995 |
|
---|
[580] | 996 | // important so other merge candidates sharing this view cell
|
---|
| 997 | // are notified that the merge cost must be updated!!
|
---|
| 998 | vc->Mail();
|
---|
| 999 |
|
---|
[1168] | 1000 | const int pvs1 = left->GetPvs().CountObjectsInPvs();
|
---|
| 1001 | const int pvs2 = right->GetPvs().CountObjectsInPvs();
|
---|
[580] | 1002 |
|
---|
| 1003 |
|
---|
[1141] | 1004 | // the new view cells are stored in this container
|
---|
[582] | 1005 | mMergedViewCells.push_back(vc);
|
---|
[580] | 1006 |
|
---|
[1168] | 1007 | pvsDiff = vc->GetPvs().CountObjectsInPvs() - pvs1 - pvs2;
|
---|
[580] | 1008 |
|
---|
[752] | 1009 |
|
---|
[1141] | 1010 | // don't store pvs in interior cells, just a scalar
|
---|
[752] | 1011 | if (mViewCellsStorage == PVS_IN_LEAVES)
|
---|
| 1012 | {
|
---|
[1168] | 1013 | // set scalars
|
---|
| 1014 | mViewCellsManager->UpdateScalarPvsSize(left,
|
---|
| 1015 | left->GetPvs().CountObjectsInPvs(),
|
---|
| 1016 | left->GetPvs().GetSize());
|
---|
| 1017 |
|
---|
[1141] | 1018 | // remove pvs, we don't store interior pvss
|
---|
| 1019 | if (!left->IsLeaf())
|
---|
| 1020 | {
|
---|
| 1021 | left->GetPvs().Clear();
|
---|
| 1022 | }
|
---|
| 1023 |
|
---|
[1168] | 1024 | // set scalars
|
---|
| 1025 | mViewCellsManager->UpdateScalarPvsSize(right,
|
---|
| 1026 | right->GetPvs().CountObjectsInPvs(),
|
---|
| 1027 | right->GetPvs().GetSize());
|
---|
| 1028 |
|
---|
[1141] | 1029 | right->mPvsSizeValid = true;
|
---|
[752] | 1030 |
|
---|
[1141] | 1031 | // remove pvs, we don't store interior pvss
|
---|
| 1032 | if (!right->IsLeaf())
|
---|
| 1033 | {
|
---|
| 1034 | right->GetPvs().Clear();
|
---|
| 1035 | }
|
---|
| 1036 | }
|
---|
[752] | 1037 |
|
---|
[580] | 1038 | return vc;
|
---|
| 1039 | }
|
---|
| 1040 |
|
---|
| 1041 |
|
---|
[586] | 1042 | int ViewCellsTree::RefineViewCells(const VssRayContainer &rays,
|
---|
| 1043 | const ObjectContainer &objects)
|
---|
[580] | 1044 | {
|
---|
| 1045 | Debug << "refining " << (int)mMergeQueue.size() << " candidates " << endl;
|
---|
[586] | 1046 |
|
---|
| 1047 | // intermediate buffer for shuffled view cells
|
---|
| 1048 | vector<MergeCandidate> buf;
|
---|
| 1049 | buf.reserve(mMergeQueue.size());
|
---|
| 1050 |
|
---|
[580] | 1051 | // Use priority queue of remaining leaf pairs
|
---|
| 1052 | // The candidates either share the same view cells or
|
---|
| 1053 | // are border leaves which share a boundary.
|
---|
| 1054 | // We test if they can be shuffled, i.e.,
|
---|
| 1055 | // either one leaf is made part of one view cell or the other
|
---|
| 1056 | // leaf is made part of the other view cell. It is tested if the
|
---|
| 1057 | // remaining view cells are "better" than the old ones.
|
---|
| 1058 |
|
---|
[586] | 1059 | const int numPasses = 3;
|
---|
[580] | 1060 | int pass = 0;
|
---|
| 1061 | int passShuffled = 0;
|
---|
| 1062 | int shuffled = 0;
|
---|
| 1063 | int shuffledViewCells = 0;
|
---|
| 1064 |
|
---|
| 1065 | ViewCell::NewMail();
|
---|
| 1066 |
|
---|
[586] | 1067 | while (!mMergeQueue.empty())
|
---|
[580] | 1068 | {
|
---|
[586] | 1069 | MergeCandidate mc = mMergeQueue.top();
|
---|
| 1070 | mMergeQueue.pop();
|
---|
[580] | 1071 |
|
---|
[586] | 1072 | // both view cells equal or already shuffled
|
---|
| 1073 | if ((mc.GetLeftViewCell() == mc.GetRightViewCell()) ||
|
---|
| 1074 | mc.GetLeftViewCell()->IsLeaf() || mc.GetRightViewCell()->IsLeaf())
|
---|
| 1075 | {
|
---|
| 1076 | continue;
|
---|
| 1077 | }
|
---|
[580] | 1078 |
|
---|
[586] | 1079 | // candidate for shuffling
|
---|
| 1080 | const bool wasShuffled = ShuffleLeaves(mc);
|
---|
[580] | 1081 |
|
---|
[586] | 1082 | // shuffled or put into other queue for further refine
|
---|
| 1083 | if (wasShuffled)
|
---|
| 1084 | {
|
---|
| 1085 | ++ passShuffled;
|
---|
| 1086 |
|
---|
| 1087 | if (!mc.GetLeftViewCell()->Mailed())
|
---|
[580] | 1088 | {
|
---|
[586] | 1089 | mc.GetLeftViewCell()->Mail();
|
---|
| 1090 | ++ shuffledViewCells;
|
---|
[580] | 1091 | }
|
---|
[586] | 1092 | if (!mc.GetRightViewCell()->Mailed())
|
---|
[580] | 1093 | {
|
---|
[586] | 1094 | mc.GetRightViewCell()->Mail();
|
---|
| 1095 | ++ shuffledViewCells;
|
---|
[580] | 1096 | }
|
---|
| 1097 | }
|
---|
| 1098 |
|
---|
[586] | 1099 | // put back into intermediate vector
|
---|
| 1100 | buf.push_back(mc);
|
---|
[580] | 1101 | }
|
---|
| 1102 |
|
---|
[586] | 1103 |
|
---|
| 1104 | //-- in the end, the candidates must be in the mergequeue again
|
---|
| 1105 | // with the correct cost
|
---|
| 1106 |
|
---|
| 1107 | cout << "reset merge queue ... ";
|
---|
| 1108 |
|
---|
| 1109 |
|
---|
| 1110 | vector<MergeCandidate>::const_iterator bit, bit_end = buf.end();
|
---|
| 1111 |
|
---|
| 1112 | for (bit = buf.begin(); bit != bit_end; ++ bit)
|
---|
| 1113 | {
|
---|
| 1114 | MergeCandidate mc = *bit;
|
---|
| 1115 | // recalculate cost
|
---|
| 1116 | if (ValidateMergeCandidate(mc))
|
---|
| 1117 | {
|
---|
| 1118 | EvalMergeCost(mc);
|
---|
| 1119 | mMergeQueue.push(mc);
|
---|
| 1120 | }
|
---|
[580] | 1121 | }
|
---|
| 1122 |
|
---|
[586] | 1123 | cout << "finished" << endl;
|
---|
| 1124 |
|
---|
[580] | 1125 | return shuffledViewCells;
|
---|
| 1126 | }
|
---|
| 1127 |
|
---|
| 1128 |
|
---|
| 1129 | inline int AddedPvsSize(ObjectPvs pvs1, const ObjectPvs &pvs2)
|
---|
| 1130 | {
|
---|
| 1131 | return pvs1.AddPvs(pvs2);
|
---|
| 1132 | }
|
---|
| 1133 |
|
---|
| 1134 |
|
---|
| 1135 | // recomputes pvs size minus pvs of leaf l
|
---|
| 1136 | #if 0
|
---|
| 1137 | inline int SubtractedPvsSize(BspViewCell *vc, BspLeaf *l, const ObjectPvs &pvs2)
|
---|
| 1138 | {
|
---|
| 1139 | ObjectPvs pvs;
|
---|
| 1140 | vector<BspLeaf *>::const_iterator it, it_end = vc->mLeaves.end();
|
---|
| 1141 | for (it = vc->mLeaves.begin(); it != vc->mLeaves.end(); ++ it)
|
---|
| 1142 | if (*it != l)
|
---|
| 1143 | pvs.AddPvs(*(*it)->mPvs);
|
---|
| 1144 | return pvs.GetSize();
|
---|
| 1145 | }
|
---|
| 1146 | #endif
|
---|
| 1147 |
|
---|
| 1148 |
|
---|
| 1149 | // computes pvs1 minus pvs2
|
---|
| 1150 | inline int SubtractedPvsSize(ObjectPvs pvs1, const ObjectPvs &pvs2)
|
---|
| 1151 | {
|
---|
| 1152 | return pvs1.SubtractPvs(pvs2);
|
---|
| 1153 | }
|
---|
| 1154 |
|
---|
| 1155 |
|
---|
| 1156 | float ViewCellsTree::EvalShuffleCost(ViewCell *leaf,
|
---|
[586] | 1157 | ViewCellInterior *vc1,
|
---|
| 1158 | ViewCellInterior *vc2) const
|
---|
[580] | 1159 | {
|
---|
| 1160 | //const int pvs1 = SubtractedPvsSize(vc1, leaf, *leaf->mPvs);
|
---|
| 1161 | const int pvs1 = SubtractedPvsSize(vc1->GetPvs(), leaf->GetPvs());
|
---|
| 1162 | const int pvs2 = AddedPvsSize(vc2->GetPvs(), leaf->GetPvs());
|
---|
| 1163 |
|
---|
| 1164 | const int lowerPvsLimit = mViewCellsManager->GetMinPvsSize();
|
---|
| 1165 | const int upperPvsLimit = mViewCellsManager->GetMaxPvsSize();
|
---|
| 1166 |
|
---|
| 1167 | const float pvsPenalty1 =
|
---|
| 1168 | EvalPvsPenalty(pvs1, lowerPvsLimit, upperPvsLimit);
|
---|
| 1169 |
|
---|
| 1170 | const float pvsPenalty2 =
|
---|
| 1171 | EvalPvsPenalty(pvs2, lowerPvsLimit, upperPvsLimit);
|
---|
| 1172 |
|
---|
| 1173 |
|
---|
| 1174 | // don't shuffle leaves with pvs > max
|
---|
| 1175 | if (0 && (pvs1 + pvs2 > mViewCellsManager->GetMaxPvsSize()))
|
---|
| 1176 | {
|
---|
| 1177 | return 1e20f;
|
---|
| 1178 | }
|
---|
| 1179 |
|
---|
| 1180 | float p1, p2;
|
---|
| 1181 |
|
---|
| 1182 | if (mUseAreaForPvs)
|
---|
| 1183 | {
|
---|
| 1184 | p1 = vc1->GetArea() - leaf->GetArea();
|
---|
| 1185 | p2 = vc2->GetArea() + leaf->GetArea();
|
---|
| 1186 | }
|
---|
| 1187 | else
|
---|
| 1188 | {
|
---|
| 1189 | p1 = vc1->GetVolume() - leaf->GetVolume();
|
---|
| 1190 | p2 = vc2->GetVolume() + leaf->GetVolume();
|
---|
| 1191 | }
|
---|
| 1192 |
|
---|
| 1193 | const float renderCost1 = pvsPenalty1 * p1;
|
---|
| 1194 | const float renderCost2 = pvsPenalty2 * p2;
|
---|
| 1195 |
|
---|
| 1196 | float dev1, dev2;
|
---|
| 1197 |
|
---|
| 1198 | if (1)
|
---|
| 1199 | {
|
---|
| 1200 | dev1 = fabs(mAvgRenderCost - pvsPenalty1);
|
---|
| 1201 | dev2 = fabs(mAvgRenderCost - pvsPenalty2);
|
---|
| 1202 | }
|
---|
| 1203 | else
|
---|
| 1204 | {
|
---|
| 1205 | dev1 = fabs(mExpectedCost - renderCost1);
|
---|
| 1206 | dev2 = fabs(mExpectedCost - renderCost2);
|
---|
| 1207 | }
|
---|
| 1208 |
|
---|
| 1209 | return mRenderCostWeight * (renderCost1 + renderCost2) +
|
---|
[582] | 1210 | (1.0f - mRenderCostWeight) * (dev1 + dev2) / (float)mNumActiveViewCells;
|
---|
[580] | 1211 | }
|
---|
| 1212 |
|
---|
| 1213 |
|
---|
| 1214 | void ViewCellsTree::ShuffleLeaf(ViewCell *leaf,
|
---|
[586] | 1215 | ViewCellInterior *vc1,
|
---|
| 1216 | ViewCellInterior *vc2) const
|
---|
[580] | 1217 | {
|
---|
| 1218 | // compute new pvs and area
|
---|
[586] | 1219 | // TODO change
|
---|
[580] | 1220 | vc1->GetPvs().SubtractPvs(leaf->GetPvs());
|
---|
| 1221 | vc2->GetPvs().AddPvs(leaf->GetPvs());
|
---|
| 1222 |
|
---|
| 1223 | if (mUseAreaForPvs)
|
---|
| 1224 | {
|
---|
| 1225 | vc1->SetArea(vc1->GetArea() - leaf->GetArea());
|
---|
| 1226 | vc2->SetArea(vc2->GetArea() + leaf->GetArea());
|
---|
| 1227 | }
|
---|
| 1228 | else
|
---|
| 1229 | {
|
---|
| 1230 | vc1->SetVolume(vc1->GetVolume() - leaf->GetVolume());
|
---|
| 1231 | vc2->SetVolume(vc2->GetVolume() + leaf->GetVolume());
|
---|
| 1232 | }
|
---|
| 1233 |
|
---|
[586] | 1234 |
|
---|
| 1235 | ViewCellInterior *p = dynamic_cast<ViewCellInterior *>(leaf->GetParent());
|
---|
[580] | 1236 |
|
---|
[586] | 1237 | p->RemoveChildLink(leaf);
|
---|
| 1238 | vc2->SetupChildLink(leaf);
|
---|
[580] | 1239 | }
|
---|
| 1240 |
|
---|
| 1241 |
|
---|
[586] | 1242 | bool ViewCellsTree::ShuffleLeaves(MergeCandidate &mc) const
|
---|
[580] | 1243 | {
|
---|
| 1244 | float cost1, cost2;
|
---|
| 1245 |
|
---|
[586] | 1246 | ViewCellInterior *vc1 = dynamic_cast<ViewCellInterior *>(mc.GetLeftViewCell());
|
---|
| 1247 | ViewCellInterior *vc2 = dynamic_cast<ViewCellInterior *>(mc.GetRightViewCell());
|
---|
| 1248 |
|
---|
| 1249 | ViewCell *leaf1 = mc.GetInitialLeftViewCell();
|
---|
| 1250 | ViewCell *leaf2 = mc.GetInitialRightViewCell();
|
---|
| 1251 |
|
---|
[580] | 1252 | //-- first test if shuffling would decrease cost
|
---|
[586] | 1253 | cost1 = GetCostHeuristics(vc1);
|
---|
| 1254 | cost2 = GetCostHeuristics(vc2);
|
---|
[580] | 1255 |
|
---|
| 1256 | const float oldCost = cost1 + cost2;
|
---|
| 1257 |
|
---|
| 1258 | float shuffledCost1 = Limits::Infinity;
|
---|
| 1259 | float shuffledCost2 = Limits::Infinity;
|
---|
| 1260 |
|
---|
[586] | 1261 | if (leaf1)
|
---|
| 1262 | shuffledCost1 = EvalShuffleCost(leaf1, vc1, vc2);
|
---|
| 1263 | if (leaf2)
|
---|
| 1264 | shuffledCost2 = EvalShuffleCost(leaf2, vc2, vc1);
|
---|
[580] | 1265 |
|
---|
| 1266 | // if cost of shuffle is less than old cost => shuffle
|
---|
| 1267 | if ((oldCost <= shuffledCost1) && (oldCost <= shuffledCost2))
|
---|
| 1268 | return false;
|
---|
| 1269 |
|
---|
| 1270 | if (shuffledCost1 < shuffledCost2)
|
---|
| 1271 | {
|
---|
[586] | 1272 | if (leaf1)
|
---|
| 1273 | ShuffleLeaf(leaf1, vc1, vc2);
|
---|
| 1274 | mc.mInitialLeftViewCell = NULL;
|
---|
[580] | 1275 | }
|
---|
| 1276 | else
|
---|
| 1277 | {
|
---|
[586] | 1278 | if (leaf2)
|
---|
| 1279 | ShuffleLeaf(leaf2, vc2, vc1);
|
---|
| 1280 | mc.mInitialRightViewCell = NULL;
|
---|
[580] | 1281 | }
|
---|
[586] | 1282 |
|
---|
[580] | 1283 | return true;
|
---|
| 1284 | }
|
---|
| 1285 |
|
---|
| 1286 |
|
---|
| 1287 | float ViewCellsTree::GetVariance(ViewCell *vc) const
|
---|
| 1288 | {
|
---|
| 1289 | const int upper = mViewCellsManager->GetMaxPvsSize();
|
---|
| 1290 | const int lower = mViewCellsManager->GetMinPvsSize();
|
---|
| 1291 |
|
---|
| 1292 | if (1)
|
---|
| 1293 | {
|
---|
[752] | 1294 | const float penalty =
|
---|
| 1295 | EvalPvsPenalty(vc->GetPvs().GetSize(), lower, upper);
|
---|
[1141] | 1296 |
|
---|
[752] | 1297 | return (mAvgRenderCost - penalty) * (mAvgRenderCost - penalty) /
|
---|
| 1298 | (float)mNumActiveViewCells;
|
---|
[580] | 1299 | }
|
---|
| 1300 |
|
---|
| 1301 | const float leafCost = GetRenderCost(vc);
|
---|
| 1302 | return (mExpectedCost - leafCost) * (mExpectedCost - leafCost);
|
---|
| 1303 | }
|
---|
| 1304 |
|
---|
| 1305 |
|
---|
| 1306 | float ViewCellsTree::GetDeviation(ViewCell *vc) const
|
---|
| 1307 | {
|
---|
| 1308 | const int upper = mViewCellsManager->GetMaxPvsSize();
|
---|
| 1309 | const int lower = mViewCellsManager->GetMinPvsSize();
|
---|
| 1310 |
|
---|
| 1311 | if (1)
|
---|
| 1312 | {
|
---|
[1168] | 1313 | const float penalty = EvalPvsPenalty(vc->GetPvs().CountObjectsInPvs(), lower, upper);
|
---|
[582] | 1314 | return fabs(mAvgRenderCost - penalty) / (float)mNumActiveViewCells;
|
---|
[580] | 1315 | }
|
---|
| 1316 |
|
---|
| 1317 | const float renderCost = GetRenderCost(vc);
|
---|
| 1318 | return fabs(mExpectedCost - renderCost);
|
---|
| 1319 | }
|
---|
| 1320 |
|
---|
| 1321 |
|
---|
| 1322 | float ViewCellsTree::GetRenderCost(ViewCell *vc) const
|
---|
| 1323 | {
|
---|
| 1324 | if (mUseAreaForPvs)
|
---|
[1141] | 1325 | {
|
---|
[1168] | 1326 | return vc->GetPvs().CountObjectsInPvs() * vc->GetArea();
|
---|
[1141] | 1327 | }
|
---|
[580] | 1328 |
|
---|
[1168] | 1329 | return vc->GetPvs().CountObjectsInPvs() * vc->GetVolume();
|
---|
[580] | 1330 | }
|
---|
| 1331 |
|
---|
| 1332 |
|
---|
| 1333 | float ViewCellsTree::GetCostHeuristics(ViewCell *vc) const
|
---|
| 1334 | {
|
---|
| 1335 | return GetRenderCost(vc) * mRenderCostWeight +
|
---|
| 1336 | GetDeviation(vc) * (1.0f - mRenderCostWeight);
|
---|
| 1337 | }
|
---|
| 1338 |
|
---|
| 1339 |
|
---|
[582] | 1340 | bool ViewCellsTree::ValidateMergeCandidate(MergeCandidate &mc) const
|
---|
[580] | 1341 | {
|
---|
[752] | 1342 | // propagate up so we have only the active view cells
|
---|
[580] | 1343 | while (mc.mLeftViewCell->mParent)
|
---|
| 1344 | {
|
---|
| 1345 | mc.mLeftViewCell = mc.mLeftViewCell->mParent;
|
---|
| 1346 | }
|
---|
| 1347 |
|
---|
| 1348 | while (mc.mRightViewCell->mParent)
|
---|
| 1349 | {
|
---|
| 1350 | mc.mRightViewCell = mc.mRightViewCell->mParent;
|
---|
| 1351 | }
|
---|
| 1352 |
|
---|
[752] | 1353 | // this view cell was already merged
|
---|
| 1354 | //return mc.mLeftViewCell && (mc.mLeftViewCell != mc.mRightViewCell);
|
---|
[582] | 1355 | return mc.mLeftViewCell != mc.mRightViewCell;
|
---|
[580] | 1356 | }
|
---|
| 1357 |
|
---|
| 1358 |
|
---|
| 1359 | void ViewCellsTree::EvalMergeCost(MergeCandidate &mc) const
|
---|
| 1360 | {
|
---|
| 1361 | //-- compute pvs difference
|
---|
[752] | 1362 | int newPvs;
|
---|
| 1363 | if (1) // not valid if not using const cost per object!!
|
---|
| 1364 | newPvs = ComputeMergedPvsSize(mc.mLeftViewCell->GetPvs(), mc.mRightViewCell->GetPvs());
|
---|
| 1365 | else
|
---|
| 1366 | newPvs = (int)ComputeMergedPvsCost(mc.mLeftViewCell->GetPvs(), mc.mRightViewCell->GetPvs());
|
---|
[580] | 1367 |
|
---|
[1141] | 1368 | const float newPenalty = EvalPvsPenalty(newPvs,
|
---|
[729] | 1369 | mViewCellsManager->GetMinPvsSize(),
|
---|
| 1370 | mViewCellsManager->GetMaxPvsSize());
|
---|
| 1371 |
|
---|
[580] | 1372 | ViewCell *vc1 = mc.mLeftViewCell;
|
---|
| 1373 | ViewCell *vc2 = mc.mRightViewCell;
|
---|
| 1374 |
|
---|
| 1375 | //-- compute ratio of old cost
|
---|
| 1376 | // (i.e., added size of left and right view cell times pvs size)
|
---|
| 1377 | // to new rendering cost (i.e, size of merged view cell times pvs size)
|
---|
| 1378 | const float oldCost = GetRenderCost(vc1) + GetRenderCost(vc2);
|
---|
| 1379 |
|
---|
| 1380 | const float newCost = mUseAreaForPvs ?
|
---|
| 1381 | (float)newPenalty * (vc1->GetArea() + vc2->GetArea()) :
|
---|
| 1382 | (float)newPenalty * (vc1->GetVolume() + vc2->GetVolume());
|
---|
| 1383 |
|
---|
| 1384 |
|
---|
| 1385 | // strong penalty if pvs size too large
|
---|
| 1386 | if (0 && (newPvs > mViewCellsManager->GetMaxPvsSize()))
|
---|
| 1387 | {
|
---|
| 1388 | mc.mRenderCost = 1e20f;
|
---|
| 1389 | }
|
---|
| 1390 | else
|
---|
| 1391 | {
|
---|
| 1392 | mc.mRenderCost = (newCost - oldCost) /
|
---|
| 1393 | mViewCellsManager->GetViewSpaceBox().GetVolume();
|
---|
| 1394 | }
|
---|
| 1395 |
|
---|
| 1396 |
|
---|
| 1397 | //-- merge cost also takes deviation into account
|
---|
| 1398 | float newDev, oldDev;
|
---|
| 1399 |
|
---|
| 1400 | if (1)
|
---|
[582] | 1401 | newDev = fabs(mAvgRenderCost - newPenalty) / (float)mNumActiveViewCells;
|
---|
[580] | 1402 | else
|
---|
[582] | 1403 | newDev = fabs(mExpectedCost - newCost) / (float)mNumActiveViewCells;
|
---|
[580] | 1404 |
|
---|
| 1405 | oldDev = GetDeviation(vc1) + GetDeviation(vc2);
|
---|
| 1406 |
|
---|
| 1407 | // compute deviation increase
|
---|
| 1408 | mc.mDeviationIncr = newDev - oldDev;
|
---|
| 1409 |
|
---|
| 1410 | //Debug << "render cost: " << mc.mRenderCost * mRenderCostWeight << endl;
|
---|
| 1411 | //Debug << "standard deviation: " << mc.mDeviationIncr * mRenderCostWeight << endl;
|
---|
| 1412 | }
|
---|
| 1413 |
|
---|
[752] | 1414 |
|
---|
| 1415 | void ViewCellsTree::SetViewCellsStorage(int stype)
|
---|
[580] | 1416 | {
|
---|
[752] | 1417 | if (mViewCellsStorage == stype)
|
---|
| 1418 | return;
|
---|
| 1419 |
|
---|
| 1420 | // TODO
|
---|
| 1421 | switch (stype)
|
---|
[581] | 1422 | {
|
---|
[752] | 1423 | case COMPRESSED:
|
---|
[584] | 1424 | CompressViewCellsPvs(mRoot);
|
---|
[752] | 1425 | break;
|
---|
| 1426 | default:
|
---|
| 1427 | break;
|
---|
[584] | 1428 | }
|
---|
[752] | 1429 |
|
---|
| 1430 | mViewCellsStorage = stype;
|
---|
[584] | 1431 | }
|
---|
[580] | 1432 |
|
---|
[752] | 1433 |
|
---|
[584] | 1434 | void ViewCellsTree::CompressViewCellsPvs(ViewCell *root)
|
---|
| 1435 | {
|
---|
| 1436 | if (!root->IsLeaf())
|
---|
| 1437 | {
|
---|
| 1438 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(root);
|
---|
| 1439 |
|
---|
| 1440 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[585] | 1441 |
|
---|
[584] | 1442 | // compress child sets first
|
---|
| 1443 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
[581] | 1444 | {
|
---|
[584] | 1445 | CompressViewCellsPvs(*it);
|
---|
[581] | 1446 | }
|
---|
[584] | 1447 |
|
---|
[585] | 1448 | // compress root node
|
---|
[610] | 1449 | PullUpVisibility(interior);
|
---|
[581] | 1450 | }
|
---|
[580] | 1451 | }
|
---|
| 1452 |
|
---|
| 1453 |
|
---|
[1166] | 1454 | void ViewCellsTree::UpdateStats(ofstream &stats,
|
---|
| 1455 | const int pass,
|
---|
| 1456 | const int viewCells,
|
---|
| 1457 | const float renderCostDecrease,
|
---|
| 1458 | const float totalRenderCost,
|
---|
| 1459 | const int currentPvs,
|
---|
| 1460 | const float expectedCost,
|
---|
| 1461 | const float avgRenderCost,
|
---|
| 1462 | const float deviation,
|
---|
| 1463 | const int totalPvs,
|
---|
| 1464 | const int entriesInPvs,
|
---|
| 1465 | const int pvsSizeDecr,
|
---|
| 1466 | const float volume)
|
---|
| 1467 | {
|
---|
| 1468 | stats << "#Pass\n" << pass << endl
|
---|
| 1469 | //<< "#Merged\n" << mergeStats.merged << endl
|
---|
| 1470 | << "#ViewCells\n" << viewCells << endl
|
---|
| 1471 | << "#RenderCostDecrease\n" << renderCostDecrease << endl // TODO
|
---|
| 1472 | << "#TotalRenderCost\n" << totalRenderCost << endl
|
---|
| 1473 | << "#CurrentPvs\n" << currentPvs << endl
|
---|
| 1474 | << "#ExpectedCost\n" << expectedCost << endl
|
---|
| 1475 | << "#AvgRenderCost\n" << avgRenderCost << endl
|
---|
| 1476 | << "#Deviation\n" << deviation << endl
|
---|
| 1477 | << "#TotalPvs\n" << totalPvs << endl
|
---|
| 1478 | << "#TotalEntriesInPvs\n" << entriesInPvs << endl
|
---|
| 1479 | << "#PvsSizeDecrease\n" << pvsSizeDecr << endl // TODO
|
---|
| 1480 | << "#Volume\n" << volume << endl
|
---|
| 1481 | << endl;
|
---|
| 1482 | }
|
---|
| 1483 |
|
---|
[660] | 1484 | void ViewCellsTree::ExportStats(const string &mergeStats)
|
---|
[650] | 1485 | {
|
---|
| 1486 | TraversalQueue tqueue;
|
---|
| 1487 |
|
---|
| 1488 | tqueue.push(mRoot);
|
---|
| 1489 | int numViewCells = 1;
|
---|
| 1490 |
|
---|
| 1491 | const AxisAlignedBox3 box = mViewCellsManager->GetViewSpaceBox();
|
---|
| 1492 | const float vol = box.GetVolume();
|
---|
| 1493 |
|
---|
[752] | 1494 | const int rootPvs = GetPvsSize(mRoot);
|
---|
[1161] | 1495 | const int rootEntries = GetPvsEntries(mRoot);
|
---|
[752] | 1496 |
|
---|
[1168] | 1497 | Debug << "******** Export stats **********" << endl;
|
---|
[1161] | 1498 | /*Debug << "vsb volume: " << vol << endl;
|
---|
[693] | 1499 | Debug << "root volume: " << mRoot->GetVolume() << endl;
|
---|
[752] | 1500 | Debug << "root pvs: " << rootPvs << endl;
|
---|
[1161] | 1501 | */
|
---|
[693] | 1502 |
|
---|
[651] | 1503 | float totalRenderCost, avgRenderCost, expectedCost;
|
---|
[650] | 1504 |
|
---|
| 1505 | float deviation = 0;
|
---|
[1166] | 1506 | int totalPvs = rootPvs;
|
---|
| 1507 | int entriesInPvs = rootEntries;
|
---|
| 1508 |
|
---|
[752] | 1509 | totalRenderCost = avgRenderCost = expectedCost = (float)rootPvs;
|
---|
[650] | 1510 |
|
---|
| 1511 | ofstream stats;
|
---|
[660] | 1512 | stats.open(mergeStats.c_str());
|
---|
[650] | 1513 |
|
---|
[752] | 1514 | //-- first view cell
|
---|
[1166] | 1515 | UpdateStats(stats,
|
---|
| 1516 | 0, numViewCells, 0, totalRenderCost,
|
---|
| 1517 | rootPvs, expectedCost, avgRenderCost, deviation,
|
---|
| 1518 | totalPvs, entriesInPvs, 0, mRoot->GetVolume());
|
---|
| 1519 |
|
---|
[650] | 1520 |
|
---|
[1161] | 1521 | //-- go through tree in the order of render cost decrease
|
---|
| 1522 | //-- which is the same order as the view cells were merged
|
---|
| 1523 | //-- or the reverse order of subdivision for subdivision-only
|
---|
| 1524 | //-- view cell hierarchies.
|
---|
[650] | 1525 |
|
---|
| 1526 | while (!tqueue.empty())
|
---|
| 1527 | {
|
---|
| 1528 | ViewCell *vc = tqueue.top();
|
---|
| 1529 | tqueue.pop();
|
---|
| 1530 |
|
---|
| 1531 | if (!vc->IsLeaf())
|
---|
| 1532 | {
|
---|
| 1533 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[1166] | 1534 |
|
---|
[752] | 1535 | const int parentPvs = GetPvsSize(interior);
|
---|
[1166] | 1536 | const int parentPvsEntries = GetPvsEntries(interior);
|
---|
| 1537 | const float parentCost = (float)parentPvs * interior->GetVolume();
|
---|
| 1538 |
|
---|
[650] | 1539 | float childCost = 0;
|
---|
| 1540 | int childPvs = 0;
|
---|
[1166] | 1541 | int childPvsEntries = 0;
|
---|
[650] | 1542 |
|
---|
| 1543 | -- numViewCells;
|
---|
| 1544 |
|
---|
| 1545 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[1179] | 1546 |
|
---|
[650] | 1547 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 1548 | {
|
---|
[1166] | 1549 | ViewCell *vc = *it;
|
---|
[1168] | 1550 |
|
---|
[1166] | 1551 | const int pvsSize = GetPvsSize(vc);
|
---|
| 1552 | const int pvsEntries = GetPvsEntries(vc);
|
---|
| 1553 |
|
---|
| 1554 | childCost += (float) pvsSize * vc->GetVolume();
|
---|
[752] | 1555 | childPvs += pvsSize;
|
---|
[1166] | 1556 | childPvsEntries += pvsEntries;
|
---|
[650] | 1557 |
|
---|
[1166] | 1558 | tqueue.push(vc);
|
---|
[650] | 1559 | ++ numViewCells;
|
---|
| 1560 | }
|
---|
| 1561 |
|
---|
[1179] | 1562 |
|
---|
[650] | 1563 | const float costDecr = (parentCost - childCost) / vol;
|
---|
| 1564 |
|
---|
| 1565 | totalRenderCost -= costDecr;
|
---|
| 1566 | totalPvs += childPvs - parentPvs;
|
---|
[1166] | 1567 | entriesInPvs += childPvsEntries - parentPvsEntries;
|
---|
| 1568 |
|
---|
[650] | 1569 | expectedCost = totalRenderCost / (float)numViewCells;
|
---|
| 1570 | avgRenderCost = (float)totalPvs / (float)numViewCells;
|
---|
| 1571 |
|
---|
[1166] | 1572 | UpdateStats(stats,
|
---|
| 1573 | 0, numViewCells, costDecr, totalRenderCost,
|
---|
| 1574 | parentPvs, expectedCost, avgRenderCost, deviation,
|
---|
| 1575 | totalPvs, entriesInPvs, childPvs - parentPvs,
|
---|
| 1576 | vc->GetVolume());
|
---|
[650] | 1577 |
|
---|
| 1578 | }
|
---|
| 1579 | }
|
---|
| 1580 |
|
---|
| 1581 | stats.close();
|
---|
| 1582 | }
|
---|
| 1583 |
|
---|
| 1584 |
|
---|
| 1585 | void ViewCellsTree::SetRoot(ViewCell *root)
|
---|
| 1586 | {
|
---|
| 1587 | mRoot = root;
|
---|
| 1588 | }
|
---|
| 1589 |
|
---|
[660] | 1590 |
|
---|
[581] | 1591 | void ViewCellsTree::CollectBestViewCellSet(ViewCellContainer &viewCells,
|
---|
| 1592 | const int numViewCells)
|
---|
[580] | 1593 | {
|
---|
| 1594 | TraversalQueue tqueue;
|
---|
[581] | 1595 | tqueue.push(mRoot);
|
---|
[582] | 1596 |
|
---|
[580] | 1597 | while (!tqueue.empty())
|
---|
| 1598 | {
|
---|
| 1599 | ViewCell *vc = tqueue.top();
|
---|
[650] | 1600 | tqueue.pop();
|
---|
| 1601 |
|
---|
[582] | 1602 | // save the view cells if it is a leaf or if enough view cells have already been traversed
|
---|
| 1603 | // because of the priority queue, this will be the optimal set of v
|
---|
[650] | 1604 | if (vc->IsLeaf() || ((viewCells.size() + tqueue.size() + 1) >= numViewCells))
|
---|
[581] | 1605 | {
|
---|
| 1606 | viewCells.push_back(vc);
|
---|
| 1607 | }
|
---|
[582] | 1608 | else
|
---|
| 1609 | {
|
---|
[581] | 1610 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[580] | 1611 |
|
---|
[581] | 1612 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 1613 |
|
---|
| 1614 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 1615 | {
|
---|
| 1616 | tqueue.push(*it);
|
---|
| 1617 | }
|
---|
| 1618 | }
|
---|
[580] | 1619 | }
|
---|
| 1620 | }
|
---|
[581] | 1621 |
|
---|
[580] | 1622 |
|
---|
[610] | 1623 | void ViewCellsTree::PullUpVisibility(ViewCellInterior *interior)
|
---|
[581] | 1624 | {
|
---|
[584] | 1625 | Intersectable::NewMail((int)interior->mChildren.size());
|
---|
[580] | 1626 |
|
---|
[581] | 1627 | ViewCellContainer::const_iterator cit, cit_end = interior->mChildren.end();
|
---|
| 1628 |
|
---|
| 1629 | ObjectPvsMap::const_iterator oit;
|
---|
| 1630 |
|
---|
| 1631 | // mail all objects in the leaf sets
|
---|
[584] | 1632 | // we are interested in the objects which are present in all leaves
|
---|
| 1633 | // => count how often an object is part of a child set
|
---|
[581] | 1634 | for (cit = interior->mChildren.begin(); cit != cit_end; ++ cit)
|
---|
| 1635 | {
|
---|
| 1636 | ViewCell *vc = *cit;
|
---|
| 1637 |
|
---|
| 1638 | ObjectPvsMap::const_iterator oit_end = vc->GetPvs().mEntries.end();
|
---|
| 1639 |
|
---|
| 1640 | for (oit = vc->GetPvs().mEntries.begin(); oit != oit_end; ++ oit)
|
---|
| 1641 | {
|
---|
[584] | 1642 | Intersectable *obj = (*oit).first;
|
---|
| 1643 | if ((cit == interior->mChildren.begin()) && !obj->Mailed())
|
---|
| 1644 | obj->Mail();
|
---|
[581] | 1645 |
|
---|
[584] | 1646 | int incm = obj->IncMail();
|
---|
[581] | 1647 | }
|
---|
| 1648 | }
|
---|
| 1649 |
|
---|
[1189] | 1650 | interior->GetPvs().Clear();
|
---|
[581] | 1651 |
|
---|
[584] | 1652 |
|
---|
[581] | 1653 | // only the objects which are present in all leaf pvs
|
---|
| 1654 | // should remain in the parent pvs
|
---|
[584] | 1655 | // these are the objects which have been mailed in all children
|
---|
[581] | 1656 | for (cit = interior->mChildren.begin(); cit != cit_end; ++ cit)
|
---|
| 1657 | {
|
---|
| 1658 | ViewCell *vc = *cit;
|
---|
| 1659 |
|
---|
| 1660 | ObjectPvsMap::const_iterator oit_end = vc->GetPvs().mEntries.end();
|
---|
| 1661 |
|
---|
| 1662 | for (oit = vc->GetPvs().mEntries.begin(); oit != oit_end; ++ oit)
|
---|
[585] | 1663 | {
|
---|
[581] | 1664 | if ((*oit).first->Mailed((int)interior->mChildren.size()))
|
---|
| 1665 | {
|
---|
| 1666 | interior->GetPvs().AddSample((*oit).first, (*oit).second.mSumPdf);
|
---|
| 1667 | }
|
---|
| 1668 | }
|
---|
| 1669 | }
|
---|
| 1670 |
|
---|
[584] | 1671 |
|
---|
| 1672 | // delete all the objects from the leaf sets which were moved to parent pvs
|
---|
[581] | 1673 | ObjectPvsMap::const_iterator oit_end = interior->GetPvs().mEntries.end();
|
---|
| 1674 |
|
---|
| 1675 | for (oit = interior->GetPvs().mEntries.begin(); oit != oit_end; ++ oit)
|
---|
| 1676 | {
|
---|
| 1677 | for (cit = interior->mChildren.begin(); cit != cit_end; ++ cit)
|
---|
| 1678 | {
|
---|
[584] | 1679 | if (!(*cit)->GetPvs().RemoveSample((*oit).first, Limits::Infinity))
|
---|
[1189] | 1680 | {
|
---|
[584] | 1681 | Debug << "should not come here!" << endl;
|
---|
[1189] | 1682 | }
|
---|
[581] | 1683 | }
|
---|
| 1684 | }
|
---|
| 1685 | }
|
---|
| 1686 |
|
---|
[1168] | 1687 |
|
---|
[1166] | 1688 | // TODO matt: implement this function for different storing methods
|
---|
[584] | 1689 | void ViewCellsTree::GetPvs(ViewCell *vc, ObjectPvs &pvs) const
|
---|
| 1690 | {
|
---|
[1161] | 1691 | // pvs is stored in each cell => just return pvs
|
---|
[752] | 1692 | if (mViewCellsStorage == PVS_IN_INTERIORS)
|
---|
[801] | 1693 | {
|
---|
[585] | 1694 | pvs = vc->GetPvs();
|
---|
[801] | 1695 | return;
|
---|
| 1696 | }
|
---|
[585] | 1697 |
|
---|
[1161] | 1698 |
|
---|
| 1699 | //-- pvs is not stored with the interiors => reconstruct
|
---|
[801] | 1700 | Intersectable::NewMail();
|
---|
| 1701 |
|
---|
[585] | 1702 | int pvsSize = 0;
|
---|
| 1703 | ViewCell *root = vc;
|
---|
| 1704 |
|
---|
[883] | 1705 | // add pvs from this view cell to root
|
---|
[585] | 1706 | while (root->GetParent())
|
---|
[584] | 1707 | {
|
---|
[585] | 1708 | root = root->GetParent();
|
---|
| 1709 | pvs.AddPvs(root->GetPvs());
|
---|
| 1710 | }
|
---|
[584] | 1711 |
|
---|
[883] | 1712 | // add pvs from leaves
|
---|
[585] | 1713 | stack<ViewCell *> tstack;
|
---|
| 1714 | tstack.push(vc);
|
---|
[584] | 1715 |
|
---|
[585] | 1716 | while (!tstack.empty())
|
---|
| 1717 | {
|
---|
| 1718 | vc = tstack.top();
|
---|
| 1719 | tstack.pop();
|
---|
| 1720 |
|
---|
[1161] | 1721 | // add newly found pvs to merged pvs
|
---|
[585] | 1722 | pvs.AddPvs(vc->GetPvs());
|
---|
| 1723 |
|
---|
[1161] | 1724 | if (!vc->IsLeaf()) // interior cells: go down to leaf level
|
---|
[584] | 1725 | {
|
---|
| 1726 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[585] | 1727 |
|
---|
[584] | 1728 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 1729 |
|
---|
| 1730 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 1731 | {
|
---|
[585] | 1732 | tstack.push(*it);
|
---|
| 1733 | }
|
---|
[584] | 1734 | }
|
---|
| 1735 | }
|
---|
| 1736 | }
|
---|
| 1737 |
|
---|
| 1738 |
|
---|
[1166] | 1739 | int ViewCellsTree::GetPvsSizeForLeafStorage(ViewCell *vc) const
|
---|
[584] | 1740 | {
|
---|
[1166] | 1741 | // pvs is always stored directly in leaves
|
---|
| 1742 | if (vc->IsLeaf())
|
---|
| 1743 | {
|
---|
[1168] | 1744 | return vc->GetPvs().CountObjectsInPvs();
|
---|
[1166] | 1745 | }
|
---|
[1168] | 1746 |
|
---|
| 1747 | // interior node
|
---|
| 1748 |
|
---|
| 1749 | // interior nodes: pvs is either stored as a scalar or
|
---|
| 1750 | // has to be reconstructed from the leaves
|
---|
| 1751 |
|
---|
| 1752 | // the stored pvs size is the valid pvs size => just return scalar
|
---|
| 1753 | if (vc->mPvsSizeValid)
|
---|
[1166] | 1754 | {
|
---|
[1168] | 1755 | return vc->mPvsSize;
|
---|
| 1756 | }
|
---|
| 1757 |
|
---|
| 1758 | // if no valid pvs size stored as a scalar =>
|
---|
| 1759 | // compute current pvs size of interior from it's leaf nodes
|
---|
| 1760 | ViewCellContainer leaves;
|
---|
| 1761 | CollectLeaves(vc, leaves);
|
---|
[1121] | 1762 |
|
---|
[1168] | 1763 | ViewCellContainer::const_iterator it, it_end = leaves.end();
|
---|
[1166] | 1764 |
|
---|
[1168] | 1765 | Intersectable::NewMail();
|
---|
| 1766 | ObjectPvs newPvs;
|
---|
[1166] | 1767 |
|
---|
[1168] | 1768 | // sum different intersectables
|
---|
| 1769 | for (it = leaves.begin(); it != it_end; ++ it)
|
---|
| 1770 | {
|
---|
| 1771 | ObjectPvsMap::iterator oit, oit_end = (*it)->GetPvs().mEntries.end();
|
---|
| 1772 |
|
---|
| 1773 | for (oit = (*it)->GetPvs().mEntries.begin(); oit != oit_end; ++ oit)
|
---|
[1166] | 1774 | {
|
---|
[1168] | 1775 | Intersectable *intersect = (*oit).first;
|
---|
| 1776 |
|
---|
| 1777 | if (!intersect->Mailed())
|
---|
| 1778 | {
|
---|
| 1779 | intersect->Mail();
|
---|
| 1780 | newPvs.AddSample(intersect, (*oit).second.mSumPdf);
|
---|
| 1781 | }
|
---|
[1166] | 1782 | }
|
---|
| 1783 | }
|
---|
| 1784 |
|
---|
[1168] | 1785 | return newPvs.CountObjectsInPvs();
|
---|
[1166] | 1786 | }
|
---|
| 1787 |
|
---|
| 1788 |
|
---|
| 1789 | int ViewCellsTree::GetEntriesInPvsForLeafStorage(ViewCell *vc) const
|
---|
| 1790 | {
|
---|
| 1791 | // pvs is always stored directly in leaves
|
---|
| 1792 | if (vc->IsLeaf())
|
---|
[752] | 1793 | {
|
---|
[1168] | 1794 | return vc->GetPvs().GetSize();
|
---|
[1166] | 1795 | }
|
---|
[1168] | 1796 |
|
---|
| 1797 | // interior node
|
---|
| 1798 |
|
---|
| 1799 | // interior nodes: pvs is either stored as a scalar or
|
---|
| 1800 | // has to be reconstructed from the leaves
|
---|
| 1801 |
|
---|
| 1802 | // the stored pvs size is the valid pvs size => just return scalar
|
---|
| 1803 | if (vc->mPvsSizeValid)
|
---|
[1166] | 1804 | {
|
---|
[1168] | 1805 | return vc->mEntriesInPvs;
|
---|
| 1806 | }
|
---|
| 1807 |
|
---|
| 1808 | int pvsSize = 0;
|
---|
[1161] | 1809 |
|
---|
[1168] | 1810 | // if no valid pvs size stored as a scalar =>
|
---|
| 1811 | // compute current pvs size of interior from it's leaf nodes
|
---|
| 1812 | ViewCellContainer leaves;
|
---|
| 1813 | CollectLeaves(vc, leaves);
|
---|
[1161] | 1814 |
|
---|
[1168] | 1815 | ViewCellContainer::const_iterator it, it_end = leaves.end();
|
---|
| 1816 | Intersectable::NewMail();
|
---|
[1161] | 1817 |
|
---|
[1168] | 1818 | // sum different intersectables
|
---|
| 1819 | for (it = leaves.begin(); it != it_end; ++ it)
|
---|
| 1820 | {
|
---|
| 1821 | ObjectPvsMap::iterator oit, oit_end = (*it)->GetPvs().mEntries.end();
|
---|
[1161] | 1822 |
|
---|
[1168] | 1823 | for (oit = (*it)->GetPvs().mEntries.begin(); oit != oit_end; ++ oit)
|
---|
[1166] | 1824 | {
|
---|
[1168] | 1825 | Intersectable *intersect = (*oit).first;
|
---|
| 1826 |
|
---|
| 1827 | if (!intersect->Mailed())
|
---|
| 1828 | {
|
---|
| 1829 | intersect->Mail();
|
---|
| 1830 | ++ pvsSize;
|
---|
| 1831 | }
|
---|
[1166] | 1832 | }
|
---|
| 1833 | }
|
---|
[1161] | 1834 |
|
---|
[1166] | 1835 | return pvsSize;
|
---|
| 1836 | }
|
---|
[1161] | 1837 |
|
---|
| 1838 |
|
---|
[1166] | 1839 | int ViewCellsTree::GetPvsSizeForCompressedStorage(ViewCell *vc) const
|
---|
| 1840 | {
|
---|
| 1841 | int pvsSize = 0;
|
---|
| 1842 |
|
---|
| 1843 | //-- compressed pvs
|
---|
| 1844 |
|
---|
| 1845 | // the stored pvs size is the valid pvs size => just return scalar
|
---|
| 1846 | if (vc->mPvsSizeValid)
|
---|
| 1847 | {
|
---|
| 1848 | pvsSize = vc->mPvsSize;
|
---|
| 1849 | }
|
---|
| 1850 |
|
---|
| 1851 | // if no pvs size stored, compute new one
|
---|
| 1852 | ViewCell *root = vc;
|
---|
| 1853 |
|
---|
| 1854 | // also add pvs from this view cell to root
|
---|
| 1855 | while (root->GetParent())
|
---|
| 1856 | {
|
---|
| 1857 | root = root->GetParent();
|
---|
| 1858 |
|
---|
| 1859 | // matt: bug! must evaluate kd pvss also
|
---|
| 1860 | pvsSize += CountDiffPvs(root);
|
---|
| 1861 | }
|
---|
| 1862 |
|
---|
| 1863 | stack<ViewCell *> tstack;
|
---|
| 1864 | tstack.push(vc);
|
---|
| 1865 |
|
---|
| 1866 | while (!tstack.empty())
|
---|
| 1867 | {
|
---|
| 1868 | vc = tstack.top();
|
---|
| 1869 | tstack.pop();
|
---|
| 1870 | // matt: bug! must evaluate kd pvss also
|
---|
| 1871 | pvsSize += CountDiffPvs(vc);
|
---|
| 1872 |
|
---|
| 1873 | if (!vc->IsLeaf())
|
---|
[1161] | 1874 | {
|
---|
[1166] | 1875 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[1161] | 1876 |
|
---|
[1166] | 1877 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 1878 |
|
---|
| 1879 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
[752] | 1880 | {
|
---|
[1166] | 1881 | tstack.push(*it);
|
---|
| 1882 | }
|
---|
| 1883 | }
|
---|
| 1884 | }
|
---|
[1161] | 1885 |
|
---|
[1166] | 1886 | return pvsSize;
|
---|
| 1887 | }
|
---|
| 1888 |
|
---|
| 1889 |
|
---|
| 1890 | int ViewCellsTree::GetEntriesInPvsForCompressedStorage(ViewCell *vc) const
|
---|
| 1891 | {
|
---|
| 1892 | int pvsSize = 0;
|
---|
| 1893 |
|
---|
| 1894 | //-- compressed pvs
|
---|
| 1895 |
|
---|
| 1896 | // the stored pvs size is the valid pvs size => just return scalar
|
---|
| 1897 | if (vc->mPvsSizeValid)
|
---|
| 1898 | {
|
---|
| 1899 | pvsSize = vc->mEntriesInPvs;
|
---|
| 1900 | }
|
---|
| 1901 |
|
---|
| 1902 | // if no pvs size stored, compute new one
|
---|
| 1903 | ViewCell *root = vc;
|
---|
[752] | 1904 |
|
---|
[1166] | 1905 | // also add pvs from this view cell to root
|
---|
| 1906 | while (root->GetParent())
|
---|
| 1907 | {
|
---|
| 1908 | root = root->GetParent();
|
---|
| 1909 | // count the pvs entries different from the already found ones
|
---|
| 1910 | pvsSize += CountDiffPvs(root);
|
---|
| 1911 | }
|
---|
[585] | 1912 |
|
---|
[1166] | 1913 | stack<ViewCell *> tstack;
|
---|
| 1914 | tstack.push(vc);
|
---|
[719] | 1915 |
|
---|
[1166] | 1916 | while (!tstack.empty())
|
---|
| 1917 | {
|
---|
| 1918 | vc = tstack.top();
|
---|
| 1919 | tstack.pop();
|
---|
[1161] | 1920 |
|
---|
[1166] | 1921 | // count the pvs entries different from the already found ones
|
---|
| 1922 | pvsSize += CountDiffPvs(vc);
|
---|
[752] | 1923 |
|
---|
[1166] | 1924 | if (!vc->IsLeaf())
|
---|
| 1925 | {
|
---|
| 1926 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[1161] | 1927 |
|
---|
[1166] | 1928 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[1161] | 1929 |
|
---|
[1166] | 1930 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 1931 | {
|
---|
| 1932 | tstack.push(*it);
|
---|
| 1933 | }
|
---|
| 1934 | }
|
---|
| 1935 | }
|
---|
| 1936 |
|
---|
| 1937 | return pvsSize;
|
---|
| 1938 | }
|
---|
| 1939 |
|
---|
| 1940 |
|
---|
| 1941 | int ViewCellsTree::GetPvsSize(ViewCell *vc) const
|
---|
| 1942 | {
|
---|
| 1943 | int pvsSize = 0;
|
---|
| 1944 |
|
---|
| 1945 | Intersectable::NewMail();
|
---|
| 1946 |
|
---|
| 1947 | ////////////////////////////////////////////////
|
---|
| 1948 | // for interiors, pvs can be stored using different methods
|
---|
| 1949 | //
|
---|
| 1950 |
|
---|
| 1951 | switch (mViewCellsStorage)
|
---|
| 1952 | {
|
---|
| 1953 | case PVS_IN_LEAVES: //-- store pvs only in leaves
|
---|
| 1954 | {
|
---|
| 1955 | pvsSize = GetPvsSizeForLeafStorage(vc);
|
---|
[1161] | 1956 | break;
|
---|
| 1957 | }
|
---|
[1166] | 1958 | case COMPRESSED:
|
---|
| 1959 | {
|
---|
| 1960 | pvsSize = GetPvsSizeForCompressedStorage(vc);
|
---|
| 1961 | break;
|
---|
| 1962 | }
|
---|
[1161] | 1963 | case PVS_IN_INTERIORS:
|
---|
| 1964 | default:
|
---|
| 1965 | // pvs is stored consistently in the tree up to the root
|
---|
| 1966 | // just return pvs size
|
---|
[1168] | 1967 | pvsSize = vc->GetPvs().CountObjectsInPvs();
|
---|
[1161] | 1968 | break;
|
---|
| 1969 | }
|
---|
| 1970 |
|
---|
| 1971 | return pvsSize;
|
---|
| 1972 | }
|
---|
| 1973 |
|
---|
| 1974 |
|
---|
| 1975 | int ViewCellsTree::GetPvsEntries(ViewCell *vc) const
|
---|
| 1976 | {
|
---|
| 1977 | int pvsSize = 0;
|
---|
| 1978 |
|
---|
| 1979 | Intersectable::NewMail();
|
---|
| 1980 |
|
---|
| 1981 | ////////////////////////////////////////////////
|
---|
| 1982 | // for interiors, pvs can be stored using different methods
|
---|
| 1983 |
|
---|
| 1984 | switch (mViewCellsStorage)
|
---|
| 1985 | {
|
---|
| 1986 | case PVS_IN_LEAVES: //-- store pvs only in leaves
|
---|
| 1987 | {
|
---|
[1166] | 1988 | pvsSize = GetEntriesInPvsForLeafStorage(vc);
|
---|
| 1989 | break;
|
---|
[752] | 1990 | }
|
---|
| 1991 | case COMPRESSED:
|
---|
| 1992 | {
|
---|
[1166] | 1993 | pvsSize = GetEntriesInPvsForCompressedStorage(vc);
|
---|
[752] | 1994 | break;
|
---|
| 1995 | }
|
---|
| 1996 | case PVS_IN_INTERIORS:
|
---|
[997] | 1997 | default:
|
---|
[1161] | 1998 | // pvs is stored consistently in the tree up to the root
|
---|
| 1999 | // just return pvs size
|
---|
| 2000 | pvsSize = vc->GetPvs().GetSize();
|
---|
| 2001 | break;
|
---|
[752] | 2002 | }
|
---|
[584] | 2003 |
|
---|
| 2004 | return pvsSize;
|
---|
| 2005 | }
|
---|
| 2006 |
|
---|
| 2007 |
|
---|
| 2008 | float ViewCellsTree::GetMemoryCost(ViewCell *vc) const
|
---|
| 2009 | {
|
---|
| 2010 | const float entrySize =
|
---|
[1189] | 2011 | sizeof(PvsData) + sizeof(Intersectable *);
|
---|
[584] | 2012 |
|
---|
[1161] | 2013 | return (float)GetStoredPvsEntriesNum(vc) * entrySize;
|
---|
[584] | 2014 | }
|
---|
| 2015 |
|
---|
| 2016 |
|
---|
[1161] | 2017 | int ViewCellsTree::GetStoredPvsEntriesNum(ViewCell *root) const
|
---|
[584] | 2018 | {
|
---|
[1161] | 2019 | int pvsSize = root->GetPvs().GetSize();
|
---|
[584] | 2020 |
|
---|
[1161] | 2021 | // recursivly count leaves
|
---|
| 2022 | if (!root->IsLeaf())
|
---|
[584] | 2023 | {
|
---|
[1161] | 2024 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(root);
|
---|
[584] | 2025 |
|
---|
| 2026 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2027 |
|
---|
| 2028 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2029 | {
|
---|
[1161] | 2030 | pvsSize += GetStoredPvsEntriesNum(*it);
|
---|
[584] | 2031 | }
|
---|
| 2032 | }
|
---|
| 2033 |
|
---|
| 2034 | return pvsSize;
|
---|
| 2035 | }
|
---|
| 2036 |
|
---|
| 2037 |
|
---|
[752] | 2038 | int ViewCellsTree::ViewCellsStorage() const
|
---|
[584] | 2039 | {
|
---|
[752] | 2040 | return mViewCellsStorage;
|
---|
[584] | 2041 | }
|
---|
| 2042 |
|
---|
| 2043 |
|
---|
[881] | 2044 | ViewCell *ViewCellsTree::GetActiveViewCell(ViewCellLeaf *vc) const
|
---|
[590] | 2045 | {
|
---|
[881] | 2046 | return vc->GetActiveViewCell();
|
---|
[590] | 2047 | }
|
---|
| 2048 |
|
---|
| 2049 |
|
---|
[651] | 2050 | void ViewCellsTree::PropagatePvs(ViewCell *vc)
|
---|
[664] | 2051 | {
|
---|
| 2052 | ViewCell *viewCell = vc;
|
---|
| 2053 |
|
---|
[660] | 2054 | // propagate pvs up
|
---|
[664] | 2055 | while (viewCell->GetParent())
|
---|
[610] | 2056 | {
|
---|
[664] | 2057 | viewCell->GetParent()->GetPvs().Merge(vc->GetPvs());
|
---|
| 2058 | viewCell = viewCell->GetParent();
|
---|
[610] | 2059 | }
|
---|
[651] | 2060 |
|
---|
| 2061 | if (vc->IsLeaf())
|
---|
| 2062 | return;
|
---|
| 2063 |
|
---|
[660] | 2064 | // propagate pvs to the leaves
|
---|
[651] | 2065 | stack<ViewCell *> tstack;
|
---|
| 2066 | tstack.push(vc);
|
---|
| 2067 |
|
---|
| 2068 | while (!tstack.empty())
|
---|
| 2069 | {
|
---|
| 2070 | ViewCell *viewCell = tstack.top();
|
---|
| 2071 | tstack.pop();
|
---|
| 2072 |
|
---|
| 2073 | if (viewCell != vc)
|
---|
| 2074 | {
|
---|
| 2075 | viewCell->GetPvs().Merge(vc->GetPvs());
|
---|
| 2076 | }
|
---|
| 2077 |
|
---|
| 2078 | if (!viewCell->IsLeaf())
|
---|
| 2079 | {
|
---|
| 2080 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(viewCell);
|
---|
[664] | 2081 |
|
---|
[651] | 2082 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2083 |
|
---|
| 2084 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2085 | {
|
---|
| 2086 | tstack.push(*it);
|
---|
| 2087 | }
|
---|
| 2088 | }
|
---|
| 2089 | }
|
---|
[610] | 2090 | }
|
---|
[605] | 2091 |
|
---|
[610] | 2092 |
|
---|
[650] | 2093 | void ViewCellsTree::AssignRandomColors()
|
---|
[608] | 2094 | {
|
---|
[675] | 2095 | TraversalQueue tqueue;
|
---|
| 2096 |
|
---|
| 2097 | tqueue.push(mRoot);
|
---|
[708] | 2098 |
|
---|
[675] | 2099 | mRoot->SetColor(RandomColor(0.3f, 1.0f));
|
---|
| 2100 |
|
---|
| 2101 | while (!tqueue.empty())
|
---|
[608] | 2102 | {
|
---|
[675] | 2103 | ViewCell *vc = tqueue.top();
|
---|
| 2104 | tqueue.pop();
|
---|
[650] | 2105 |
|
---|
[675] | 2106 | // save the view cells if it is a leaf or if enough view cells have already been traversed
|
---|
| 2107 | // because of the priority queue, this will be the optimal set of v
|
---|
| 2108 | if (!vc->IsLeaf())
|
---|
| 2109 | {
|
---|
| 2110 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
| 2111 |
|
---|
| 2112 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2113 |
|
---|
| 2114 | float maxProbability = -1.0f;
|
---|
| 2115 |
|
---|
| 2116 | ViewCell *maxViewCell = NULL;
|
---|
| 2117 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2118 | {
|
---|
| 2119 | ViewCell *v = *it;
|
---|
| 2120 |
|
---|
| 2121 | // set random color
|
---|
| 2122 | v->SetColor(RandomColor(0.3f, 1.0f));
|
---|
| 2123 |
|
---|
| 2124 | if (v->GetVolume() > maxProbability)
|
---|
| 2125 | {
|
---|
| 2126 | maxProbability = v->GetVolume();
|
---|
| 2127 | maxViewCell = v;
|
---|
| 2128 | }
|
---|
| 2129 |
|
---|
| 2130 | if (maxViewCell)
|
---|
[708] | 2131 | {
|
---|
[675] | 2132 | maxViewCell->SetColor(vc->GetColor());
|
---|
[708] | 2133 | }
|
---|
[675] | 2134 |
|
---|
| 2135 | tqueue.push(v);
|
---|
| 2136 | }
|
---|
| 2137 | }
|
---|
[608] | 2138 | }
|
---|
| 2139 | }
|
---|
| 2140 |
|
---|
[675] | 2141 |
|
---|
[1161] | 2142 | /** Get costs resulting from each merge step.
|
---|
| 2143 | */
|
---|
[608] | 2144 | void
|
---|
| 2145 | ViewCellsTree::GetCostFunction(vector<float> &costFunction)
|
---|
| 2146 | {
|
---|
[1161] | 2147 | TraversalQueue tqueue;
|
---|
| 2148 | tqueue.push(mRoot);
|
---|
| 2149 |
|
---|
| 2150 | while (!tqueue.empty())
|
---|
| 2151 | {
|
---|
| 2152 | ViewCell *vc = tqueue.top();
|
---|
| 2153 | tqueue.pop();
|
---|
| 2154 | // save the view cells if it is a leaf or if enough view cells have already been traversed
|
---|
| 2155 | // because of the priority queue, this will be the optimal set of v
|
---|
| 2156 | if (!vc->IsLeaf()) {
|
---|
| 2157 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
| 2158 | costFunction.push_back(interior->GetMergeCost());
|
---|
| 2159 |
|
---|
| 2160 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2161 |
|
---|
| 2162 | for (it = interior->mChildren.begin(); it != it_end; ++ it) {
|
---|
| 2163 | tqueue.push(*it);
|
---|
| 2164 | }
|
---|
| 2165 |
|
---|
| 2166 | }
|
---|
[608] | 2167 | }
|
---|
| 2168 | }
|
---|
| 2169 |
|
---|
| 2170 |
|
---|
[1161] | 2171 | void ViewCellsTree::UpdateViewCellsStats(ViewCell *vc,
|
---|
| 2172 | ViewCellsStatistics &vcStat)
|
---|
[605] | 2173 | {
|
---|
| 2174 | ++ vcStat.viewCells;
|
---|
| 2175 |
|
---|
| 2176 | const int pvsSize = GetPvsSize(vc);
|
---|
| 2177 |
|
---|
[613] | 2178 | vcStat.pvsSize += pvsSize;
|
---|
[605] | 2179 |
|
---|
| 2180 | if (pvsSize == 0)
|
---|
| 2181 | ++ vcStat.emptyPvs;
|
---|
| 2182 |
|
---|
| 2183 | if (pvsSize > vcStat.maxPvs)
|
---|
| 2184 | vcStat.maxPvs = pvsSize;
|
---|
| 2185 |
|
---|
| 2186 | if (pvsSize < vcStat.minPvs)
|
---|
| 2187 | vcStat.minPvs = pvsSize;
|
---|
| 2188 |
|
---|
| 2189 | if (!vc->GetValid())
|
---|
| 2190 | ++ vcStat.invalid;
|
---|
| 2191 | }
|
---|
| 2192 |
|
---|
[1161] | 2193 |
|
---|
[1201] | 2194 | bool ViewCellsTree::Export(OUT_STREAM &stream, const bool exportPvs)
|
---|
[610] | 2195 | {
|
---|
[840] | 2196 | // export recursivly all view cells from the root
|
---|
[844] | 2197 | ExportViewCell(mRoot, stream, exportPvs);
|
---|
[605] | 2198 |
|
---|
[610] | 2199 | return true;
|
---|
| 2200 | }
|
---|
| 2201 |
|
---|
| 2202 |
|
---|
[651] | 2203 | void ViewCellsTree::CreateUniqueViewCellsIds()
|
---|
[610] | 2204 | {
|
---|
[651] | 2205 | stack<ViewCell *> tstack;
|
---|
[610] | 2206 |
|
---|
[651] | 2207 | int currentId = 0;
|
---|
| 2208 |
|
---|
| 2209 | tstack.push(mRoot);
|
---|
| 2210 |
|
---|
| 2211 | while (!tstack.empty())
|
---|
[610] | 2212 | {
|
---|
[651] | 2213 | ViewCell *vc = tstack.top();
|
---|
| 2214 | tstack.pop();
|
---|
| 2215 |
|
---|
| 2216 | vc->SetId(currentId ++);
|
---|
| 2217 |
|
---|
| 2218 | if (!vc->IsLeaf())
|
---|
| 2219 | {
|
---|
| 2220 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
[1161] | 2221 |
|
---|
[651] | 2222 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2223 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2224 | {
|
---|
| 2225 | tstack.push(*it);
|
---|
| 2226 | }
|
---|
| 2227 | }
|
---|
[610] | 2228 | }
|
---|
[651] | 2229 | }
|
---|
[610] | 2230 |
|
---|
[1201] | 2231 |
|
---|
| 2232 | void ViewCellsTree::ExportPvs(ViewCell *viewCell, OUT_STREAM &stream)
|
---|
[651] | 2233 | {
|
---|
| 2234 | ObjectPvsMap::iterator it, it_end = viewCell->GetPvs().mEntries.end();
|
---|
| 2235 |
|
---|
[837] | 2236 | for (it = viewCell->GetPvs().mEntries.begin(); it != it_end; ++ it)
|
---|
| 2237 | {
|
---|
[840] | 2238 | stream << (*it).first->GetId() << " ";
|
---|
[837] | 2239 | }
|
---|
| 2240 | }
|
---|
| 2241 |
|
---|
[1201] | 2242 |
|
---|
| 2243 | void ViewCellsTree::ExportViewCell(ViewCell *viewCell,
|
---|
| 2244 | OUT_STREAM &stream,
|
---|
| 2245 | const bool exportPvs)
|
---|
[837] | 2246 | {
|
---|
[610] | 2247 | if (viewCell->IsLeaf())
|
---|
| 2248 | {
|
---|
| 2249 | stream << "<Leaf ";
|
---|
| 2250 | stream << "id=\"" << viewCell->GetId() << "\" ";
|
---|
[881] | 2251 | stream << "active=\"" << dynamic_cast<ViewCellLeaf *>(viewCell)->GetActiveViewCell()->GetId() << "\" ";
|
---|
[610] | 2252 | stream << "mergecost=\"" << viewCell->GetMergeCost() << "\" ";
|
---|
| 2253 | stream << "pvs=\"";
|
---|
[837] | 2254 |
|
---|
| 2255 | //-- export pvs
|
---|
[844] | 2256 | if (exportPvs)
|
---|
[955] | 2257 | {
|
---|
[840] | 2258 | ExportPvs(viewCell, stream);
|
---|
[955] | 2259 | }
|
---|
| 2260 |
|
---|
[651] | 2261 | stream << "\" />" << endl;
|
---|
[610] | 2262 | }
|
---|
| 2263 | else
|
---|
| 2264 | {
|
---|
| 2265 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(viewCell);
|
---|
| 2266 |
|
---|
| 2267 | stream << "<Interior ";
|
---|
| 2268 | stream << "id=\"" << viewCell->GetId() << "\" ";
|
---|
| 2269 | stream << "mergecost=\"" << viewCell->GetMergeCost() << "\" ";
|
---|
[870] | 2270 | stream << "pvs=\"";
|
---|
| 2271 |
|
---|
[837] | 2272 | //-- NOTE: do not export pvss for interior view cells because
|
---|
[870] | 2273 | // they can be completely reconstructed from the leaf pvss
|
---|
[837] | 2274 | if (0)
|
---|
[840] | 2275 | ExportPvs(viewCell, stream);
|
---|
[870] | 2276 |
|
---|
[651] | 2277 | stream << "\" >" << endl;
|
---|
| 2278 |
|
---|
[837] | 2279 | //-- recursivly export child view cells
|
---|
[610] | 2280 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
| 2281 |
|
---|
| 2282 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2283 | {
|
---|
[844] | 2284 | ExportViewCell(*it, stream, exportPvs);
|
---|
[610] | 2285 | }
|
---|
| 2286 |
|
---|
| 2287 | stream << "</Interior>" << endl;
|
---|
| 2288 | }
|
---|
| 2289 | }
|
---|
| 2290 |
|
---|
| 2291 |
|
---|
[660] | 2292 | void ViewCellsTree::ResetPvs()
|
---|
| 2293 | {
|
---|
| 2294 | stack<ViewCell *> tstack;
|
---|
[610] | 2295 |
|
---|
[660] | 2296 | tstack.push(mRoot);
|
---|
| 2297 |
|
---|
| 2298 | while (!tstack.empty())
|
---|
| 2299 | {
|
---|
| 2300 | ViewCell *vc = tstack.top();
|
---|
| 2301 | tstack.pop();
|
---|
| 2302 |
|
---|
[1189] | 2303 | vc->GetPvs().Clear();
|
---|
[666] | 2304 |
|
---|
[660] | 2305 | if (!vc->IsLeaf())
|
---|
| 2306 | {
|
---|
| 2307 | ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
|
---|
| 2308 | ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
|
---|
[666] | 2309 |
|
---|
[660] | 2310 | for (it = interior->mChildren.begin(); it != it_end; ++ it)
|
---|
| 2311 | {
|
---|
| 2312 | tstack.push(*it);
|
---|
| 2313 | }
|
---|
| 2314 | }
|
---|
| 2315 | }
|
---|
| 2316 | }
|
---|
| 2317 |
|
---|
| 2318 |
|
---|
| 2319 | void ViewCellsTree::SetActiveSetToLeaves()
|
---|
| 2320 | {
|
---|
[752] | 2321 | // todo
|
---|
[660] | 2322 | }
|
---|
| 2323 |
|
---|
[580] | 2324 | /**************************************************************************/
|
---|
| 2325 | /* MergeCandidate implementation */
|
---|
| 2326 | /**************************************************************************/
|
---|
| 2327 |
|
---|
| 2328 |
|
---|
| 2329 | MergeCandidate::MergeCandidate(ViewCell *l, ViewCell *r):
|
---|
| 2330 | mRenderCost(0),
|
---|
| 2331 | mDeviationIncr(0),
|
---|
| 2332 | mLeftViewCell(l),
|
---|
[586] | 2333 | mRightViewCell(r),
|
---|
| 2334 | mInitialLeftViewCell(l),
|
---|
| 2335 | mInitialRightViewCell(r)
|
---|
[580] | 2336 | {
|
---|
| 2337 | //EvalMergeCost();
|
---|
| 2338 | }
|
---|
| 2339 |
|
---|
| 2340 |
|
---|
| 2341 | void MergeCandidate::SetRightViewCell(ViewCell *v)
|
---|
| 2342 | {
|
---|
| 2343 | mRightViewCell = v;
|
---|
| 2344 | }
|
---|
| 2345 |
|
---|
| 2346 |
|
---|
| 2347 | void MergeCandidate::SetLeftViewCell(ViewCell *v)
|
---|
| 2348 | {
|
---|
| 2349 | mLeftViewCell = v;
|
---|
| 2350 | }
|
---|
| 2351 |
|
---|
| 2352 |
|
---|
| 2353 | ViewCell *MergeCandidate::GetRightViewCell() const
|
---|
| 2354 | {
|
---|
| 2355 | return mRightViewCell;
|
---|
| 2356 | }
|
---|
| 2357 |
|
---|
| 2358 |
|
---|
| 2359 | ViewCell *MergeCandidate::GetLeftViewCell() const
|
---|
| 2360 | {
|
---|
| 2361 | return mLeftViewCell;
|
---|
| 2362 | }
|
---|
| 2363 |
|
---|
| 2364 |
|
---|
| 2365 | ViewCell *MergeCandidate::GetInitialRightViewCell() const
|
---|
| 2366 | {
|
---|
| 2367 | return mInitialRightViewCell;
|
---|
| 2368 | }
|
---|
| 2369 |
|
---|
| 2370 |
|
---|
| 2371 | ViewCell *MergeCandidate::GetInitialLeftViewCell() const
|
---|
| 2372 | {
|
---|
| 2373 | return mInitialLeftViewCell;
|
---|
| 2374 | }
|
---|
| 2375 |
|
---|
| 2376 |
|
---|
| 2377 | bool MergeCandidate::IsValid() const
|
---|
| 2378 | {
|
---|
[752] | 2379 | // if one has a parent, it was already merged
|
---|
[1002] | 2380 | return !(mLeftViewCell->GetParent() || mRightViewCell->GetParent());
|
---|
[580] | 2381 | }
|
---|
| 2382 |
|
---|
| 2383 |
|
---|
| 2384 | float MergeCandidate::GetRenderCost() const
|
---|
| 2385 | {
|
---|
| 2386 | return mRenderCost;
|
---|
| 2387 | }
|
---|
| 2388 |
|
---|
| 2389 |
|
---|
| 2390 | float MergeCandidate::GetDeviationIncr() const
|
---|
| 2391 | {
|
---|
| 2392 | return mDeviationIncr;
|
---|
| 2393 | }
|
---|
| 2394 |
|
---|
| 2395 |
|
---|
| 2396 | float MergeCandidate::GetMergeCost() const
|
---|
| 2397 | {
|
---|
| 2398 | return mRenderCost * sRenderCostWeight +
|
---|
| 2399 | mDeviationIncr * (1.0f - sRenderCostWeight);
|
---|
| 2400 | }
|
---|
| 2401 |
|
---|
| 2402 |
|
---|
[605] | 2403 |
|
---|
[610] | 2404 |
|
---|
| 2405 |
|
---|
| 2406 |
|
---|
[580] | 2407 | /************************************************************************/
|
---|
| 2408 | /* MergeStatistics implementation */
|
---|
| 2409 | /************************************************************************/
|
---|
| 2410 |
|
---|
| 2411 |
|
---|
| 2412 | void MergeStatistics::Print(ostream &app) const
|
---|
| 2413 | {
|
---|
| 2414 | app << "===== Merge statistics ===============\n";
|
---|
| 2415 |
|
---|
| 2416 | app << setprecision(4);
|
---|
| 2417 |
|
---|
| 2418 | app << "#N_CTIME ( Overall time [s] )\n" << Time() << " \n";
|
---|
| 2419 |
|
---|
| 2420 | app << "#N_CCTIME ( Collect candidates time [s] )\n" << collectTime * 1e-3f << " \n";
|
---|
| 2421 |
|
---|
| 2422 | app << "#N_MTIME ( Merge time [s] )\n" << mergeTime * 1e-3f << " \n";
|
---|
| 2423 |
|
---|
| 2424 | app << "#N_NODES ( Number of nodes before merge )\n" << nodes << "\n";
|
---|
| 2425 |
|
---|
| 2426 | app << "#N_CANDIDATES ( Number of merge candidates )\n" << candidates << "\n";
|
---|
| 2427 |
|
---|
| 2428 | app << "#N_MERGEDSIBLINGS ( Number of merged siblings )\n" << siblings << "\n";
|
---|
| 2429 |
|
---|
| 2430 | app << "#OVERALLCOST ( overall merge cost )\n" << overallCost << "\n";
|
---|
| 2431 |
|
---|
| 2432 | app << "#N_MERGEDNODES ( Number of merged nodes )\n" << merged << "\n";
|
---|
| 2433 |
|
---|
| 2434 | app << "#MAX_TREEDIST ( Maximal distance in tree of merged leaves )\n" << maxTreeDist << "\n";
|
---|
| 2435 |
|
---|
| 2436 | app << "#AVG_TREEDIST ( Average distance in tree of merged leaves )\n" << AvgTreeDist() << "\n";
|
---|
| 2437 |
|
---|
| 2438 | app << "#EXPECTEDCOST ( expected render cost )\n" << expectedRenderCost << "\n";
|
---|
| 2439 |
|
---|
| 2440 | app << "#DEVIATION ( deviation )\n" << deviation << "\n";
|
---|
| 2441 |
|
---|
| 2442 | app << "#HEURISTICS ( heuristics )\n" << heuristics << "\n";
|
---|
| 2443 |
|
---|
| 2444 |
|
---|
| 2445 | app << "===== END OF BspTree statistics ==========\n";
|
---|
[608] | 2446 | }
|
---|
[860] | 2447 |
|
---|
[1199] | 2448 | }
|
---|