To avoid linearly searching through lists of entities during environment testing, the world is carved up with an evenly spaced, axially aligned bsp tree. More...
#include <server.h>
Data Fields | |
int | axis |
float | dist |
struct worldSector_s * | children [2] |
sv_edict_t * | entities |
To avoid linearly searching through lists of entities during environment testing, the world is carved up with an evenly spaced, axially aligned bsp tree.
Definition at line 57 of file server.h.
-1 = leaf node
Definition at line 58 of file server.h.
Referenced by SV_AreaEdicts_r(), SV_CreateWorldSector(), and SV_LinkEdict().
struct worldSector_s* worldSector_s::children[2] |
Definition at line 60 of file server.h.
Referenced by SV_AreaEdicts_r(), SV_CreateWorldSector(), and SV_LinkEdict().
float worldSector_s::dist |
Definition at line 59 of file server.h.
Referenced by SV_AreaEdicts_r(), SV_CreateWorldSector(), and SV_LinkEdict().
Definition at line 61 of file server.h.
Referenced by SV_AreaEdicts_r(), SV_CreateWorldSector(), SV_LinkEdict(), and SV_UnlinkEdict().