src/KDTree.h

Go to the documentation of this file.

#ifndef KDTREE_H
#define KDTREE_H


#include <vector>
#include <cassert>

#include "Box.h"
#include "Axis.h"


class Node;
class Primitive;
class Ray;


class KDTree
{
public:
    typedef std::vector<Primitive *> PrimitiveList;


    KDTree( unsigned int min_primitives,
            unsigned int max_depth )
        : mBoundingBox(),
            mRootNode(NULL),
            mMinPrimitives(min_primitives),
            mMaxDepth(max_depth)
    {
    }

    virtual ~KDTree();

    virtual bool intersect(Ray & ray) const;

    virtual void buildTree( const PrimitiveList &   list,
                            const Box &             bbox );

    void setConstraints(    unsigned int min_primitives,
                            unsigned int max_depth )
    {
        mMinPrimitives  = min_primitives;
        mMaxDepth       = max_depth;
    }

    unsigned int minPrimitives() const
    {
        return mMinPrimitives;
    }

    unsigned int maxDepth() const
    {
        return mMaxDepth;
    }

protected:
    Box             mBoundingBox;

    Node *          mRootNode;

    unsigned int    mMinPrimitives;

    unsigned int    mMaxDepth;


    virtual bool intersect( const Node *    node,
                            Ray &           ray,
                            float           min,
                            float           max ) const;

    virtual bool terminate( const Node *    current,
                            float           dummy,
                            unsigned int    depth ) const;
};


#endif

---