*** empty log message ***
This commit is contained in:
parent
2a3744d4d8
commit
797d8f344f
|
|
@ -1,207 +0,0 @@
|
||||||
/****************************************************************************
|
|
||||||
* VCGLib o o *
|
|
||||||
* Visual and Computer Graphics Library o o *
|
|
||||||
* _ O _ *
|
|
||||||
* Copyright(C) 2004 \/)\/ *
|
|
||||||
* Visual Computing Lab /\/| *
|
|
||||||
* ISTI - Italian National Research Council | *
|
|
||||||
* \ *
|
|
||||||
* All rights reserved. *
|
|
||||||
* *
|
|
||||||
* This program is free software; you can redistribute it and/or modify *
|
|
||||||
* it under the terms of the GNU General Public License as published by *
|
|
||||||
* the Free Software Foundation; either version 2 of the License, or *
|
|
||||||
* (at your option) any later version. *
|
|
||||||
* *
|
|
||||||
* This program is distributed in the hope that it will be useful, *
|
|
||||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
||||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
||||||
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
|
||||||
* for more details. *
|
|
||||||
* *
|
|
||||||
****************************************************************************/
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
History
|
|
||||||
|
|
||||||
$Log: not supported by cvs2svn $
|
|
||||||
Revision 1.2 2005/09/28 19:57:18 m_di_benedetto
|
|
||||||
#included aabb tree base.
|
|
||||||
|
|
||||||
Revision 1.1 2005/09/26 18:33:16 m_di_benedetto
|
|
||||||
First Commit.
|
|
||||||
|
|
||||||
|
|
||||||
****************************************************************************/
|
|
||||||
|
|
||||||
#ifndef __VCGLIB_AABBBINARYTREE_FRUSTUMCULL_H
|
|
||||||
#define __VCGLIB_AABBBINARYTREE_FRUSTUMCULL_H
|
|
||||||
|
|
||||||
// vcg headers
|
|
||||||
#include <vcg/space/point3.h>
|
|
||||||
#include <vcg/space/plane3.h>
|
|
||||||
#include <vcg/space/index/aabb_binary_tree/base.h>
|
|
||||||
|
|
||||||
/***************************************************************************/
|
|
||||||
|
|
||||||
namespace vcg {
|
|
||||||
|
|
||||||
template <class TREETYPE>
|
|
||||||
class AABBBinaryTreeFrustumCull {
|
|
||||||
public:
|
|
||||||
typedef AABBBinaryTreeFrustumCull<TREETYPE> ClassType;
|
|
||||||
typedef TREETYPE TreeType;
|
|
||||||
typedef typename TreeType::ScalarType ScalarType;
|
|
||||||
typedef typename TreeType::CoordType CoordType;
|
|
||||||
typedef typename TreeType::NodeType NodeType;
|
|
||||||
typedef typename TreeType::ObjPtr ObjPtr;
|
|
||||||
|
|
||||||
protected:
|
|
||||||
class VFrustumPlane {
|
|
||||||
public:
|
|
||||||
CoordType normal;
|
|
||||||
ScalarType offset;
|
|
||||||
unsigned int pVertexIndex[3];
|
|
||||||
};
|
|
||||||
|
|
||||||
class VFrustum {
|
|
||||||
public:
|
|
||||||
VFrustumPlane planes[6];
|
|
||||||
};
|
|
||||||
|
|
||||||
public:
|
|
||||||
enum {
|
|
||||||
FC_FIRST_PLANE_BIT = 0,
|
|
||||||
FC_PARTIALLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 3)),
|
|
||||||
FC_FULLY_VISIBLE_BIT = (1 << (FC_FIRST_PLANE_BIT + 4))
|
|
||||||
};
|
|
||||||
|
|
||||||
static inline bool IsPartiallyVisible(const NodeType * node) {
|
|
||||||
return ((node->Flags() & FC_PARTIALLY_VISIBLE_BIT) != 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline bool IsFullyVisible(const NodeType * node) {
|
|
||||||
return ((node->Flags() & FC_FULLY_VISIBLE_BIT) != 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline bool IsVisible(const NodeType * node) {
|
|
||||||
return ((node->Flags() & (FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT)) != 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void Initialize(TreeType & tree) {
|
|
||||||
NodeType * pRoot = tree.pRoot;
|
|
||||||
if (pRoot == 0) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
ClassType::InitializeNodeFlagsRec(pRoot);
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void FrustumCull(TreeType & tree, const Plane3<ScalarType> frustumPlanes[6], const unsigned int minNodeObjectsCount) {
|
|
||||||
NodeType * pRoot = tree.pRoot;
|
|
||||||
if (pRoot == 0) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
VFrustum frustum;
|
|
||||||
for (int i=0; i<6; ++i) {
|
|
||||||
frustum.planes[i].normal = frustumPlanes[i].Direction();
|
|
||||||
frustum.planes[i].offset = frustumPlanes[i].Offset();
|
|
||||||
frustum.planes[i].pVertexIndex[0] = (frustum.planes[i].normal[0] >= ((ScalarType)0)) ? (1) : (0);
|
|
||||||
frustum.planes[i].pVertexIndex[1] = (frustum.planes[i].normal[1] >= ((ScalarType)0)) ? (1) : (0);
|
|
||||||
frustum.planes[i].pVertexIndex[2] = (frustum.planes[i].normal[2] >= ((ScalarType)0)) ? (1) : (0);
|
|
||||||
}
|
|
||||||
|
|
||||||
const unsigned char inMask = 0x3F;
|
|
||||||
ClassType::NodeVsFrustum(pRoot, frustum, inMask, minNodeObjectsCount);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected:
|
|
||||||
static inline void InitializeNodeFlagsRec(NodeType * node) {
|
|
||||||
node->Flags() &= ~(0x1F);
|
|
||||||
if (node->children[0] == 0) {
|
|
||||||
ClassType::InitializeNodeFlagsRec(node->children[0]);
|
|
||||||
}
|
|
||||||
if (node->children[1] == 0) {
|
|
||||||
ClassType::InitializeNodeFlagsRec(node->children[1]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline void NodeVsFrustum(NodeType * node, const VFrustum & f, unsigned char inMask, unsigned int minNodeObjectsCount) {
|
|
||||||
const CoordType bminmax[2] = {
|
|
||||||
node->boxCenter - node->boxHalfDims,
|
|
||||||
node->boxCenter + node->boxHalfDims,
|
|
||||||
};
|
|
||||||
const unsigned int firstFail = (unsigned int)((node->Flags() >> FC_FIRST_PLANE_BIT) & 0x7);
|
|
||||||
const VFrustumPlane * fp = f.planes + firstFail;
|
|
||||||
unsigned char k = 1 << firstFail;
|
|
||||||
unsigned char newMask = 0x0;
|
|
||||||
bool fullInside = true;
|
|
||||||
|
|
||||||
node->Flags() &= ~(FC_PARTIALLY_VISIBLE_BIT | FC_FULLY_VISIBLE_BIT);
|
|
||||||
|
|
||||||
if ((k & inMask) != 0) {
|
|
||||||
if (
|
|
||||||
((fp->normal[0] * bminmax[fp->pVertexIndex[0]][0]) +
|
|
||||||
(fp->normal[1] * bminmax[fp->pVertexIndex[1]][1]) +
|
|
||||||
(fp->normal[2] * bminmax[fp->pVertexIndex[2]][2]) +
|
|
||||||
(fp->offset)) < ((ScalarType)0)
|
|
||||||
) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (
|
|
||||||
((fp->normal[0] * bminmax[1 - fp->pVertexIndex[0]][0]) +
|
|
||||||
(fp->normal[1] * bminmax[1 - fp->pVertexIndex[1]][1]) +
|
|
||||||
(fp->normal[2] * bminmax[1 - fp->pVertexIndex[2]][2]) +
|
|
||||||
(fp->offset)) < ((ScalarType)0)
|
|
||||||
) {
|
|
||||||
newMask |= k;
|
|
||||||
fullInside = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
k = 1;
|
|
||||||
for (unsigned int i=0; k<=inMask; ++i, k<<=1) {
|
|
||||||
if ((i != firstFail) && ((k & inMask) != 0)) {
|
|
||||||
fp = f.planes + i;
|
|
||||||
if (
|
|
||||||
((fp->normal[0] * bminmax[fp->pVertexIndex[0]][0]) +
|
|
||||||
(fp->normal[1] * bminmax[fp->pVertexIndex[1]][1]) +
|
|
||||||
(fp->normal[2] * bminmax[fp->pVertexIndex[2]][2]) +
|
|
||||||
(fp->offset)) < ((ScalarType)0)
|
|
||||||
) {
|
|
||||||
node->Flags() = (node->Flags() & ((~0x0) & (0x7 << ClassType::FC_FIRST_PLANE_BIT))) | (i << ClassType::FC_FIRST_PLANE_BIT);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (
|
|
||||||
((fp->normal[0] * bminmax[1 - fp->pVertexIndex[0]][0]) +
|
|
||||||
(fp->normal[1] * bminmax[1 - fp->pVertexIndex[1]][1]) +
|
|
||||||
(fp->normal[2] * bminmax[1 - fp->pVertexIndex[2]][2]) +
|
|
||||||
(fp->offset)) < ((ScalarType)0)
|
|
||||||
) {
|
|
||||||
newMask |= k;
|
|
||||||
fullInside = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (fullInside || (node->ObjectsCount() <= minNodeObjectsCount)) {
|
|
||||||
node->Flags() |= FC_FULLY_VISIBLE_BIT;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
node->Flags() |= FC_PARTIALLY_VISIBLE_BIT;
|
|
||||||
|
|
||||||
if (node->children[0] != 0) {
|
|
||||||
ClassType::NodeVsFrustum(node->children[0], f, newMask, minNodeObjectsCount);
|
|
||||||
}
|
|
||||||
if (node->children[1] != 0) {
|
|
||||||
ClassType::NodeVsFrustum(node->children[1], f, newMask, minNodeObjectsCount);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
} // end namespace vcg
|
|
||||||
|
|
||||||
#endif // #ifndef __VCGLIB_AABBBINARYTREE_FRUSTUMCULL_H
|
|
||||||
Loading…
Reference in New Issue