Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032 #ifndef ActorKdTree_INCLUDE_ONCE
00033 #define ActorKdTree_INCLUDE_ONCE
00034
00035 #include <vlCore/AABB.hpp>
00036 #include <vlGraphics/Actor.hpp>
00037 #include <vlCore/math_utils.hpp>
00038 #include <vlCore/Plane.hpp>
00039 #include <vlCore/Collection.hpp>
00040 #include <vlGraphics/ActorTreeAbstract.hpp>
00041
00042 namespace vl
00043 {
00057 class VLGRAPHICS_EXPORT ActorKdTree: public ActorTreeAbstract
00058 {
00059 VL_INSTRUMENT_CLASS(vl::ActorKdTree, ActorTreeAbstract)
00060
00061 public:
00062 ActorKdTree()
00063 {
00064 VL_DEBUG_SET_OBJECT_NAME()
00065 }
00066 virtual int childrenCount() const;
00067 virtual ActorTreeAbstract* child(int i);
00068 virtual const ActorTreeAbstract* child(int i) const;
00069
00077 void buildKdTree(ActorCollection& actors, int max_depth=100, float minimum_volume=0);
00078
00081 void rebuildKdTree(int max_depth=100, float minimum_volume=0);
00082
00084 const Plane& plane() const { return mPlane; }
00085
00087 ActorKdTree* childN() { return mChildN.get(); }
00089 const ActorKdTree* childN() const { return mChildN.get(); }
00090
00092 ActorKdTree* childP() { return mChildP.get(); }
00094 const ActorKdTree* childP() const { return mChildP.get(); }
00095
00109 ActorKdTree* insertActor(Actor* actor);
00110
00114 ref<ActorKdTree> kdtreeFromNonLeafyActors(int max_depth=100, float minimum_volume=0);
00115
00119 void harvestNonLeafActors(ActorCollection& actors);
00120
00121 private:
00122 void setChildN(ActorKdTree* child)
00123 {
00124 VL_CHECK(child);
00125 if (mChildN)
00126 mChildN->mParent = NULL;
00127 child->mParent = this;
00128 mChildN=child;
00129 }
00130 void setChildP(ActorKdTree* child)
00131 {
00132 VL_CHECK(child);
00133 if (mChildP)
00134 mChildP->mParent = NULL;
00135 child->mParent = this;
00136 mChildP=child;
00137 }
00139 int scorePlane(const Plane& plane, const ActorCollection& actors);
00142 bool findBestPlane(Plane& plane, int& counter, ActorCollection& actors);
00144 void compileTree_internal(ActorCollection& acts, int& counter, int max_depth=100, float minimum_volume=0);
00146 void computeLocalAABB(const ActorCollection& actors);
00147
00148 protected:
00149 Plane mPlane;
00150 ref<ActorKdTree> mChildN;
00151 ref<ActorKdTree> mChildP;
00152 };
00153
00154 }
00155
00156 #endif