manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added PASS_THROUGH flags.

This commit is contained in:
Marco Di Benedetto 2005-10-26 11:42:03 +00:00
parent 2579c02256
commit 329b7edb38
1 changed files with 26 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
vcg/space/index/aabb_binary_tree/frustum_cull.h
View File

@ -25,6 +25,9 @@
History History
$Log: not supported by cvs2svn $ $Log: not supported by cvs2svn $
Revision 1.6 2005/10/15 19:14:35 m_di_benedetto
Modified objapplyfunctor to nodeapplyfunctor.
Revision 1.5 2005/10/05 01:59:56 m_di_benedetto Revision 1.5 2005/10/05 01:59:56 m_di_benedetto
First Commit, new version. First Commit, new version.
@ -80,9 +83,10 @@ protected:
public: public:
enum { enum {
FC_FIRST_PLANE_BIT = 0, FC_FIRST_PLANE_BIT = 0,
FC_PARTIALLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 3)), FC_PARTIALLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 3)),
FC_FULLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 4)) FC_FULLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 4)),
FC_PASS_THROUGH_FIRST_BIT = (FC_FIRST_PLANE_BIT + 5)
}; };
static inline bool IsPartiallyVisible(const NodeType * node) { static inline bool IsPartiallyVisible(const NodeType * node) {
@ -97,6 +101,10 @@ public:
return ((node->Flags() & (FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT)) != 0); return ((node->Flags() & (FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT)) != 0);
} }
static inline unsigned int PassThrough(const NodeType * node) {
return ((node->Flags() >> FC_PASS_THROUGH_FIRST_BIT) & 0x03);
}
static inline void Initialize(TreeType & tree) { static inline void Initialize(TreeType & tree) {
NodeType * pRoot = tree.pRoot; NodeType * pRoot = tree.pRoot;
if (pRoot == 0) { if (pRoot == 0) {
@ -128,7 +136,8 @@ public:
protected: protected:
static inline void InitializeNodeFlagsRec(NodeType * node) { static inline void InitializeNodeFlagsRec(NodeType * node) {
node->Flags() &= ~(0x1F); //node->Flags() &= ~(0x7F);
node->Flags() = 0;
if (node->children[0] != 0) { if (node->children[0] != 0) {
ClassType::InitializeNodeFlagsRec(node->children[0]); ClassType::InitializeNodeFlagsRec(node->children[0]);
} }
@ -153,7 +162,7 @@ protected:
unsigned char newMask = 0x0; unsigned char newMask = 0x0;
bool fullInside = true; bool fullInside = true;
node->Flags() &= ~(FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT); node->Flags() &= ~(FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT | (0x03 << FC_PASS_THROUGH_FIRST_BIT));
if ((k & inMask) != 0) { if ((k & inMask) != 0) {
if ( if (
@ -202,7 +211,7 @@ protected:
} }
} }
if (fullInside || (node->ObjectsCount() <= minNodeObjectsCount)) { if (fullInside || (node->IsLeaf()) || (node->ObjectsCount() <= minNodeObjectsCount)) {
node->Flags() |= FC_FULLY_VISIBLE_BIT; node->Flags() |= FC_FULLY_VISIBLE_BIT;
nodeApply(*node); nodeApply(*node);
return; return;
@ -230,7 +239,17 @@ protected:
ClassType::NodeVsFrustum(node->children[0], viewerPosition, f, newMask, minNodeObjectsCount, nodeApply); ClassType::NodeVsFrustum(node->children[0], viewerPosition, f, newMask, minNodeObjectsCount, nodeApply);
} }
return; const bool c0 = (node->children[0] != 0) && ClassType::IsVisible(node->children[0]);
const bool c1 = (node->children[1] != 0) && ClassType::IsVisible(node->children[1]);
if (c0 != c1) {
if (c0) {
node->Flags() |= (0x01 << FC_PASS_THROUGH_FIRST_BIT);
}
else {
node->Flags() |= (0x02 << FC_PASS_THROUGH_FIRST_BIT);
}
}
} }
}; };