2 // This code written in 2010 by Forest Hale (lordhavoc ghdigital com), and placed into public domain.
4 // Based on information in http://zach.in.tu-clausthal.de/papers/vrst02.html (in particular vrst02_boxtree.pdf)
9 typedef enum biherror_e
11 BIHERROR_OK, // no error, be happy
12 BIHERROR_OUT_OF_NODES, // could not produce complete hierarchy, maxnodes too low (should be roughly half of numleafs)
16 typedef enum bih_nodetype_e
24 typedef enum bih_leaftype_e
27 BIH_COLLISIONTRIANGLE = 4,
28 BIH_RENDERTRIANGLE = 5,
32 typedef struct bih_node_s
34 bih_nodetype_t type; // = BIH_SPLITX and similar values
35 // TODO: store just one float for distance, and have BIH_SPLITMINX and BIH_SPLITMAXX distinctions, to reduce memory footprint and traversal time, as described in the paper (vrst02_boxtree.pdf)
36 // TODO: move bounds data to parent node and remove it from leafs?
39 // < 0 is a leaf index (-1-leafindex), >= 0 is another node index (always >= this node's index)
42 // interval of children
43 float frontmin; // children[0]
44 float backmax; // children[1]
48 typedef struct bih_leaf_s
50 bih_leaftype_t type; // = BIH_BRUSH And similar values
53 // data past this point is generic and entirely up to the caller...
56 int itemindex; // triangle or brush index
63 // leafs are constructed by caller before calling BIH_Build
66 // nodes are constructed by BIH_Build
69 int rootnode; // 0 if numnodes > 0, -1 otherwise
70 // bounds calculated by BIH_Build
74 // fields used only during BIH_Build:
76 int error; // set to a value if an error occurs in building (such as numnodes == maxnodes)
82 int BIH_Build(bih_t *bih, int numleafs, bih_leaf_t *leafs, int maxnodes, bih_node_t *nodes, int *temp_leafsort, int *temp_leafsortscratch);
84 int BIH_GetTriangleListForBox(const bih_t *bih, int maxtriangles, int *trianglelist_idx, int *trianglelist_surf, const float *mins, const float *maxs);