1 /*---------------------------------------------------------------------------*\
5 * Copyright (C) 2011 by the OpenSG Forum *
9 * contact: dirk@opensg.org, gerrit.voss@vossg.org, jbehr@zgdv.de *
11 \*---------------------------------------------------------------------------*/
12 /*---------------------------------------------------------------------------*\
15 * This library is free software; you can redistribute it and/or modify it *
16 * under the terms of the GNU Library General Public License as published *
17 * by the Free Software Foundation, version 2. *
19 * This library is distributed in the hope that it will be useful, but *
20 * WITHOUT ANY WARRANTY; without even the implied warranty of *
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
22 * Library General Public License for more details. *
24 * You should have received a copy of the GNU Library General Public *
25 * License along with this library; if not, write to the Free Software *
26 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. *
28 \*---------------------------------------------------------------------------*/
33 IntersectKDTreeNode::setLeaf(UInt32 triCount, UInt32 triOffset)
37 _triOffset = triOffset;
41 IntersectKDTreeNode::setInterior(FlagsE axis, UInt32 childOffset, Real32 split)
49 IntersectKDTreeNode::isLeaf(void) const
51 return (_flags == Leaf);
55 IntersectKDTreeNode::getChildOffset(void) const
61 IntersectKDTreeNode::getSplitAxis(void) const
67 IntersectKDTreeNode::getSplit(void) const
73 IntersectKDTreeNode::getTriCount(void) const
79 IntersectKDTreeNode::getTriOffset(void) const
85 operator==(const IntersectKDTreeNode &lhs, const IntersectKDTreeNode &rhs)
89 if(lhs.isLeaf() == rhs.isLeaf())
91 if(lhs.getTriOffset() == rhs.getTriOffset())
93 result = (lhs.getTriCount() == rhs.getTriCount());
98 if(lhs.getChildOffset() == rhs.getChildOffset())
100 if(lhs.getSplitAxis() == rhs.getSplitAxis())
102 result = (lhs.getSplit() == rhs.getSplit());