[177] | 1 | #ifndef __PVS_H
|
---|
| 2 | #define __PVS_H
|
---|
| 3 |
|
---|
| 4 | #include <map>
|
---|
[469] | 5 | #include <vector>
|
---|
[177] | 6 |
|
---|
[860] | 7 | namespace GtpVisibilityPreprocessor {
|
---|
| 8 |
|
---|
[177] | 9 | class KdNode;
|
---|
[240] | 10 | class BspNode;
|
---|
[191] | 11 | class Ray;
|
---|
[308] | 12 | class Intersectable;
|
---|
[1077] | 13 | class ViewCell;
|
---|
[177] | 14 |
|
---|
[1077] | 15 |
|
---|
[310] | 16 | template<typename T>
|
---|
| 17 | struct LtSample {
|
---|
[311] | 18 | bool operator()(const T a, const T b) const
|
---|
[310] | 19 | {
|
---|
| 20 | return a < b;
|
---|
| 21 | }
|
---|
| 22 | };
|
---|
| 23 |
|
---|
[469] | 24 | /** Information stored with a PVS entry. Consists of the number
|
---|
| 25 | the object was seen from the view cell.
|
---|
| 26 | */
|
---|
[310] | 27 |
|
---|
| 28 | template<typename T>
|
---|
| 29 | struct PvsData {
|
---|
[1184] | 30 | ////////////////////////////
|
---|
| 31 | // Mailing stuff
|
---|
| 32 | protected:
|
---|
| 33 | int mMailbox;
|
---|
| 34 |
|
---|
| 35 | public:
|
---|
| 36 | // last mail id -> warning not thread safe!
|
---|
| 37 | // both mailId and mailbox should be unique for each thread!!!
|
---|
| 38 | static int sMailId;
|
---|
| 39 | static int sReservedMailboxes;
|
---|
| 40 |
|
---|
| 41 |
|
---|
| 42 | static void NewMail(const int reserve = 1) {
|
---|
| 43 | sMailId += sReservedMailboxes;
|
---|
| 44 | sReservedMailboxes = reserve;
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | void Mail() { mMailbox = sMailId; }
|
---|
| 48 | bool Mailed() const { return mMailbox == sMailId; }
|
---|
| 49 |
|
---|
| 50 | void Mail(const int mailbox) { mMailbox = sMailId + mailbox; }
|
---|
| 51 | bool Mailed(const int mailbox) const { return mMailbox == sMailId + mailbox; }
|
---|
| 52 |
|
---|
| 53 | int IncMail() { return ++ mMailbox - sMailId; }
|
---|
| 54 | //////////////////////////////////////////
|
---|
| 55 |
|
---|
[556] | 56 | // sum of probability density of visible sample rays
|
---|
| 57 | float mSumPdf;
|
---|
[1184] | 58 |
|
---|
[310] | 59 | PvsData<T>() {}
|
---|
[556] | 60 | PvsData<T>(const float sumPdf):
|
---|
| 61 | mSumPdf(sumPdf) {}
|
---|
| 62 |
|
---|
| 63 | // $$JB in order to return meaningfull values
|
---|
| 64 | // it assumes that the sum pdf has been normalized somehow!!!
|
---|
[1184] | 65 | float GetVisibility()
|
---|
| 66 | {
|
---|
| 67 | return mSumPdf;
|
---|
| 68 | }
|
---|
[310] | 69 | };
|
---|
| 70 |
|
---|
[1184] | 71 | template<typename T> int PvsData<T>::sMailId = 1;
|
---|
| 72 | template<typename T> int PvsData<T>::sReservedMailboxes = 1;
|
---|
| 73 |
|
---|
[469] | 74 | /** Template class representing the Potentially Visible Set (PVS)
|
---|
| 75 | mainly from a view cell, but also e.g., from objects.
|
---|
| 76 | */
|
---|
[310] | 77 | template<typename T>
|
---|
[311] | 78 | class Pvs
|
---|
[310] | 79 | {
|
---|
| 80 | public:
|
---|
[469] | 81 | Pvs(): /*mSamples(0), */mEntries() {}
|
---|
[466] | 82 |
|
---|
[469] | 83 | //int mSamples;
|
---|
[466] | 84 |
|
---|
[469] | 85 | /** Compresses PVS lossless or lossy.
|
---|
| 86 | */
|
---|
[466] | 87 | int Compress() {return 0;}
|
---|
| 88 | int GetSize() const {return (int)mEntries.size();}
|
---|
[469] | 89 | bool Empty() const {return mEntries.empty();}
|
---|
[556] | 90 |
|
---|
| 91 | /** Normalize the visibility of entries in order to get comparable
|
---|
[1141] | 92 | results
|
---|
| 93 | */
|
---|
[556] | 94 | void NormalizeMaximum();
|
---|
| 95 |
|
---|
[610] | 96 | /** Merges pvs of a into this pvs.
|
---|
[466] | 97 | */
|
---|
[610] | 98 | void Merge(const Pvs<T> &a);
|
---|
[469] | 99 |
|
---|
[466] | 100 | /** Difference of pvs to pvs b.
|
---|
| 101 | @returns number of different entries.
|
---|
| 102 | */
|
---|
| 103 | int Diff(const Pvs<T> &b);
|
---|
| 104 |
|
---|
[469] | 105 | /** Finds sample in PVS.
|
---|
| 106 | @returns sample if found, NULL otherwise.
|
---|
| 107 | */
|
---|
[466] | 108 | PvsData<T> *Find(T sample);
|
---|
[492] | 109 |
|
---|
[556] | 110 | bool GetSampleContribution(T sample, const float pdf, float &contribution);
|
---|
[469] | 111 |
|
---|
| 112 | /** Adds sample to PVS.
|
---|
| 113 | @contribution contribution of sample (0 or 1)
|
---|
| 114 | @returns true if sample was not already in PVS.
|
---|
| 115 | */
|
---|
[556] | 116 | bool AddSample(T sample, const float pdf, float &contribution);
|
---|
[469] | 117 |
|
---|
| 118 | /** Adds sample to PVS.
|
---|
| 119 | @returns contribution of sample (0 or 1)
|
---|
| 120 | */
|
---|
[556] | 121 | float AddSample(T sample, const float pdf);
|
---|
[492] | 122 |
|
---|
[1184] | 123 | /** Adds sample to PVS.
|
---|
| 124 | @returns PvsData
|
---|
| 125 | */
|
---|
| 126 | PvsData<T> *AddSample2(T sample, const float pdf);
|
---|
| 127 |
|
---|
[485] | 128 | /** Adds one pvs to another one.
|
---|
| 129 | @returns new pvs size
|
---|
| 130 | */
|
---|
| 131 | int AddPvs(const Pvs<T> &pvs);
|
---|
[752] | 132 |
|
---|
[485] | 133 | /** Subtracts one pvs from another one.
|
---|
[752] | 134 | WARNING: could contains bugs
|
---|
[485] | 135 | @returns new pvs size
|
---|
| 136 | */
|
---|
| 137 | int SubtractPvs(const Pvs<T> &pvs);
|
---|
[469] | 138 | /** Returns PVS data, i.e., how often it was seen from the view cell,
|
---|
| 139 | and the object itsef.
|
---|
| 140 | */
|
---|
[466] | 141 | void GetData(const int index, T &entry, PvsData<T> &data);
|
---|
[469] | 142 |
|
---|
| 143 | /** Collects the PVS entries and returns them in the vector.
|
---|
| 144 | */
|
---|
| 145 | void CollectEntries(std::vector<T> &entries);
|
---|
| 146 |
|
---|
[485] | 147 | /** Removes sample from PVS if reference count is zero.
|
---|
[1089] | 148 | @param visibleSamples number of references to be removed
|
---|
[485] | 149 | */
|
---|
[556] | 150 | bool RemoveSample(T sample, const float pdf);
|
---|
[485] | 151 |
|
---|
[677] | 152 | /** Compute continuous PVS difference */
|
---|
[704] | 153 | void ComputeContinuousPvsDifference(Pvs<T> &pvs,
|
---|
[677] | 154 | float &pvsReduction,
|
---|
| 155 | float &pvsEnlargement);
|
---|
| 156 |
|
---|
| 157 |
|
---|
[752] | 158 | /** Clears the pvs.
|
---|
| 159 | */
|
---|
| 160 | void Clear();
|
---|
| 161 |
|
---|
[695] | 162 | /** Compute continuous PVS difference */
|
---|
[704] | 163 | float GetPvsHomogenity(Pvs<T> &pvs) {
|
---|
[695] | 164 | float
|
---|
| 165 | pvsReduction,
|
---|
| 166 | pvsEnlargement;
|
---|
[713] | 167 |
|
---|
[695] | 168 | ComputeContinuousPvsDifference(pvs,
|
---|
| 169 | pvsReduction,
|
---|
| 170 | pvsEnlargement);
|
---|
[713] | 171 |
|
---|
[695] | 172 | return pvsReduction + pvsEnlargement;
|
---|
| 173 | }
|
---|
| 174 |
|
---|
[677] | 175 |
|
---|
| 176 |
|
---|
[469] | 177 | /// Map of PVS entries
|
---|
[466] | 178 | std::map<T, PvsData<T>, LtSample<T> > mEntries;
|
---|
[310] | 179 | };
|
---|
| 180 |
|
---|
[581] | 181 |
|
---|
[677] | 182 |
|
---|
[695] | 183 | /**
|
---|
| 184 | Compute continuous PVS difference of 'b' with respect to the base PVS (*this).
|
---|
| 185 | Provides separatelly PVS reduction from PVS enlargement.
|
---|
| 186 |
|
---|
| 187 | */
|
---|
[341] | 188 | template <typename T>
|
---|
[677] | 189 | void
|
---|
[704] | 190 | Pvs<T>::ComputeContinuousPvsDifference(Pvs<T> &b,
|
---|
[677] | 191 | float &pvsReduction,
|
---|
| 192 | float &pvsEnlargement)
|
---|
| 193 | {
|
---|
[705] | 194 | pvsReduction = 0.0f;
|
---|
| 195 | pvsEnlargement = 0.0f;
|
---|
[695] | 196 | // Uses sum of log differences, which corresponds to entropy
|
---|
[704] | 197 | std::map<T, PvsData<T>, LtSample<T> >::iterator it;
|
---|
[677] | 198 |
|
---|
[704] | 199 | for (it = b.mEntries.begin();
|
---|
| 200 | it != b.mEntries.end(); ++ it) {
|
---|
[695] | 201 | float bSumPdf = (*it).second.mSumPdf;
|
---|
| 202 | float aSumPdf = 0.0f;
|
---|
| 203 | PvsData<T> *data = Find((*it).first);
|
---|
| 204 | if (data) {
|
---|
[704] | 205 | aSumPdf = data->mSumPdf;
|
---|
[695] | 206 | // mark this entry as processed to avoid double counting
|
---|
[704] | 207 | data->mSumPdf = -aSumPdf;
|
---|
[695] | 208 | }
|
---|
[713] | 209 |
|
---|
| 210 | #if 0
|
---|
[695] | 211 | float diff = bSumPdf - aSumPdf;
|
---|
| 212 |
|
---|
| 213 | if (diff > 0.0f) {
|
---|
| 214 | pvsEnlargement += diff;
|
---|
| 215 | } else {
|
---|
| 216 | pvsReduction += -diff;
|
---|
| 217 | }
|
---|
[713] | 218 | #else
|
---|
| 219 | if (!data)
|
---|
| 220 | pvsEnlargement += 1.0f;
|
---|
| 221 | #endif
|
---|
[695] | 222 | }
|
---|
| 223 |
|
---|
| 224 | for (it = mEntries.begin(); it != mEntries.end(); ++ it) {
|
---|
| 225 | float aSumPdf = (*it).second.mSumPdf;
|
---|
| 226 | float bSumPdf = 0.0f;
|
---|
| 227 | if (aSumPdf < 0.0f) {
|
---|
| 228 | // this entry was already accounted for!
|
---|
| 229 | // just revert it back
|
---|
| 230 | (*it).second.mSumPdf = -aSumPdf;
|
---|
| 231 | } else {
|
---|
| 232 | PvsData<T> *data = b.Find((*it).first);
|
---|
| 233 | if (data) {
|
---|
[704] | 234 | bSumPdf = data->mSumPdf;
|
---|
[695] | 235 | }
|
---|
[713] | 236 | #if 0
|
---|
[695] | 237 | float diff = bSumPdf - aSumPdf;
|
---|
| 238 |
|
---|
| 239 | if (diff > 0.0f) {
|
---|
| 240 | pvsEnlargement += diff;
|
---|
| 241 | } else {
|
---|
| 242 | pvsReduction += -diff;
|
---|
| 243 | }
|
---|
[713] | 244 |
|
---|
| 245 | #else
|
---|
| 246 | if (!data)
|
---|
| 247 | pvsReduction += 1.0f;
|
---|
| 248 | #endif
|
---|
[695] | 249 | }
|
---|
| 250 | }
|
---|
[677] | 251 | }
|
---|
| 252 |
|
---|
| 253 | template <typename T>
|
---|
[362] | 254 | int Pvs<T>::Diff(const Pvs<T> &b)
|
---|
| 255 | {
|
---|
| 256 | int dif = 0;
|
---|
| 257 |
|
---|
| 258 | std::map<T, PvsData<T>, LtSample<T> >::const_iterator it;
|
---|
| 259 |
|
---|
| 260 | for (it = b.mEntries.begin(); it != b.mEntries.end(); ++ it)
|
---|
| 261 | {
|
---|
| 262 | PvsData<T> *data = Find((*it).first);
|
---|
| 263 | if (!data) ++ dif;
|
---|
| 264 | }
|
---|
| 265 |
|
---|
| 266 | return dif;
|
---|
| 267 | }
|
---|
| 268 |
|
---|
| 269 | template <typename T>
|
---|
[610] | 270 | void Pvs<T>::Merge(const Pvs<T> &a)
|
---|
[341] | 271 | {
|
---|
[362] | 272 | std::map<T, PvsData<T>, LtSample<T> >::const_iterator it;
|
---|
| 273 |
|
---|
[610] | 274 | for (it = a.mEntries.begin(); it != a.mEntries.end(); ++ it)
|
---|
[362] | 275 | {
|
---|
| 276 | PvsData<T> *data = Find((*it).first);
|
---|
| 277 |
|
---|
| 278 | if (data)
|
---|
[556] | 279 | data->mSumPdf += (*it).second.mSumPdf;
|
---|
[362] | 280 | else
|
---|
| 281 | mEntries.insert(*it);
|
---|
| 282 | }
|
---|
[341] | 283 | }
|
---|
| 284 |
|
---|
[752] | 285 | template <typename T> void Pvs<T>::Clear()
|
---|
| 286 | {
|
---|
| 287 | mEntries.clear();
|
---|
| 288 | }
|
---|
| 289 |
|
---|
| 290 |
|
---|
[310] | 291 | template <typename T>
|
---|
[311] | 292 | PvsData<T> *Pvs<T>::Find(T sample)
|
---|
[310] | 293 | {
|
---|
[311] | 294 | std::map<T, PvsData<T>, LtSample<T> >::iterator i = mEntries.find(sample);
|
---|
[310] | 295 | if (i != mEntries.end()) {
|
---|
| 296 | return &(*i).second;
|
---|
[311] | 297 | } else
|
---|
[310] | 298 | return NULL;
|
---|
| 299 | }
|
---|
| 300 |
|
---|
| 301 | template <typename T>
|
---|
[311] | 302 | void Pvs<T>::GetData(const int index,
|
---|
[485] | 303 | T &entry,
|
---|
| 304 | PvsData<T> &data)
|
---|
[310] | 305 | {
|
---|
[311] | 306 | std::map<T, PvsData<T>, LtSample<T> >::iterator i = mEntries.begin();
|
---|
[310] | 307 | for (int k = 0; k != index && i != mEntries.end(); i++, k++);
|
---|
| 308 |
|
---|
| 309 | entry = (*i).first;
|
---|
[311] | 310 | data = (*i).second;
|
---|
[310] | 311 | }
|
---|
| 312 |
|
---|
[311] | 313 | template <typename T>
|
---|
[556] | 314 | float
|
---|
| 315 | Pvs<T>::AddSample(T sample, const float pdf)
|
---|
[177] | 316 | {
|
---|
[492] | 317 | PvsData<T> *data = Find(sample);
|
---|
| 318 |
|
---|
| 319 | if (data) {
|
---|
[1112] | 320 | data->mSumPdf += pdf;
|
---|
[556] | 321 | return data->mSumPdf;
|
---|
[492] | 322 | }
|
---|
| 323 | else {
|
---|
[556] | 324 | mEntries[sample] = PvsData<T>(pdf);
|
---|
| 325 | return pdf;
|
---|
[492] | 326 | }
|
---|
[466] | 327 | }
|
---|
[177] | 328 |
|
---|
[466] | 329 | template <typename T>
|
---|
[1184] | 330 | PvsData<T> *
|
---|
| 331 | Pvs<T>::AddSample2(T sample, const float pdf)
|
---|
| 332 | {
|
---|
| 333 | PvsData<T> *data = Find(sample);
|
---|
| 334 |
|
---|
| 335 | if (data) {
|
---|
| 336 | data->mSumPdf += pdf;
|
---|
| 337 | }
|
---|
| 338 | else {
|
---|
| 339 | mEntries[sample] = PvsData<T>(pdf);
|
---|
| 340 | data = Find(sample);
|
---|
| 341 | }
|
---|
| 342 | return data;
|
---|
| 343 | }
|
---|
| 344 |
|
---|
| 345 | template <typename T>
|
---|
[492] | 346 | bool
|
---|
[556] | 347 | Pvs<T>::AddSample(T sample,
|
---|
| 348 | const float pdf,
|
---|
| 349 | float &contribution)
|
---|
[466] | 350 | {
|
---|
| 351 | PvsData<T> *data = Find(sample);
|
---|
| 352 |
|
---|
| 353 | if (data) {
|
---|
[1112] | 354 | data->mSumPdf += pdf;
|
---|
[556] | 355 | contribution = pdf/data->mSumPdf;
|
---|
[466] | 356 | return false;
|
---|
| 357 | }
|
---|
| 358 | else {
|
---|
[556] | 359 | mEntries[sample] = PvsData<T>(pdf);
|
---|
[466] | 360 | contribution = 1.0f;
|
---|
| 361 | return true;
|
---|
| 362 | }
|
---|
[311] | 363 | }
|
---|
[308] | 364 |
|
---|
[469] | 365 | template <typename T>
|
---|
[492] | 366 | bool
|
---|
[556] | 367 | Pvs<T>::GetSampleContribution(T sample,
|
---|
| 368 | const float pdf,
|
---|
| 369 | float &contribution)
|
---|
[492] | 370 | {
|
---|
| 371 | PvsData<T> *data = Find(sample);
|
---|
| 372 |
|
---|
| 373 | if (data) {
|
---|
[556] | 374 | contribution = pdf/(data->mSumPdf + pdf);
|
---|
[492] | 375 | return false;
|
---|
| 376 | }
|
---|
| 377 | else {
|
---|
| 378 | contribution = 1.0f;
|
---|
| 379 | return true;
|
---|
| 380 | }
|
---|
| 381 | }
|
---|
| 382 |
|
---|
| 383 | template <typename T>
|
---|
[556] | 384 | bool Pvs<T>::RemoveSample(T sample,
|
---|
| 385 | const float pdf)
|
---|
[485] | 386 | {
|
---|
[556] | 387 | std::map<T, PvsData<T>, LtSample<T> >::
|
---|
| 388 | iterator it = mEntries.find(sample);
|
---|
[485] | 389 |
|
---|
[556] | 390 | if (it == mEntries.end())
|
---|
| 391 | return false;
|
---|
| 392 |
|
---|
| 393 | PvsData<T> *data = &(*it).second;
|
---|
| 394 |
|
---|
| 395 | data->mSumPdf -= pdf;
|
---|
| 396 | if (data->mSumPdf <= 0.0f)
|
---|
| 397 | mEntries.erase(it);
|
---|
| 398 |
|
---|
| 399 | return true;
|
---|
[485] | 400 | }
|
---|
| 401 |
|
---|
| 402 | template <typename T>
|
---|
| 403 | int Pvs<T>::AddPvs(const Pvs<T> &pvs)
|
---|
| 404 | {
|
---|
[556] | 405 | std::map<T, PvsData<T>, LtSample<T> >::
|
---|
| 406 | const_iterator it, it_end = pvs.mEntries.end();
|
---|
| 407 |
|
---|
| 408 | float contri;
|
---|
| 409 | // output PVS of view cell
|
---|
| 410 | for (it = pvs.mEntries.begin(); it != it_end; ++ it)
|
---|
| 411 | AddSample((*it).first, (*it).second.mSumPdf, contri);
|
---|
| 412 |
|
---|
| 413 | return GetSize();
|
---|
[485] | 414 | }
|
---|
| 415 |
|
---|
| 416 | template <typename T>
|
---|
| 417 | int Pvs<T>::SubtractPvs(const Pvs<T> &pvs)
|
---|
| 418 | {
|
---|
[556] | 419 | std::map<T, PvsData<T>, LtSample<T> >::
|
---|
| 420 | const_iterator it, it_end = pvs.mEntries.end();
|
---|
| 421 |
|
---|
| 422 | // output PVS of view cell
|
---|
| 423 | for (it = pvs.mEntries.begin(); it != it_end; ++ it)
|
---|
| 424 | RemoveSample((*it).first, (*it).second.mSumPdf);
|
---|
| 425 |
|
---|
| 426 | return GetSize();
|
---|
[485] | 427 | }
|
---|
| 428 |
|
---|
| 429 | template <typename T>
|
---|
[469] | 430 | void Pvs<T>::CollectEntries(std::vector<T> &entries)
|
---|
| 431 | {
|
---|
[485] | 432 | std::map<T, PvsData<T>, LtSample<T> >::
|
---|
| 433 | const_iterator it, it_end = mEntries.end();
|
---|
[469] | 434 |
|
---|
| 435 | // output PVS of view cell
|
---|
| 436 | for (it = mEntries.begin(); it != it_end; ++ it)
|
---|
| 437 | entries.push_back((*it)->first);
|
---|
| 438 | }
|
---|
| 439 |
|
---|
[556] | 440 | template <typename T>
|
---|
| 441 | void Pvs<T>::NormalizeMaximum()
|
---|
| 442 | {
|
---|
| 443 | std::map<T, PvsData<T>, LtSample<T> >::
|
---|
| 444 | const_iterator it, it_end = mEntries.end();
|
---|
| 445 |
|
---|
| 446 | float maxPdfSum = -1.0f;
|
---|
| 447 |
|
---|
| 448 | // output PVS of view cell
|
---|
| 449 | for (it = mEntries.begin(); it != it_end; ++ it) {
|
---|
| 450 | float sum = (*it)->second.sumPdf;
|
---|
| 451 | if (sum > maxSum)
|
---|
| 452 | maxSum = sum;
|
---|
| 453 | }
|
---|
| 454 |
|
---|
| 455 | maxSum = 1.0f/maxSum;
|
---|
| 456 |
|
---|
| 457 | for (it = mEntries.begin(); it != it_end; ++ it) {
|
---|
| 458 | (*it)->second.sumPdf *= maxSum;
|
---|
| 459 | }
|
---|
| 460 |
|
---|
| 461 | }
|
---|
| 462 |
|
---|
| 463 |
|
---|
[311] | 464 | /** Class instantiating the Pvs template for kd tree nodes.
|
---|
| 465 | */
|
---|
| 466 | class KdPvs: public Pvs<KdNode *>
|
---|
[308] | 467 | {
|
---|
[1141] | 468 | public:
|
---|
[311] | 469 | int Compress();
|
---|
[308] | 470 | };
|
---|
| 471 |
|
---|
[1077] | 472 |
|
---|
[1141] | 473 | class ObjectPvs: public Pvs<Intersectable *>
|
---|
| 474 | {
|
---|
| 475 | public:
|
---|
[1168] | 476 | /** Counts object int the pvs. Different to GetSize(), not
|
---|
[1141] | 477 | only the raw container size is returned,
|
---|
| 478 | but the individual contributions of the entries are summed up.
|
---|
| 479 | */
|
---|
[1168] | 480 | int CountObjectsInPvs() const;
|
---|
[1141] | 481 | };
|
---|
| 482 |
|
---|
[1077] | 483 | //-- typedefs
|
---|
| 484 |
|
---|
[311] | 485 | typedef std::map<KdNode *, PvsData<KdNode *>, LtSample<KdNode *> > KdPvsMap;
|
---|
[469] | 486 | typedef std::map<Intersectable *, PvsData<Intersectable *>, LtSample<Intersectable *> > ObjectPvsMap;
|
---|
[1077] | 487 | typedef std::map<ViewCell *, PvsData<ViewCell *>, LtSample<ViewCell *> > ViewCellPvsMap;
|
---|
| 488 |
|
---|
[469] | 489 | typedef PvsData<Intersectable *> ObjectPvsData;
|
---|
[311] | 490 | typedef PvsData<KdNode *> KdPvsData;
|
---|
[308] | 491 |
|
---|
[1077] | 492 | typedef Pvs<ViewCell *> ViewCellPvs;
|
---|
[1184] | 493 | typedef PvsData<ViewCell *> ViewCellPvsData;
|
---|
| 494 |
|
---|
[860] | 495 | }
|
---|
[469] | 496 |
|
---|
[177] | 497 | #endif
|
---|
| 498 |
|
---|