+ // node indexes of children (always > this node's index)
+ int front;
+ int back;
+ // interval of children
+ float frontmin; // children[0]
+ float backmax; // children[1]
+ // BIH_UNORDERED uses this for a list of leafindex (all >= 0), -1 = end of list
+ int children[BIH_MAXUNORDEREDCHILDREN];