DtOctree.h

Go to the documentation of this file.

/****************************************************************************** 
** Copyright (c) 2023 MAK Technologies, Inc. 
** All rights reserved. 
******************************************************************************/ 

#pragma once

#include <vrvMath/DtAxisAlignedBoundingBox.h>
#include <vrvMath/DtOctreeNodeFwdDeclare.h>
#include <vrvMath/DtCameraFwdDeclare.h>

#include <list>


namespace makVrv {

   template<class T>
   class DtOctree
   {
   public:
      DtOctree( DtOctree * parent, DtOctree* treeRoot, size_t maxDepth );

      ~DtOctree();

      void addNode( DtOctreeNode<T> * );

      void removeNode( DtOctreeNode<T> * );

      int numNodes()
      {
         return myNumNodes;
      };

      DtAxisAlignedBoundingBox<T> myBox;

      DtVector3<T> myHalfSize;

      DtOctree* myChildren[ 2 ][ 2 ][ 2 ];

      bool isTwiceSize( const DtAxisAlignedBoundingBox<T> &box ) const;

      void getChildIndexes( const DtAxisAlignedBoundingBox<T> &, int *x, int *y, int *z ) const;

      void getCullBounds( DtAxisAlignedBoundingBox<T> * ) const;


      typedef std::list< DtOctreeNode<T> * > NodeList;
      typedef std::vector< DtOctreeNode<T> * > NodeVector;

      NodeList myNodes;

      void updateOctreeNode(DtOctreeNode<T>* pOctreeNode);
      void addOctreeNode(DtOctreeNode<T>* pOctreeNode, DtOctree<T>* pOctree, size_t depth = 0);
      void removeOctreeNode(DtOctreeNode<T>* pOctreeNode);

      void findVisibleObjects(NodeVector& visibleNodes
         , DtOctree* pOctree, const DtCamera<T>* pCamera, bool foundVisible) const;
      void findVisibleObjects(NodeVector& visibleNodes
         , DtOctree* pOctree, const Frustum<T>* pFrustum, bool foundVisible) const;
   protected:

      inline void ref()
      {
         myNumNodes++;

         if (myParent != 0)
         {
            myParent->ref();
         }
      };

      inline void unref()
      {
         myNumNodes--;

         if (myParent != 0)
         {
            myParent->unref();
         };
      }

      int myNumNodes;

      DtOctree* myParent;

      DtOctree* myOctreeRoot;

      size_t myMaxDepth;
   };

} //namespace makVrv

#include "DtOctree.inl"