[2746] | 1 | #include <queue>
|
---|
| 2 | #include <stack>
|
---|
| 3 | #include <fstream>
|
---|
| 4 | #include <iostream>
|
---|
| 5 | #include <iomanip>
|
---|
| 6 |
|
---|
[2755] | 7 | #include "Bvh.h"
|
---|
| 8 | #include "Camera.h"
|
---|
| 9 | #include "Plane3.h"
|
---|
| 10 | #include "glInterface.h"
|
---|
| 11 | #include "Triangle3.h"
|
---|
[2756] | 12 | #include "SceneEntity.h"
|
---|
| 13 | #include "Geometry.h"
|
---|
[2773] | 14 | #include "RenderState.h"
|
---|
[2825] | 15 | #include "Material.h"
|
---|
[2795] | 16 | #include "gzstream.h"
|
---|
[2751] | 17 |
|
---|
[2773] | 18 |
|
---|
[2776] | 19 | namespace CHCDemoEngine
|
---|
[2751] | 20 | {
|
---|
| 21 |
|
---|
[2746] | 22 | #define INVALID_TEST ((unsigned int)-1)
|
---|
| 23 |
|
---|
| 24 | using namespace std;
|
---|
| 25 |
|
---|
| 26 |
|
---|
[2895] | 27 | int BvhNode::sCurrentState = 0;
|
---|
[2746] | 28 |
|
---|
[2895] | 29 |
|
---|
[2746] | 30 | /*
|
---|
| 31 | 3 x---------x 2
|
---|
| 32 | |\ \
|
---|
| 33 | | \ \
|
---|
| 34 | | \ \
|
---|
| 35 | | 4 x---------x 5
|
---|
| 36 | | | |
|
---|
| 37 | 0 x | x 1 |
|
---|
| 38 | \ | |
|
---|
| 39 | \ | |
|
---|
| 40 | \| |
|
---|
| 41 | 7 x---------x 6
|
---|
| 42 | */
|
---|
| 43 |
|
---|
| 44 | static unsigned int sIndices[] =
|
---|
| 45 | {7, // degenerated
|
---|
| 46 | 7, 6, 4, 5, 3, 2, 0, 1,
|
---|
| 47 | 1, 4, // degenerated
|
---|
| 48 | 4, 3, 7, 0, 6, 1, 5, 2,
|
---|
| 49 | 2 // degenerated
|
---|
| 50 | };
|
---|
| 51 |
|
---|
| 52 |
|
---|
| 53 | const static int sNumIndicesPerBox = 20;
|
---|
| 54 |
|
---|
| 55 | /* Order of vertices
|
---|
| 56 | 0 = (0, 0, 0)
|
---|
| 57 | 1 = (1, 0, 0)
|
---|
| 58 | 2 = (1, 1, 0)
|
---|
| 59 | 3 = (0, 1, 0)
|
---|
| 60 | 4 = (0, 1, 1)
|
---|
| 61 | 5 = (1, 1, 1)
|
---|
| 62 | 6 = (1, 0, 1)
|
---|
| 63 | 7 = (0, 0, 1)
|
---|
| 64 | */
|
---|
| 65 |
|
---|
[2755] | 66 | static Plane3 sNearPlane;
|
---|
[2911] | 67 | static Frustum sFrustum;
|
---|
[2746] | 68 |
|
---|
[2755] | 69 | /// these values are valid for all nodes
|
---|
| 70 | static int sClipPlaneAABBVertexIndices[12];
|
---|
| 71 |
|
---|
| 72 |
|
---|
[2795] | 73 | #define ALIGN_INDICES
|
---|
| 74 |
|
---|
[2746] | 75 | BvhNode::BvhNode(BvhNode *parent):
|
---|
| 76 | mParent(parent),
|
---|
| 77 | mAxis(-1),
|
---|
| 78 | mDepth(0),
|
---|
| 79 | mFirst(-1),
|
---|
| 80 | mLast(-1),
|
---|
| 81 | mNumTestNodes(1),
|
---|
| 82 | mTestNodesIdx(-1),
|
---|
[2755] | 83 | mIndicesPtr(-1),
|
---|
[2761] | 84 | mId(0),
|
---|
| 85 | mIsMaxDepthForVirtualLeaf(false),
|
---|
| 86 | mIsVirtualLeaf(false)
|
---|
[2746] | 87 | {
|
---|
[2895] | 88 | for (int i = 0; i < NUM_STATES; ++ i)
|
---|
| 89 | {
|
---|
| 90 | mPlaneMask[i] = 0;
|
---|
| 91 | mPreferredPlane[i]= 0;
|
---|
[2897] | 92 | mLastRenderedFrame[i] = -1;
|
---|
[2895] | 93 | }
|
---|
[2746] | 94 | }
|
---|
| 95 |
|
---|
| 96 |
|
---|
[2761] | 97 | BvhNode::~BvhNode()
|
---|
| 98 | {
|
---|
| 99 | }
|
---|
| 100 |
|
---|
| 101 |
|
---|
[2746] | 102 | void BvhNode::ResetVisibility()
|
---|
| 103 | {
|
---|
[2895] | 104 | for (int i = 0; i < NUM_STATES; ++ i)
|
---|
| 105 | {
|
---|
| 106 | mVisibility[i].Reset();
|
---|
[2897] | 107 | mLastRenderedFrame[i] = -1;
|
---|
| 108 | mPlaneMask[i] = 0;
|
---|
| 109 | mPreferredPlane[i]= 0;
|
---|
[2895] | 110 | }
|
---|
[2746] | 111 | }
|
---|
| 112 |
|
---|
| 113 |
|
---|
| 114 | void BvhNode::VisibilityInfo::Reset()
|
---|
| 115 | {
|
---|
| 116 | mIsVisible = false;
|
---|
[2770] | 117 | mAssumedVisibleFrameId = 0;
|
---|
[2746] | 118 | mLastVisitedFrame = -1;
|
---|
| 119 | mTimesInvisible = 0;
|
---|
| 120 | mIsFrustumCulled = false;
|
---|
| 121 | mIsNew = true;
|
---|
[2800] | 122 | mLastQueriedFrame = -1;
|
---|
[2746] | 123 | }
|
---|
| 124 |
|
---|
| 125 |
|
---|
[2792] | 126 | BvhInterior::~BvhInterior()
|
---|
| 127 | {
|
---|
| 128 | DEL_PTR(mBack);
|
---|
| 129 | DEL_PTR(mFront);
|
---|
| 130 | }
|
---|
| 131 |
|
---|
| 132 |
|
---|
[2746] | 133 | BvhLeaf::~BvhLeaf()
|
---|
| 134 | {
|
---|
| 135 | }
|
---|
| 136 |
|
---|
| 137 |
|
---|
| 138 | /***********************************************************/
|
---|
| 139 | /* class Bvh implementation */
|
---|
| 140 | /***********************************************************/
|
---|
| 141 |
|
---|
| 142 |
|
---|
[2773] | 143 | Bvh::Bvh()
|
---|
| 144 | {
|
---|
| 145 | Init();
|
---|
| 146 | }
|
---|
[2746] | 147 |
|
---|
[2760] | 148 |
|
---|
[2773] | 149 | Bvh::Bvh(const SceneEntityContainer &entities)
|
---|
[2746] | 150 | {
|
---|
[2773] | 151 | Init();
|
---|
| 152 |
|
---|
[2760] | 153 | mGeometrySize = entities.size();
|
---|
| 154 | mGeometry = new SceneEntity*[mGeometrySize];
|
---|
[2796] | 155 |
|
---|
[2760] | 156 | SceneEntityContainer::const_iterator it, it_end = entities.end();
|
---|
[2746] | 157 |
|
---|
[2760] | 158 | int i = 0;
|
---|
| 159 | for (it = entities.begin(); it != it_end; ++ it, ++ i)
|
---|
[2746] | 160 | {
|
---|
[2760] | 161 | mGeometry[i] = (*it);
|
---|
[2746] | 162 | }
|
---|
[2760] | 163 | }
|
---|
[2746] | 164 |
|
---|
| 165 |
|
---|
| 166 | Bvh::~Bvh()
|
---|
| 167 | {
|
---|
[2792] | 168 | if (mVertices) delete [] mVertices;
|
---|
[2746] | 169 | if (mIndices) delete [] mIndices;
|
---|
| 170 | if (mTestIndices) delete [] mTestIndices;
|
---|
| 171 | if (mGeometry) delete [] mGeometry;
|
---|
| 172 |
|
---|
| 173 | if (mRoot) delete mRoot;
|
---|
[2792] | 174 |
|
---|
| 175 | // delete vbo
|
---|
| 176 | glDeleteBuffersARB(1, &mVboId);
|
---|
[2746] | 177 | }
|
---|
| 178 |
|
---|
| 179 |
|
---|
[2773] | 180 | void Bvh::Init()
|
---|
| 181 | {
|
---|
| 182 | mRoot = NULL;
|
---|
| 183 | mVertices = NULL;
|
---|
| 184 | mIndices = NULL;
|
---|
| 185 | mTestIndices = NULL;
|
---|
| 186 | mCurrentIndicesPtr = 0;
|
---|
| 187 | mNumNodes = 0;
|
---|
[2795] | 188 |
|
---|
| 189 | mMaxDepthForTestingChildren = 3;
|
---|
| 190 | //mMaxDepthForTestingChildren = 4;
|
---|
| 191 | mAreaRatioThreshold = 2.0f;
|
---|
| 192 | //mAreaRatioThreshold = 1.4f;
|
---|
| 193 |
|
---|
[2773] | 194 | mVboId = -1;
|
---|
| 195 | }
|
---|
| 196 |
|
---|
| 197 |
|
---|
[2746] | 198 | void Bvh::PullUpLastVisited(BvhNode *node, const int frameId) const
|
---|
| 199 | {
|
---|
| 200 | BvhNode *parent = node->GetParent();
|
---|
| 201 |
|
---|
| 202 | while (parent && (parent->GetLastVisitedFrame() != frameId))
|
---|
| 203 | {
|
---|
| 204 | parent->SetLastVisitedFrame(frameId);
|
---|
| 205 | parent = parent->GetParent();
|
---|
| 206 | }
|
---|
| 207 | }
|
---|
| 208 |
|
---|
| 209 |
|
---|
| 210 | void Bvh::MakeParentsVisible(BvhNode *node)
|
---|
| 211 | {
|
---|
| 212 | BvhNode *parent = node->GetParent();
|
---|
| 213 |
|
---|
| 214 | while (parent && (!parent->IsVisible()))
|
---|
| 215 | {
|
---|
| 216 | parent->SetVisible(true);
|
---|
| 217 | parent = parent->GetParent();
|
---|
| 218 | }
|
---|
| 219 | }
|
---|
| 220 |
|
---|
| 221 |
|
---|
| 222 | void Bvh::CollectLeaves(BvhNode *node, BvhLeafContainer &leaves)
|
---|
| 223 | {
|
---|
| 224 | stack<BvhNode *> tStack;
|
---|
| 225 | tStack.push(node);
|
---|
| 226 |
|
---|
| 227 | while (!tStack.empty())
|
---|
| 228 | {
|
---|
| 229 | BvhNode *node = tStack.top();
|
---|
| 230 |
|
---|
| 231 | tStack.pop();
|
---|
| 232 |
|
---|
| 233 | if (!node->IsLeaf())
|
---|
| 234 | {
|
---|
| 235 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 236 |
|
---|
| 237 | tStack.push(interior->mFront);
|
---|
| 238 | tStack.push(interior->mBack);
|
---|
| 239 | }
|
---|
| 240 | else
|
---|
| 241 | {
|
---|
| 242 | leaves.push_back(static_cast<BvhLeaf *>(node));
|
---|
| 243 | }
|
---|
| 244 | }
|
---|
| 245 | }
|
---|
| 246 |
|
---|
| 247 |
|
---|
| 248 | void Bvh::CollectNodes(BvhNode *node, BvhNodeContainer &nodes)
|
---|
| 249 | {
|
---|
| 250 | stack<BvhNode *> tStack;
|
---|
| 251 |
|
---|
| 252 | tStack.push(node);
|
---|
| 253 |
|
---|
| 254 | while (!tStack.empty())
|
---|
| 255 | {
|
---|
| 256 | BvhNode *node = tStack.top();
|
---|
| 257 | tStack.pop();
|
---|
| 258 |
|
---|
| 259 | nodes.push_back(node);
|
---|
| 260 |
|
---|
| 261 | if (!node->IsLeaf())
|
---|
| 262 | {
|
---|
| 263 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 264 |
|
---|
| 265 | tStack.push(interior->mFront);
|
---|
| 266 | tStack.push(interior->mBack);
|
---|
| 267 | }
|
---|
| 268 | }
|
---|
| 269 | }
|
---|
| 270 |
|
---|
| 271 |
|
---|
| 272 | typedef pair<BvhNode *, int> tPair;
|
---|
| 273 |
|
---|
[2755] | 274 | void Bvh::CollectNodes(BvhNode *root, BvhNodeContainer &nodes, int depth)
|
---|
[2746] | 275 | {
|
---|
| 276 | stack<tPair> tStack;
|
---|
| 277 | tStack.push(tPair(root, 0));
|
---|
| 278 |
|
---|
| 279 | while (!tStack.empty())
|
---|
| 280 | {
|
---|
| 281 | BvhNode *node = tStack.top().first;
|
---|
| 282 | const int d = tStack.top().second;
|
---|
| 283 |
|
---|
| 284 | tStack.pop();
|
---|
| 285 |
|
---|
| 286 | // found depth => take this node
|
---|
[2755] | 287 | if ((d == depth) || (node->IsLeaf()))
|
---|
[2746] | 288 | {
|
---|
| 289 | nodes.push_back(node);
|
---|
| 290 | }
|
---|
[2755] | 291 | else
|
---|
[2746] | 292 | {
|
---|
| 293 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 294 |
|
---|
| 295 | tStack.push(tPair(interior->mFront, d + 1));
|
---|
| 296 | tStack.push(tPair(interior->mBack, d + 1));
|
---|
| 297 | }
|
---|
| 298 | }
|
---|
| 299 | }
|
---|
| 300 |
|
---|
| 301 |
|
---|
[2755] | 302 | SceneEntity **Bvh::GetGeometry(BvhNode *node, int &geometrySize)
|
---|
[2746] | 303 | {
|
---|
| 304 | geometrySize = node->CountPrimitives();
|
---|
| 305 | return mGeometry + node->mFirst;
|
---|
| 306 | }
|
---|
| 307 |
|
---|
| 308 |
|
---|
[2762] | 309 | bool Bvh::TestPlane(BvhNode *node, int i, bool &bIntersect)
|
---|
| 310 | {
|
---|
| 311 | // do the test only if necessary
|
---|
[2895] | 312 | if (!(node->mPlaneMask[BvhNode::sCurrentState] & (1 << i)))
|
---|
[2763] | 313 | return true;
|
---|
| 314 |
|
---|
| 315 | ////////
|
---|
| 316 | //-- test the n-vertex
|
---|
| 317 |
|
---|
| 318 | if ((node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) > 0.0f))
|
---|
| 319 | {
|
---|
| 320 | // outside
|
---|
[2895] | 321 | node->mPreferredPlane[BvhNode::sCurrentState] = i;
|
---|
[2763] | 322 | return false;
|
---|
[2762] | 323 | }
|
---|
| 324 |
|
---|
[2763] | 325 | ////////////
|
---|
| 326 | //-- test the p-vertex
|
---|
| 327 |
|
---|
| 328 | if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 1], sFrustum.mClipPlanes[i]) <= 0.0f)
|
---|
| 329 | {
|
---|
| 330 | // completely inside: children don't need to check against this plane no more
|
---|
[2895] | 331 | node->mPlaneMask[BvhNode::sCurrentState] ^= 1 << i;
|
---|
[2763] | 332 | }
|
---|
| 333 | else
|
---|
| 334 | {
|
---|
| 335 | bIntersect = true;
|
---|
| 336 | }
|
---|
| 337 |
|
---|
[2762] | 338 | return true;
|
---|
| 339 | }
|
---|
| 340 |
|
---|
| 341 |
|
---|
[2755] | 342 | int Bvh::IsWithinViewFrustum(BvhNode *node)
|
---|
[2746] | 343 | {
|
---|
| 344 | bool bIntersect = false;
|
---|
| 345 |
|
---|
| 346 | if (node->GetParent())
|
---|
[2895] | 347 | node->mPlaneMask[BvhNode::sCurrentState] = node->GetParent()->mPlaneMask[BvhNode::sCurrentState];
|
---|
[2746] | 348 |
|
---|
| 349 | ////////
|
---|
[2762] | 350 | //-- apply frustum culling for the planes [mPreferredPlane - 5]
|
---|
[2763] | 351 |
|
---|
[2895] | 352 | for (int i = node->mPreferredPlane[BvhNode::sCurrentState]; i < 6; ++ i)
|
---|
[2762] | 353 | if (!TestPlane(node, i, bIntersect)) return 0;
|
---|
[2763] | 354 |
|
---|
[2895] | 355 |
|
---|
[2746] | 356 | //////////
|
---|
| 357 | //-- do the view frustum culling for the planes [0 - m_iPreferredPlane)
|
---|
| 358 |
|
---|
[2895] | 359 | for (int i = 0; i < node->mPreferredPlane[BvhNode::sCurrentState]; ++ i)
|
---|
[2762] | 360 | if (!TestPlane(node, i, bIntersect)) return 0;
|
---|
[2763] | 361 |
|
---|
[2746] | 362 | return bIntersect ? -1 : 1;
|
---|
| 363 | }
|
---|
| 364 |
|
---|
| 365 |
|
---|
[2911] | 366 | static void CalcNPVertexIndices(const Frustum &frustum, int *indices)
|
---|
| 367 | {
|
---|
| 368 | for (int i = 0; i < 6; ++ i)
|
---|
| 369 | {
|
---|
| 370 | // n-vertex
|
---|
| 371 | indices[i * 2 + 0] = AxisAlignedBox3::GetIndexNearestVertex(frustum.mClipPlanes[i].mNormal);
|
---|
| 372 | // p-vertex
|
---|
| 373 | indices[i * 2 + 1] = AxisAlignedBox3::GetIndexFarthestVertex(frustum.mClipPlanes[i].mNormal);
|
---|
| 374 | }
|
---|
| 375 | }
|
---|
| 376 |
|
---|
| 377 |
|
---|
[2897] | 378 | void Bvh::InitFrame(Camera *cam)
|
---|
[2746] | 379 | {
|
---|
| 380 | // = 0011 1111 which means that at the beginning, all six planes have to frustum culled
|
---|
[2895] | 381 | mRoot->mPlaneMask[BvhNode::sCurrentState] = 0x3f;
|
---|
[2746] | 382 |
|
---|
[2897] | 383 | cam->CalcFrustum(sFrustum);
|
---|
[2911] | 384 | CalcNPVertexIndices(sFrustum, sClipPlaneAABBVertexIndices);
|
---|
[2746] | 385 |
|
---|
[2763] | 386 | // store near plane
|
---|
[2897] | 387 | sNearPlane = Plane3(cam->GetDirection(), cam->GetPosition());
|
---|
[2746] | 388 | }
|
---|
| 389 |
|
---|
| 390 |
|
---|
[2947] | 391 | void Bvh::UpdateMinDistance(BvhNode *node) const
|
---|
[2746] | 392 | {
|
---|
[2947] | 393 | node->mDistance = node->GetBox().GetMinDistance(sNearPlane);
|
---|
[2746] | 394 | }
|
---|
| 395 |
|
---|
| 396 |
|
---|
[2947] | 397 | float Bvh::CalcMaxDistance(BvhNode *node) const
|
---|
| 398 | {
|
---|
| 399 | return node->GetBox().GetMaxDistance(sNearPlane);
|
---|
| 400 | }
|
---|
| 401 |
|
---|
| 402 |
|
---|
[2786] | 403 | void Bvh::RenderBounds(BvhNode *node, RenderState *state, bool useTightBounds)
|
---|
[2746] | 404 | {
|
---|
[2786] | 405 | // if not using tight bounds, rendering boxes in immediate mode
|
---|
| 406 | // is preferable to vertex arrays (less setup time)
|
---|
| 407 | if (!useTightBounds)
|
---|
| 408 | {
|
---|
| 409 | RenderBoundingBoxImmediate(node->GetBox());
|
---|
| 410 | }
|
---|
| 411 | else
|
---|
| 412 | {
|
---|
| 413 | static BvhNodeContainer dummy(1);
|
---|
| 414 | dummy[0] = node;
|
---|
| 415 | RenderBounds(dummy, state, useTightBounds);
|
---|
| 416 | }
|
---|
[2746] | 417 | }
|
---|
| 418 |
|
---|
| 419 |
|
---|
[2786] | 420 | int Bvh::RenderBounds(const BvhNodeContainer &nodes,
|
---|
| 421 | RenderState *state,
|
---|
| 422 | bool useTightBounds)
|
---|
[2746] | 423 | {
|
---|
[2786] | 424 | // if not using tight bounds, rendering boxes in immediate mode
|
---|
| 425 | // is preferable to vertex arrays (less setup time)
|
---|
[2746] | 426 |
|
---|
[2786] | 427 | int renderedBoxes;
|
---|
| 428 |
|
---|
| 429 | if (!useTightBounds)
|
---|
| 430 | {
|
---|
| 431 | BvhNodeContainer::const_iterator nit, nit_end = nodes.end();
|
---|
| 432 |
|
---|
| 433 | for (nit = nodes.begin(); nit != nit_end; ++ nit)
|
---|
| 434 | {
|
---|
| 435 | RenderBoundingBoxImmediate((*nit)->GetBox());
|
---|
| 436 | }
|
---|
| 437 |
|
---|
| 438 | renderedBoxes = (int)nodes.size();
|
---|
| 439 | }
|
---|
| 440 | else
|
---|
| 441 | {
|
---|
| 442 | renderedBoxes = PrepareBoundsWithDrawArrays(nodes);
|
---|
| 443 | RenderBoundsWithDrawArrays(renderedBoxes, state);
|
---|
| 444 | }
|
---|
| 445 |
|
---|
[2746] | 446 | return renderedBoxes;
|
---|
| 447 | }
|
---|
| 448 |
|
---|
| 449 |
|
---|
[2786] | 450 | int Bvh::PrepareBoundsWithDrawArrays(const BvhNodeContainer &nodes)
|
---|
[2746] | 451 | {
|
---|
| 452 | //////
|
---|
| 453 | //-- for the first time we come here ...
|
---|
| 454 |
|
---|
| 455 | if (!mIndices)
|
---|
| 456 | { // create list of indices
|
---|
| 457 | CreateIndices();
|
---|
| 458 | }
|
---|
| 459 |
|
---|
[2773] | 460 | if (mVboId == -1)
|
---|
[2746] | 461 | {
|
---|
| 462 | // prepare the vbo
|
---|
| 463 | PrepareVertices();
|
---|
| 464 | }
|
---|
| 465 |
|
---|
| 466 | ///////////////
|
---|
| 467 |
|
---|
| 468 | int numNodes = 0;
|
---|
| 469 |
|
---|
| 470 | BvhNodeContainer::const_iterator nit, nit_end = nodes.end();
|
---|
| 471 |
|
---|
| 472 | for (nit = nodes.begin(); nit != nit_end; ++ nit)
|
---|
| 473 | {
|
---|
| 474 | BvhNode *node = *nit;
|
---|
| 475 |
|
---|
| 476 | const int numIndices = node->mNumTestNodes * sNumIndicesPerBox;
|
---|
| 477 |
|
---|
| 478 | // copy indices
|
---|
| 479 | memcpy(mIndices + numNodes * sNumIndicesPerBox,
|
---|
| 480 | mTestIndices + node->mIndicesPtr,
|
---|
| 481 | numIndices * sizeof(unsigned int));
|
---|
[2795] | 482 |
|
---|
[2746] | 483 | numNodes += node->mNumTestNodes;
|
---|
| 484 | }
|
---|
| 485 |
|
---|
| 486 | return numNodes;
|
---|
| 487 | }
|
---|
| 488 |
|
---|
| 489 |
|
---|
[2786] | 490 | void Bvh::RenderBoundsWithDrawArrays(int numNodes, RenderState *state)
|
---|
[2746] | 491 | {
|
---|
| 492 | //////
|
---|
| 493 | //-- Rendering the vbo
|
---|
[2773] | 494 |
|
---|
| 495 | if (state->GetCurrentVboId() != mVboId)
|
---|
| 496 | {
|
---|
| 497 | glBindBufferARB(GL_ARRAY_BUFFER_ARB, mVboId);
|
---|
[2746] | 498 | // set the vertex pointer to the vertex buffer
|
---|
[2773] | 499 | glVertexPointer(3, GL_FLOAT, 0, (char *)NULL);
|
---|
[2746] | 500 |
|
---|
[2773] | 501 | state->SetCurrentVboId(mVboId);
|
---|
| 502 | }
|
---|
[2746] | 503 |
|
---|
[2773] | 504 | // we do use the last or the first index (they are generate and only used to connect strips)
|
---|
| 505 | int numElements = numNodes * sNumIndicesPerBox - 1;
|
---|
[2746] | 506 | // don't render first degenerate index
|
---|
| 507 | glDrawElements(GL_TRIANGLE_STRIP, numElements, GL_UNSIGNED_INT, mIndices + 1);
|
---|
| 508 | }
|
---|
| 509 |
|
---|
| 510 |
|
---|
| 511 | void Bvh::CreateIndices()
|
---|
| 512 | {
|
---|
| 513 | // collect bvh nodes
|
---|
| 514 | BvhNodeContainer nodes;
|
---|
| 515 | CollectNodes(mRoot, nodes);
|
---|
| 516 |
|
---|
[2755] | 517 | cout << "creating new indices" << endl;
|
---|
[2746] | 518 |
|
---|
| 519 | int numMaxIndices = 0;
|
---|
| 520 |
|
---|
| 521 | BvhNodeContainer::const_iterator lit, lit_end = nodes.end();
|
---|
| 522 |
|
---|
| 523 | for (lit = nodes.begin(); lit != lit_end; ++ lit)
|
---|
| 524 | {
|
---|
| 525 | int offset = (*lit)->mNumTestNodes * sNumIndicesPerBox;
|
---|
[2795] | 526 | #ifdef ALIGN_INDICES
|
---|
[2746] | 527 | // align with 32
|
---|
| 528 | offset = (offset / 32) * 32 + 32;
|
---|
| 529 | #endif
|
---|
| 530 | numMaxIndices += offset;
|
---|
| 531 | }
|
---|
| 532 |
|
---|
| 533 |
|
---|
[2755] | 534 | cout << "creating global indices buffer" << endl;
|
---|
[2746] | 535 |
|
---|
| 536 | if (mIndices) delete [] mIndices;
|
---|
| 537 | if (mTestIndices) delete [] mTestIndices;
|
---|
| 538 |
|
---|
| 539 | // global buffer: create it once so we don't have
|
---|
| 540 | // to allocate memory from the chunks of the node
|
---|
| 541 | mIndices = new unsigned int[numMaxIndices];
|
---|
| 542 |
|
---|
| 543 | // create new index buffer for the individual nodes
|
---|
| 544 | mTestIndices = new unsigned int[numMaxIndices];
|
---|
| 545 |
|
---|
| 546 | mCurrentIndicesPtr = 0;
|
---|
| 547 |
|
---|
| 548 | for (lit = nodes.begin(); lit != lit_end; ++ lit)
|
---|
| 549 | {
|
---|
| 550 | BvhNode *node = *lit;
|
---|
| 551 |
|
---|
| 552 | // resize array
|
---|
| 553 | node->mIndicesPtr = mCurrentIndicesPtr;
|
---|
| 554 |
|
---|
| 555 | int numIndices = 0;
|
---|
| 556 |
|
---|
| 557 | // the bounding box of the test nodes are rendered instead of the root node
|
---|
| 558 | // => store their indices
|
---|
| 559 | for (int i = 0; i < node->mNumTestNodes; ++ i, numIndices += sNumIndicesPerBox)
|
---|
| 560 | {
|
---|
[2755] | 561 | BvhNode *testNode = mTestNodes[node->mTestNodesIdx + i];
|
---|
[2746] | 562 |
|
---|
| 563 | // add indices to root node
|
---|
| 564 | for (int j = 0; j < sNumIndicesPerBox; ++ j)
|
---|
| 565 | {
|
---|
| 566 | mTestIndices[mCurrentIndicesPtr + numIndices + j] = sIndices[j] + testNode->GetId() * 8;
|
---|
| 567 | }
|
---|
| 568 | }
|
---|
| 569 |
|
---|
| 570 | // align with 32
|
---|
[2795] | 571 | #ifdef ALIGN_INDICES
|
---|
[2746] | 572 | const int offset = (numIndices / 32) * 32 + 32;
|
---|
| 573 | #else
|
---|
| 574 | const int offset = numIndices;
|
---|
| 575 | #endif
|
---|
| 576 | mCurrentIndicesPtr += offset;
|
---|
| 577 | }
|
---|
| 578 | }
|
---|
| 579 |
|
---|
| 580 |
|
---|
| 581 | void Bvh::ComputeIds()
|
---|
| 582 | {
|
---|
[2756] | 583 | // collect all nodes
|
---|
[2755] | 584 | BvhNodeContainer nodes;
|
---|
[2756] | 585 | CollectNodes(mRoot, nodes);
|
---|
[2746] | 586 |
|
---|
| 587 | // assign ids to all nodes of the "regular" hierarchy
|
---|
| 588 | int i = 0;
|
---|
[2756] | 589 | BvhNodeContainer::const_iterator lit, lit_end = nodes.end();
|
---|
[2746] | 590 |
|
---|
| 591 | for (lit = nodes.begin(); lit != lit_end; ++ lit, ++ i)
|
---|
| 592 | {
|
---|
| 593 | (*lit)->SetId(i);
|
---|
| 594 | }
|
---|
| 595 | }
|
---|
| 596 |
|
---|
[2756] | 597 |
|
---|
[2746] | 598 | void Bvh::PrepareVertices()
|
---|
| 599 | {
|
---|
[2755] | 600 | // collect all nodes
|
---|
| 601 | BvhNodeContainer nodes;
|
---|
[2746] | 602 |
|
---|
| 603 | nodes.reserve(GetNumNodes());
|
---|
[2755] | 604 | CollectNodes(mRoot, nodes);
|
---|
[2746] | 605 |
|
---|
| 606 | const unsigned int bufferSize = 8 * (int)nodes.size();
|
---|
[2755] | 607 | mVertices = new Vector3[bufferSize];
|
---|
[2746] | 608 |
|
---|
| 609 | int i = 0;
|
---|
| 610 |
|
---|
| 611 | // store bounding box vertices
|
---|
[2755] | 612 | BvhNodeContainer::const_iterator lit, lit_end = nodes.end();
|
---|
[2746] | 613 |
|
---|
| 614 | for (lit = nodes.begin(); lit != lit_end; ++ lit, i += 8)
|
---|
| 615 | {
|
---|
[2755] | 616 | BvhNode *node = *lit;
|
---|
[2746] | 617 |
|
---|
| 618 | for (int j = 0; j < 8; ++ j)
|
---|
[2755] | 619 | ((Vector3 *)mVertices)[node->GetId() * 8 + j] = node->GetBox().GetVertex(j);
|
---|
[2746] | 620 | }
|
---|
| 621 |
|
---|
[2773] | 622 | glGenBuffersARB(1, &mVboId);
|
---|
| 623 | glBindBufferARB(GL_ARRAY_BUFFER_ARB, mVboId);
|
---|
| 624 | glVertexPointer(3, GL_FLOAT, 0, (char *)NULL);
|
---|
[2746] | 625 |
|
---|
[2773] | 626 | glBufferDataARB(GL_ARRAY_BUFFER_ARB,
|
---|
| 627 | bufferSize * sizeof(Vector3),
|
---|
| 628 | mVertices,
|
---|
| 629 | GL_STATIC_DRAW_ARB);
|
---|
[2746] | 630 |
|
---|
[2800] | 631 | glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0);
|
---|
[2746] | 632 |
|
---|
[2773] | 633 | // data handled by graphics driver from now on
|
---|
| 634 | DEL_PTR(mVertices);
|
---|
[2746] | 635 |
|
---|
[2773] | 636 | cout << "***** created vbos for tighter bounds *********" << endl;
|
---|
[2746] | 637 | }
|
---|
| 638 |
|
---|
| 639 |
|
---|
[2755] | 640 | void Bvh::SetMaxDepthForTestingChildren(int maxDepth)
|
---|
[2746] | 641 | {
|
---|
| 642 | if (maxDepth != mMaxDepthForTestingChildren)
|
---|
| 643 | {
|
---|
| 644 | mMaxDepthForTestingChildren = maxDepth;
|
---|
| 645 | RecomputeBounds();
|
---|
| 646 | }
|
---|
| 647 | }
|
---|
| 648 |
|
---|
| 649 |
|
---|
[2755] | 650 | void Bvh::SetAreaRatioThresholdForTestingChildren(float ratio)
|
---|
[2746] | 651 | {
|
---|
| 652 | if (ratio != mAreaRatioThreshold)
|
---|
| 653 | {
|
---|
| 654 | mAreaRatioThreshold = ratio;
|
---|
| 655 | RecomputeBounds();
|
---|
| 656 | }
|
---|
| 657 | }
|
---|
| 658 |
|
---|
| 659 |
|
---|
| 660 | void Bvh::RecomputeBounds()
|
---|
| 661 | {
|
---|
| 662 | // collect all nodes
|
---|
| 663 | BvhNodeContainer nodes;
|
---|
| 664 | CollectNodes(mRoot, nodes);
|
---|
| 665 |
|
---|
[2755] | 666 | cout << "recomputing bounds, children will be tested in depth " << mMaxDepthForTestingChildren << endl;
|
---|
[2746] | 667 |
|
---|
| 668 | int success = 0;
|
---|
| 669 | BvhNodeContainer::const_iterator lit, lit_end = nodes.end();
|
---|
| 670 |
|
---|
| 671 | for (lit = nodes.begin(); lit != lit_end; ++ lit)
|
---|
| 672 | {
|
---|
| 673 | BvhNode *node = *lit;
|
---|
| 674 |
|
---|
[2795] | 675 | // recreate list of nodes that will be queried as a proxy
|
---|
[2755] | 676 | if (CreateNodeRenderList(node))
|
---|
| 677 | ++ success;
|
---|
[2746] | 678 | }
|
---|
| 679 |
|
---|
[2755] | 680 | float p = 100.0f * (float)success / nodes.size();
|
---|
| 681 | cout << "created tighter bounds for " << p << " percent of the nodes" << endl;
|
---|
[2746] | 682 |
|
---|
| 683 | // recreate indices used for indirect mode rendering
|
---|
[2894] | 684 | if (mIndices) CreateIndices();
|
---|
[2746] | 685 | }
|
---|
| 686 |
|
---|
| 687 |
|
---|
| 688 | bool Bvh::CreateNodeRenderList(BvhNode *node)
|
---|
| 689 | {
|
---|
[2755] | 690 | BvhNodeContainer children;
|
---|
[2746] | 691 |
|
---|
[2755] | 692 | // collect nodes that will be tested instead of the leaf node
|
---|
| 693 | // in order to get a tighter bounding box test
|
---|
| 694 | CollectNodes(node, children, mMaxDepthForTestingChildren);
|
---|
| 695 |
|
---|
[2746] | 696 |
|
---|
| 697 | // using the tighter bounds is not feasable in case
|
---|
| 698 | // that the tighter bounds represent nearly the same projected area
|
---|
| 699 | // as the old bounding box. Find this out using either volume or area
|
---|
| 700 | // heuristics
|
---|
| 701 |
|
---|
| 702 | float vol = 0;
|
---|
| 703 | float area = 0;
|
---|
| 704 |
|
---|
[2755] | 705 | BvhNodeContainer::const_iterator cit;
|
---|
[2746] | 706 |
|
---|
| 707 | for (cit = children.begin(); cit != children.end(); ++ cit)
|
---|
[2755] | 708 | area += (*cit)->GetBox().SurfaceArea();
|
---|
[2746] | 709 |
|
---|
[2755] | 710 | const float areaRatio = area / node->GetBox().SurfaceArea();
|
---|
[2746] | 711 |
|
---|
| 712 | bool success;
|
---|
| 713 |
|
---|
[2755] | 714 | if (areaRatio < mAreaRatioThreshold)
|
---|
[2746] | 715 | success = true;
|
---|
| 716 | else
|
---|
| 717 | {
|
---|
| 718 | // hack: only store node itself
|
---|
| 719 | children.clear();
|
---|
| 720 | children.push_back(node);
|
---|
| 721 |
|
---|
| 722 | success = false;
|
---|
| 723 | }
|
---|
| 724 |
|
---|
| 725 | // the new test nodes are added at the end of the vector
|
---|
[2755] | 726 | node->mTestNodesIdx = (int)mTestNodes.size();
|
---|
[2746] | 727 |
|
---|
| 728 | // use the found nodes as nodes during the occlusion tests
|
---|
| 729 | for (cit = children.begin(); cit != children.end(); ++ cit)
|
---|
| 730 | {
|
---|
[2755] | 731 | BvhNode *child = *cit;
|
---|
[2746] | 732 | mTestNodes.push_back(child);
|
---|
| 733 | }
|
---|
| 734 |
|
---|
| 735 | node->mNumTestNodes = (int)children.size();
|
---|
| 736 |
|
---|
| 737 | return success;
|
---|
| 738 | }
|
---|
| 739 |
|
---|
| 740 |
|
---|
| 741 | void Bvh::ResetNodeClassifications()
|
---|
| 742 | {
|
---|
| 743 | BvhNodeContainer nodes;
|
---|
| 744 |
|
---|
| 745 | nodes.reserve(GetNumNodes());
|
---|
| 746 | CollectNodes(mRoot, nodes);
|
---|
| 747 |
|
---|
| 748 | BvhNodeContainer::const_iterator lit, lit_end = nodes.end();
|
---|
| 749 |
|
---|
| 750 | for (lit = nodes.begin(); lit != lit_end; ++ lit)
|
---|
| 751 | {
|
---|
| 752 | (*lit)->ResetVisibility();
|
---|
| 753 | }
|
---|
| 754 | }
|
---|
| 755 |
|
---|
| 756 |
|
---|
| 757 | void Bvh::ComputeBvhStats()
|
---|
| 758 | {
|
---|
| 759 | std::stack<BvhNode *> nodeStack;
|
---|
| 760 | nodeStack.push(mRoot);
|
---|
| 761 |
|
---|
[2786] | 762 | int numVirtualLeaves = 0;
|
---|
| 763 |
|
---|
[2746] | 764 | while (!nodeStack.empty())
|
---|
| 765 | {
|
---|
| 766 | BvhNode *node = nodeStack.top();
|
---|
| 767 | nodeStack.pop();
|
---|
| 768 |
|
---|
[2773] | 769 | if (node->IsVirtualLeaf())
|
---|
[2746] | 770 | {
|
---|
[2786] | 771 | ++ numVirtualLeaves;
|
---|
| 772 |
|
---|
[2746] | 773 | BvhLeaf *leaf = static_cast<BvhLeaf *>(node);
|
---|
| 774 |
|
---|
[2773] | 775 | mBvhStats.mTriangles += CountTriangles(leaf);
|
---|
[2755] | 776 | mBvhStats.mLeafSA += leaf->mBox.SurfaceArea();
|
---|
| 777 | mBvhStats.mLeafVol += leaf->mBox.GetVolume();
|
---|
[2746] | 778 | }
|
---|
| 779 | else
|
---|
| 780 | {
|
---|
[2755] | 781 | mBvhStats.mInteriorSA += node->mBox.SurfaceArea();
|
---|
| 782 | mBvhStats.mInteriorVol += node->mBox.GetVolume();
|
---|
[2746] | 783 |
|
---|
| 784 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 785 |
|
---|
| 786 | nodeStack.push(interior->mBack);
|
---|
| 787 | nodeStack.push(interior->mFront);
|
---|
| 788 | }
|
---|
| 789 | }
|
---|
| 790 |
|
---|
[2786] | 791 | mBvhStats.mGeometryRatio = mGeometrySize / (float)numVirtualLeaves;
|
---|
| 792 | mBvhStats.mTriangleRatio = mBvhStats.mTriangles / (float)numVirtualLeaves;
|
---|
[2746] | 793 | }
|
---|
| 794 |
|
---|
| 795 |
|
---|
| 796 | void Bvh::PrintBvhStats() const
|
---|
| 797 | {
|
---|
[2885] | 798 | cout << "\n******** bvh stats: ***********" << endl;
|
---|
[2755] | 799 | cout << "interiorNodesSA = " << mBvhStats.mInteriorSA / mRoot->mBox.SurfaceArea() << endl;
|
---|
| 800 | cout << "leafNodesSA = " << mBvhStats.mLeafSA / mRoot->mBox.SurfaceArea() << endl;
|
---|
| 801 | cout << "interiorNodesVolume = " << mBvhStats.mInteriorVol / mRoot->mBox.GetVolume() << endl;
|
---|
| 802 | cout << "leafNodesVolume = " << mBvhStats.mLeafVol / mRoot->mBox.GetVolume() << endl;
|
---|
[2746] | 803 |
|
---|
[2755] | 804 | cout << "geometry per leaf: " << mBvhStats.mGeometryRatio << endl;
|
---|
| 805 | cout << "triangles per leaf: " << mBvhStats.mTriangleRatio << endl;
|
---|
[2885] | 806 | cout << "**************" << endl << endl;
|
---|
[2746] | 807 | }
|
---|
| 808 |
|
---|
| 809 |
|
---|
| 810 | int Bvh::CountTriangles(BvhNode *node) const
|
---|
| 811 | {
|
---|
| 812 | int numTriangles = 0;
|
---|
| 813 |
|
---|
| 814 | for (int i = node->mFirst; i <= node->mLast; ++ i)
|
---|
[2774] | 815 | {
|
---|
[2848] | 816 | numTriangles += mGeometry[i]->CountNumTriangles(0);
|
---|
[2774] | 817 | }
|
---|
| 818 |
|
---|
[2746] | 819 | return numTriangles;
|
---|
| 820 | }
|
---|
| 821 |
|
---|
| 822 |
|
---|
[2756] | 823 | float Bvh::GetArea(BvhNode *node) const
|
---|
[2746] | 824 | {
|
---|
| 825 | return node->mArea;
|
---|
| 826 | }
|
---|
| 827 |
|
---|
[2760] | 828 |
|
---|
| 829 | void Bvh::UpdateNumLeaves(BvhNode *node) const
|
---|
| 830 | {
|
---|
| 831 | if (node->IsLeaf())
|
---|
| 832 | {
|
---|
| 833 | node->mNumLeaves = 1;
|
---|
| 834 | }
|
---|
| 835 | else
|
---|
| 836 | {
|
---|
| 837 | BvhNode *f = static_cast<BvhInterior *>(node)->GetFront();
|
---|
| 838 | BvhNode *b = static_cast<BvhInterior *>(node)->GetBack();
|
---|
| 839 |
|
---|
| 840 | UpdateNumLeaves(f);
|
---|
| 841 | UpdateNumLeaves(b);
|
---|
| 842 |
|
---|
| 843 | node->mNumLeaves = f->mNumLeaves + b->mNumLeaves;
|
---|
| 844 | }
|
---|
[2746] | 845 | }
|
---|
[2760] | 846 |
|
---|
| 847 |
|
---|
[2761] | 848 | void Bvh::CollectVirtualLeaves(BvhNode *node, BvhNodeContainer &leaves)
|
---|
| 849 | {
|
---|
| 850 | stack<BvhNode *> tStack;
|
---|
| 851 | tStack.push(node);
|
---|
| 852 |
|
---|
| 853 | while (!tStack.empty())
|
---|
| 854 | {
|
---|
| 855 | BvhNode *node = tStack.top();
|
---|
| 856 | tStack.pop();
|
---|
| 857 |
|
---|
| 858 | if (node->mIsVirtualLeaf)
|
---|
| 859 | {
|
---|
| 860 | leaves.push_back(node);
|
---|
| 861 | }
|
---|
| 862 | else if (!node->IsLeaf())
|
---|
| 863 | {
|
---|
| 864 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 865 |
|
---|
| 866 | tStack.push(interior->mFront);
|
---|
| 867 | tStack.push(interior->mBack);
|
---|
| 868 | }
|
---|
| 869 | }
|
---|
[2760] | 870 | }
|
---|
[2761] | 871 |
|
---|
| 872 |
|
---|
| 873 | void Bvh::SetVirtualLeaves(int numTriangles)
|
---|
| 874 | {
|
---|
| 875 | // first invalidate old leaves
|
---|
| 876 | BvhNodeContainer leaves;
|
---|
| 877 |
|
---|
| 878 | CollectVirtualLeaves(mRoot, leaves);
|
---|
| 879 |
|
---|
| 880 | BvhNodeContainer::const_iterator bit, bit_end = leaves.end();
|
---|
| 881 |
|
---|
| 882 | for (bit = leaves.begin(); bit != bit_end; ++ bit)
|
---|
| 883 | {
|
---|
| 884 | (*bit)->mIsVirtualLeaf = false;
|
---|
| 885 | }
|
---|
| 886 |
|
---|
[2764] | 887 | mNumVirtualNodes = 0;
|
---|
| 888 |
|
---|
[2761] | 889 | // assign new virtual leaves based on specified number of triangles per leaf
|
---|
| 890 | std::stack<BvhNode *> nodeStack;
|
---|
| 891 | nodeStack.push(mRoot);
|
---|
| 892 |
|
---|
| 893 | while (!nodeStack.empty())
|
---|
| 894 | {
|
---|
| 895 | BvhNode *node = nodeStack.top();
|
---|
| 896 | nodeStack.pop();
|
---|
| 897 |
|
---|
[2764] | 898 | ++ mNumVirtualNodes;
|
---|
| 899 |
|
---|
[2761] | 900 | if (node->IsLeaf())
|
---|
| 901 | {
|
---|
| 902 | BvhLeaf *leaf = static_cast<BvhLeaf *>(node);
|
---|
| 903 | leaf->mIsVirtualLeaf = true;
|
---|
| 904 | }
|
---|
| 905 | else
|
---|
| 906 | {
|
---|
| 907 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 908 |
|
---|
| 909 | BvhNode *f = interior->mFront;
|
---|
| 910 | BvhNode *b = interior->mBack;
|
---|
| 911 |
|
---|
| 912 | if (node->mIsMaxDepthForVirtualLeaf || (CountTriangles(node) <= numTriangles))
|
---|
| 913 | {
|
---|
| 914 | node->mIsVirtualLeaf = true;
|
---|
| 915 | }
|
---|
| 916 | else
|
---|
| 917 | {
|
---|
| 918 | nodeStack.push(interior->mBack);
|
---|
| 919 | nodeStack.push(interior->mFront);
|
---|
| 920 | }
|
---|
| 921 | }
|
---|
| 922 | }
|
---|
[2800] | 923 |
|
---|
| 924 | ResetNodeClassifications();
|
---|
[2761] | 925 | }
|
---|
| 926 |
|
---|
| 927 |
|
---|
| 928 | void Bvh::PostProcess()
|
---|
| 929 | {
|
---|
| 930 | std::stack<BvhNode *> nodeStack;
|
---|
| 931 | nodeStack.push(mRoot);
|
---|
| 932 |
|
---|
| 933 | while (!nodeStack.empty())
|
---|
| 934 | {
|
---|
| 935 | BvhNode *node = nodeStack.top();
|
---|
| 936 | nodeStack.pop();
|
---|
| 937 |
|
---|
| 938 | if (node->IsLeaf())
|
---|
| 939 | {
|
---|
| 940 | node->mIsMaxDepthForVirtualLeaf = true;
|
---|
| 941 | }
|
---|
| 942 | else
|
---|
| 943 | {
|
---|
| 944 | BvhInterior *interior = static_cast<BvhInterior *>(node);
|
---|
| 945 |
|
---|
| 946 | BvhNode *f = interior->mFront;
|
---|
| 947 | BvhNode *b = interior->mBack;
|
---|
| 948 |
|
---|
| 949 | // point reached where we cannot subdivide further on object level
|
---|
| 950 | if ((f->mFirst == b->mFirst) && (f->mLast == b->mLast))
|
---|
| 951 | {
|
---|
| 952 | node->mIsMaxDepthForVirtualLeaf = true;
|
---|
| 953 | }
|
---|
| 954 | else
|
---|
| 955 | {
|
---|
| 956 | nodeStack.push(f);
|
---|
| 957 | nodeStack.push(b);
|
---|
| 958 | }
|
---|
| 959 | }
|
---|
| 960 | }
|
---|
| 961 | }
|
---|
| 962 |
|
---|
| 963 |
|
---|
[2763] | 964 | void Bvh::RenderBoundingBoxImmediate(const AxisAlignedBox3 &box)
|
---|
| 965 | {
|
---|
| 966 | const Vector3 l = box.Min();
|
---|
| 967 | const Vector3 u = box.Max();
|
---|
| 968 |
|
---|
[2764] | 969 | glBegin(GL_TRIANGLE_STRIP);
|
---|
| 970 | {
|
---|
| 971 | ///////////
|
---|
| 972 | //-- render AABB as triangle strips
|
---|
[2763] | 973 |
|
---|
[2764] | 974 | glVertex3f(l.x, l.y, u.z);
|
---|
| 975 | glVertex3f(u.x, l.y, u.z);
|
---|
| 976 | glVertex3f(l.x, u.y, u.z);
|
---|
| 977 | glVertex3f(u.x, u.y, u.z);
|
---|
| 978 | glVertex3f(l.x, u.y, l.z);
|
---|
| 979 | glVertex3f(u.x, u.y, l.z);
|
---|
| 980 | glVertex3f(l.x, l.y, l.z);
|
---|
| 981 | glVertex3f(u.x, l.y, l.z);
|
---|
[2763] | 982 |
|
---|
[2764] | 983 | glPrimitiveRestartNV();
|
---|
[2763] | 984 |
|
---|
[2764] | 985 | //-- render second half of AABB
|
---|
| 986 | glVertex3f(l.x, u.y, u.z);
|
---|
| 987 | glVertex3f(l.x, u.y, l.z);
|
---|
| 988 | glVertex3f(l.x, l.y, u.z);
|
---|
| 989 | glVertex3f(l.x, l.y, l.z);
|
---|
| 990 | glVertex3f(u.x, l.y, u.z);
|
---|
| 991 | glVertex3f(u.x, l.y, l.z);
|
---|
| 992 | glVertex3f(u.x, u.y, u.z);
|
---|
| 993 | glVertex3f(u.x, u.y, l.z);
|
---|
| 994 | }
|
---|
| 995 | glEnd();
|
---|
[2761] | 996 | }
|
---|
[2763] | 997 |
|
---|
[2790] | 998 |
|
---|
| 999 |
|
---|
| 1000 |
|
---|
| 1001 | static void RenderBoxForViz(const AxisAlignedBox3 &box)
|
---|
| 1002 | {
|
---|
| 1003 | glBegin(GL_LINE_LOOP);
|
---|
| 1004 | glVertex3d(box.Min().x, box.Max().y, box.Min().z);
|
---|
| 1005 | glVertex3d(box.Max().x, box.Max().y, box.Min().z);
|
---|
| 1006 | glVertex3d(box.Max().x, box.Min().y, box.Min().z);
|
---|
| 1007 | glVertex3d(box.Min().x, box.Min().y, box.Min().z);
|
---|
| 1008 | glEnd();
|
---|
| 1009 |
|
---|
| 1010 | glBegin(GL_LINE_LOOP);
|
---|
| 1011 | glVertex3d(box.Min().x, box.Min().y, box.Max().z);
|
---|
| 1012 | glVertex3d(box.Max().x, box.Min().y, box.Max().z);
|
---|
| 1013 | glVertex3d(box.Max().x, box.Max().y, box.Max().z);
|
---|
| 1014 | glVertex3d(box.Min().x, box.Max().y, box.Max().z);
|
---|
| 1015 | glEnd();
|
---|
| 1016 |
|
---|
| 1017 | glBegin(GL_LINE_LOOP);
|
---|
| 1018 | glVertex3d(box.Max().x, box.Min().y, box.Min().z);
|
---|
| 1019 | glVertex3d(box.Max().x, box.Min().y, box.Max().z);
|
---|
| 1020 | glVertex3d(box.Max().x, box.Max().y, box.Max().z);
|
---|
| 1021 | glVertex3d(box.Max().x, box.Max().y, box.Min().z);
|
---|
| 1022 | glEnd();
|
---|
| 1023 |
|
---|
| 1024 | glBegin(GL_LINE_LOOP);
|
---|
| 1025 | glVertex3d(box.Min().x, box.Min().y, box.Min().z);
|
---|
| 1026 | glVertex3d(box.Min().x, box.Min().y, box.Max().z);
|
---|
| 1027 | glVertex3d(box.Min().x, box.Max().y, box.Max().z);
|
---|
| 1028 | glVertex3d(box.Min().x, box.Max().y, box.Min().z);
|
---|
| 1029 | glEnd();
|
---|
| 1030 |
|
---|
| 1031 | glBegin(GL_LINE_LOOP);
|
---|
| 1032 | glVertex3d(box.Min().x, box.Min().y, box.Min().z);
|
---|
| 1033 | glVertex3d(box.Max().x, box.Min().y, box.Min().z);
|
---|
| 1034 | glVertex3d(box.Max().x, box.Min().y, box.Max().z);
|
---|
| 1035 | glVertex3d(box.Min().x, box.Min().y, box.Max().z);
|
---|
| 1036 | glEnd();
|
---|
| 1037 |
|
---|
| 1038 | glBegin(GL_LINE_LOOP);
|
---|
| 1039 | glVertex3d(box.Min().x, box.Max().y, box.Min().z);
|
---|
| 1040 | glVertex3d(box.Max().x, box.Max().y, box.Min().z);
|
---|
| 1041 | glVertex3d(box.Max().x, box.Max().y, box.Max().z);
|
---|
| 1042 | glVertex3d(box.Min().x, box.Max().y, box.Max().z);
|
---|
| 1043 |
|
---|
| 1044 | glEnd();
|
---|
| 1045 | }
|
---|
| 1046 |
|
---|
| 1047 |
|
---|
[2825] | 1048 | void Bvh::RenderBoundsForViz(BvhNode *node, RenderState *state, bool useTightBounds)
|
---|
[2790] | 1049 | {
|
---|
| 1050 | glDisable(GL_TEXTURE_2D);
|
---|
| 1051 | glDisable(GL_LIGHTING);
|
---|
| 1052 | glColor3f(1, 1, 1);
|
---|
[2825] | 1053 |
|
---|
| 1054 | // hack: for deferred shading we have to define a material
|
---|
| 1055 | static Material boxMat;
|
---|
| 1056 | boxMat.SetEmmisive(RgbaColor(1.0f, 1.0f, 1.0f, 1.0f));
|
---|
| 1057 |
|
---|
| 1058 | boxMat.Render(state);
|
---|
| 1059 |
|
---|
[2790] | 1060 | if (!useTightBounds)
|
---|
| 1061 | {
|
---|
| 1062 | RenderBoxForViz(node->GetBox());
|
---|
| 1063 | }
|
---|
| 1064 | else
|
---|
| 1065 | {
|
---|
| 1066 | for (int i = 0; i < node->mNumTestNodes; ++ i)
|
---|
| 1067 | {
|
---|
| 1068 | RenderBoxForViz(mTestNodes[node->mTestNodesIdx + i]->GetBox());
|
---|
| 1069 | }
|
---|
| 1070 | }
|
---|
| 1071 |
|
---|
| 1072 | glEnable(GL_LIGHTING);
|
---|
| 1073 | glEnable(GL_TEXTURE_2D);
|
---|
| 1074 | }
|
---|
| 1075 |
|
---|
| 1076 |
|
---|
| 1077 |
|
---|
[2764] | 1078 | } |
---|