bih.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	bih_leaf_t
struct	bih_node_t
struct	bih_t

Macros
#define	BIH_MAXUNORDEREDCHILDREN   8

Enumerations
enum	bih_leaftype_t { BIH_BRUSH = 4 , BIH_COLLISIONTRIANGLE = 5 , BIH_RENDERTRIANGLE = 6 }
enum	bih_nodetype_t { BIH_SPLITX = 0 , BIH_SPLITY = 1 , BIH_SPLITZ = 2 , BIH_UNORDERED = 3 }
enum	biherror_t { BIHERROR_OK , BIHERROR_OUT_OF_NODES }

Functions
int	BIH_Build (bih_t *bih, int numleafs, bih_leaf_t *leafs, int maxnodes, bih_node_t *nodes, int *temp_leafsort, int *temp_leafsortscratch)
int	BIH_GetTriangleListForBox (const bih_t *bih, int maxtriangles, int *trianglelist_idx, int *trianglelist_surf, const float *mins, const float *maxs)

Macro Definition Documentation

BIH_MAXUNORDEREDCHILDREN

#define BIH_MAXUNORDEREDCHILDREN   8

Definition at line 9 of file bih.h.

Referenced by BIH_BuildNode(), BIH_GetTriangleListForBox_Node(), Mod_CollisionBIH_TraceBrush(), Mod_CollisionBIH_TraceLineShared(), Mod_CollisionBIH_TracePoint(), and R_Q1BSP_RecursiveGetLightInfo_BIH().

Enumeration Type Documentation

bih_leaftype_t

enum bih_leaftype_t

Enumerator
BIH_BRUSH
BIH_COLLISIONTRIANGLE
BIH_RENDERTRIANGLE

Definition at line 27 of file bih.h.

{
    BIH_BRUSH = 4,
    BIH_COLLISIONTRIANGLE = 5,
    BIH_RENDERTRIANGLE = 6
}

bih_nodetype_t

enum bih_nodetype_t

Enumerator
BIH_SPLITX
BIH_SPLITY
BIH_SPLITZ
BIH_UNORDERED

Definition at line 18 of file bih.h.

{
    BIH_SPLITX = 0,
    BIH_SPLITY = 1,
    BIH_SPLITZ = 2,
    BIH_UNORDERED = 3,
}

biherror_t

enum biherror_t

Enumerator
BIHERROR_OK
BIHERROR_OUT_OF_NODES

Definition at line 11 of file bih.h.

{
    BIHERROR_OK, // no error, be happy
    BIHERROR_OUT_OF_NODES // could not produce complete hierarchy, maxnodes too low (should be roughly half of numleafs)
}

Function Documentation

BIH_Build()

int BIH_Build	(	bih_t *	bih,
		int	numleafs,
		bih_leaf_t *	leafs,
		int	maxnodes,
		bih_node_t *	nodes,
		int *	temp_leafsort,
		int *	temp_leafsortscratch )

Definition at line 133 of file bih.c.

{
    int i;
 
    memset(bih, 0, sizeof(*bih));
    bih->numleafs = numleafs;
    bih->leafs = leafs;
    bih->leafsort = temp_leafsort;
    bih->leafsortscratch = temp_leafsortscratch;
    bih->numnodes = 0;
    bih->maxnodes = maxnodes;
    bih->nodes = nodes;
 
    // clear things we intend to rebuild
    memset(bih->nodes, 0, sizeof(bih->nodes[0]) * bih->maxnodes);
    for (i = 0;i < bih->numleafs;i++)
        bih->leafsort[i] = i;
 
    bih->rootnode = BIH_BuildNode(bih, bih->numleafs, bih->leafsort, bih->mins, bih->maxs);
    return bih->error;
}

References BIH_BuildNode(), bih_t::error, i, bih_t::leafs, bih_t::leafsort, bih_t::leafsortscratch, bih_t::maxnodes, bih_t::maxs, bih_t::mins, bih_t::nodes, bih_t::numleafs, bih_t::numnodes, and bih_t::rootnode.

Referenced by Mod_MakeCollisionBIH().

BIH_GetTriangleListForBox()

int BIH_GetTriangleListForBox	(	const bih_t *	bih,
		int	maxtriangles,
		int *	trianglelist_idx,
		int *	trianglelist_surf,
		const float *	mins,
		const float *	maxs )

Definition at line 211 of file bih.c.

{
    int numtriangles = 0;
    BIH_GetTriangleListForBox_Node(bih, bih->rootnode, maxtriangles, trianglelist_idx, trianglelist_surf, &numtriangles, mins, maxs);
    return numtriangles;
}

References BIH_GetTriangleListForBox_Node(), maxs, mins, and bih_t::rootnode.

Referenced by R_DecalSystem_SplatEntity().