LinearBVH.h

Go to the documentation of this file.

#pragma once
#include "DataTypes.h"
#include "TopologyConstants.h"
 
#include "Array/Array.h"
#include "STL/List.h"
 
#include "Primitive/Primitive3D.h"
 
#include "Algorithm/Reduction.h"

namespace dyno 
{
    class BVHNode
    {
    public:
        DYN_FUNC BVHNode() {
            parent = EMPTY;
            left = EMPTY;
            right = EMPTY;
        };
 
        DYN_FUNC bool isLeaf() { return left == EMPTY && right == EMPTY; }
 
        int parent;
 
        int left;
        int right;
    };
 
    template<typename TDataType>
    class LinearBVH
    {
    public:
        typedef typename TDataType::Real Real;
        typedef typename TDataType::Coord Coord;
        typedef typename ::dyno::TAlignedBox3D<Real> AABB;
        typedef typename ::dyno::BVHNode Node;
        typedef typename ::dyno::BVHNode* NodePtr;
 
        LinearBVH();
        ~LinearBVH();
 
        void construct(const DArray<AABB>& aabb);
 
        GPU_FUNC uint requestIntersectionNumber(const AABB& queryAABB, const int queryId = EMPTY) const;
        GPU_FUNC void requestIntersectionIds(List<int>& ids, const AABB& queryAABB, const int queryId = EMPTY) const;
 
        GPU_FUNC NodePtr getRoot() const { return &mAllNodes[0]; }
 
        GPU_FUNC AABB getAABB(const uint idx) const { return mSortedAABBs[idx]; }
        GPU_FUNC uint getObjectIdx(const uint idx) const { return mSortedObjectIds[idx]; }
 
        CPU_FUNC DArray<AABB>& getSortedAABBs() { return mSortedAABBs; }

        void release();
 
    private:
        DArray<Node> mAllNodes;
 
        DArray<Coord> mCenters;        //AABB center
 
        DArray<AABB> mSortedAABBs;
        DArray<uint> mSortedObjectIds;
 
        DArray<uint> mFlags;      //Flags used for calculating bounding box
 
        DArray<uint64> mMortonCodes;
    };
}