RiBBoxNode[ Ray | Source | Search | Keywords | Summary | Ancestors | All Members | Descendants ]
| public: | |
| RiBBoxNode(); | |
| RiBBoxNode(RiRayObject *); | |
| RiReal | EC(); |
| RiReal | AIC(); |
| RiReal & | SumEC(); |
| RiReal & | SumAIC(); |
| RiBBoxNode *& | SkipNode() ; |
| RiBBoxNode *& | LeftChild(); |
| RiBBoxNode *& | RightSibling(); |
| RiBBoxNode *& | Parent(); |
| RiRayObject *& | Primitive(); |
| RiBBoxNode * | SkipNode() const ; |
| RiBBoxNode * | LeftChild() const; |
| RiBBoxNode * | RightSibling() const; |
| RiBBoxNode * | Parent() const; |
| RiRayObject * | Primitive() const; |
| void | SwapData(RiBBoxNode &node2); |
| int | NumChildren() const; |
| void | AddAsSibling(RiBBoxNode *child, RiBBoxNode *sib); |
| void | AddAsChild(RiBBoxNode *child); |
| protected: |
RiBBoxNode();
oxNode();No documentation available.
RiBBoxNode();
RiBBoxNode(RiRayObject *);
RiReal EC();
RiReal AIC();
RiReal &SumEC();
RiReal &SumAIC();
RiBBoxNode *&SkipNode()
;
Function is currently defined inline.
RiBBoxNode *&LeftChild();
RiBBoxNode *&RightSibling();
RiBBoxNode *&Parent();
RiRayObject *&Primitive();
RiBBoxNode *SkipNode() const
;
Function is currently defined inline.
RiBBoxNode *LeftChild() const;
RiBBoxNode *RightSibling() const;
RiBBoxNode *Parent() const;
RiRayObject *Primitive() const;
void SwapData(RiBBoxNode &node2);
int NumChildren() const;
void AddAsSibling(RiBBoxNode *child, RiBBoxNode *sib);
void AddAsChild(RiBBoxNode *child); // not if *this has primitive (use AddAsSibling)
| 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 ; | |
| RiReal | EC(); | |
| RiReal | AIC(); | |
| RiReal & | SumEC(); | |
| RiReal & | SumAIC(); | |
| RiBBoxNode *& | SkipNode() ; | |
| RiBBoxNode *& | LeftChild(); | |
| RiBBoxNode *& | RightSibling(); | |
| RiBBoxNode *& | Parent(); | |
| RiRayObject *& | Primitive(); | |
| RiBBoxNode * | SkipNode() const ; | |
| RiBBoxNode * | LeftChild() const; | |
| RiBBoxNode * | RightSibling() const; | |
| RiBBoxNode * | Parent() const; | |
| RiRayObject * | Primitive() const; | |
| void | SwapData(RiBBoxNode &node2); | |
| int | NumChildren() const; | |
| void | AddAsSibling(RiBBoxNode *child, RiBBoxNode *sib); | |
| void | AddAsChild(RiBBoxNode *child); | |
| protected: | ||