1 | #include "HierarchyInterface.h"
|
---|
2 |
|
---|
3 | #include <windows.h>
|
---|
4 |
|
---|
5 | namespace GtpVisibility {
|
---|
6 |
|
---|
7 | //-----------------------------------------------------------------------
|
---|
8 | HierarchyInterface::HierarchyInterface():
|
---|
9 | mFrameId(0), mNumTraversedNodes(0), mHierarchyRoot(NULL),
|
---|
10 | mSavedNode(NULL), mCurrentTestIdx(0), mTestGeometryForVisibleLeaves(false)
|
---|
11 | {
|
---|
12 | mDistanceQueue = new DistanceQueue(GreaterDistance<HierarchyNode *>(this));
|
---|
13 | mTraversalStack = new std::stack<HierarchyNode *>;
|
---|
14 | }
|
---|
15 | //-----------------------------------------------------------------------
|
---|
16 | HierarchyInterface::~HierarchyInterface()
|
---|
17 | {
|
---|
18 | delete mDistanceQueue;
|
---|
19 | delete mTraversalStack;
|
---|
20 | }
|
---|
21 | //-----------------------------------------------------------------------
|
---|
22 | void HierarchyInterface::SetHierarchyRoot(HierarchyNode *root)
|
---|
23 | {
|
---|
24 | mHierarchyRoot = root;
|
---|
25 | }
|
---|
26 | //-----------------------------------------------------------------------
|
---|
27 | void HierarchyInterface::InitTraversal(bool frontToBack)
|
---|
28 | {
|
---|
29 | // initialise for front-to-back rendering
|
---|
30 | if (frontToBack)
|
---|
31 | {
|
---|
32 | ++ mFrameId;
|
---|
33 | mCurrentTestIdx = 0;
|
---|
34 | mNumTraversedNodes = 0;
|
---|
35 | mRenderedNodes.clear();
|
---|
36 |
|
---|
37 | mDistanceQueue->push(mHierarchyRoot);
|
---|
38 | }
|
---|
39 | else
|
---|
40 | { // initialise for simple node traversal
|
---|
41 | mTraversalStack->push(mHierarchyRoot);
|
---|
42 | }
|
---|
43 | }
|
---|
44 | //-----------------------------------------------------------------------
|
---|
45 | unsigned int HierarchyInterface::GetFrameId() const
|
---|
46 | {
|
---|
47 | return mFrameId;
|
---|
48 | }
|
---|
49 | //-----------------------------------------------------------------------
|
---|
50 | DistanceQueue *HierarchyInterface::GetQueue()
|
---|
51 | {
|
---|
52 | return mDistanceQueue;
|
---|
53 | }
|
---|
54 | //-----------------------------------------------------------------------
|
---|
55 | bool HierarchyInterface::CheckFrustumVisible(HierarchyNode *node)
|
---|
56 | {
|
---|
57 | bool intersects = false;
|
---|
58 | return CheckFrustumVisible(node, intersects);
|
---|
59 | }
|
---|
60 | //-----------------------------------------------------------------------
|
---|
61 | HierarchyNode *HierarchyInterface::GetHierarchyRoot() const
|
---|
62 | {
|
---|
63 | return mHierarchyRoot;
|
---|
64 | }
|
---|
65 | //-----------------------------------------------------------------------
|
---|
66 | unsigned int HierarchyInterface::GetNumTraversedNodes()
|
---|
67 | {
|
---|
68 | return mNumTraversedNodes;
|
---|
69 | }
|
---|
70 | //-----------------------------------------------------------------------
|
---|
71 | unsigned int HierarchyInterface::GetNumRenderedNodes()
|
---|
72 | {
|
---|
73 | return (unsigned int)mRenderedNodes.size();
|
---|
74 | }
|
---|
75 | //-----------------------------------------------------------------------
|
---|
76 | void HierarchyInterface::TestGeometryForVisibleLeaves(bool testGeometry)
|
---|
77 | {
|
---|
78 | mTestGeometryForVisibleLeaves = testGeometry;
|
---|
79 | }
|
---|
80 | //-----------------------------------------------------------------------
|
---|
81 | std::vector<HierarchyNode *> *HierarchyInterface::GetRenderedNodes()
|
---|
82 | {
|
---|
83 | return &mRenderedNodes;
|
---|
84 | }
|
---|
85 | } // namespace GtpVisibility
|
---|