RiBBoxArray Documentation

RiBBoxArray

An efficient representation of a bounding box hiearchy.

class RiBBoxArray : public RiBBox
{

public:

	// Constructors and assignment
	RiBBoxArray();
	RiBBoxArray(const RiBBoxNode node, RiBBoxArray skip);

	// Accessors
RiRayObject *	GetPrimitive();
RiBBoxArray *	GetSkip();
protected:

}; // RiBBoxArray

Store the tree in depth first order with a pointer to the node to go to if this node is missed.

Default Constructor

    RiBBoxArray();

    RiBBoxArray(const RiBBoxNode *node, RiBBoxArray *skip);

    RiRayObject *GetPrimitive();

    RiBBoxArray *GetSkip();

public:
RiReal	GetArea();
RiBBox	operator\|(const RiBBox &) const;
const RiBBox &operator\|=	=(const RiBBox &);
const RiBBox &	operator&=(const RiBBox &);
bool	Intersect(RiReal bmin, RiReal bmax, RiReal num, RiReal den) const;
bool	IntersectPPP(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectPPM(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectPMP(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectPMM(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectMPP(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectMPM(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectMMP(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
bool	IntersectMMM(RiReal bmin, RiReal bmax, const RiReal num, const RiReal den) const;
RiInterval	GetSlab(int i) const;
RiInterval	GetMinMax(const RiUnitVector3 &dir) const ;

	// Accessors
RiRayObject *	GetPrimitive();
RiBBoxArray *	GetSkip();
protected:

Inheritance chain for RiBBoxArray:

Class is not inherited by any others.

Generated from source by the Cocoon utilities on Fri Feb 25 15:15:51 2000 .