| 1 |
/* RCSid: $Id: sm_stree.h,v 3.6 2003/02/22 02:07:25 greg Exp $ */ |
| 2 |
/* |
| 3 |
* sm_stree.h - header file for spherical quadtree code: |
| 4 |
* |
| 5 |
*/ |
| 6 |
#ifndef _RAD_SM_STREE_H_ |
| 7 |
#define _RAD_SM_STREE_H_ |
| 8 |
|
| 9 |
#ifdef __cplusplus |
| 10 |
extern "C" { |
| 11 |
#endif |
| 12 |
|
| 13 |
|
| 14 |
#define STR_INDEX(s) (stRoot_indices[(s)]) |
| 15 |
#define STR_NTH_INDEX(s,n) (stRoot_indices[(s)][(n)]) |
| 16 |
|
| 17 |
#define ST_NUM_ROOT_NODES 8 |
| 18 |
|
| 19 |
|
| 20 |
|
| 21 |
/* The base is an octahedron: Each face contains a planar quadtree. At |
| 22 |
the root level, the "top" (positive y) four faces, and bottom four faces |
| 23 |
are stored together:forming two root quadtree nodes |
| 24 |
*/ |
| 25 |
|
| 26 |
typedef struct _STREE { |
| 27 |
QUADTREE qt[2]; /* root[0]= top four faces, root[1]=bottom 4 faces*/ |
| 28 |
|
| 29 |
}STREE; |
| 30 |
|
| 31 |
|
| 32 |
#define ST_BASEI(n) ((n)>>2) /* root index: top or bottom */ |
| 33 |
#define ST_INDEX(n) ((n) & 0x3) /* which child in root */ |
| 34 |
#define ST_QT(s,i) ((s)->qt[ST_BASEI(i)]) /* top or bottom root*/ |
| 35 |
#define ST_QT_PTR(s,i) (&ST_QT(s,i)) /* ptr to top(0)/bottom(1)root*/ |
| 36 |
#define ST_TOP_QT(s) ((s)->qt[0]) /* top root (y>0)*/ |
| 37 |
#define ST_BOTTOM_QT(s) ((s)->qt[1]) /* bottom qt (y <= 0)*/ |
| 38 |
#define ST_TOP_QT_PTR(s) (&ST_TOP_QT(s)) /* ptr to top qt */ |
| 39 |
#define ST_BOTTOM_QT_PTR(s) (&ST_BOTTOM_QT(s)) /* ptr to bottom qt*/ |
| 40 |
|
| 41 |
#define ST_NTH_V(s,n,w) (stDefault_base[stBase_verts[n][w]]) |
| 42 |
#define ST_ROOT_QT(s,n) QT_NTH_CHILD(ST_QT(s,n),ST_INDEX(n)) |
| 43 |
|
| 44 |
#define ST_CLEAR_QT(st) (ST_TOP_QT(st)=EMPTY,ST_BOTTOM_QT(st)=EMPTY) |
| 45 |
#define ST_INIT_QT(st) (QT_CLEAR_CHILDREN(ST_TOP_QT(st)), \ |
| 46 |
QT_CLEAR_CHILDREN(ST_BOTTOM_QT(st))) |
| 47 |
|
| 48 |
#define ST_CLEAR_FLAGS(s) qtClearAllFlags() |
| 49 |
|
| 50 |
/* Point location based on coordinate signs */ |
| 51 |
#define stLocate_root(p) (((p)[2]>0.0?0:4)|((p)[1]>0.0?0:2)|((p)[0]>0.0?0:1)) |
| 52 |
#define stClear(st) stInit(st) |
| 53 |
|
| 54 |
#define ST_CLIP_VERTS 16 |
| 55 |
/* STREE functions |
| 56 |
void stInit(STREE *st,FVECT center) |
| 57 |
Initializes an stree structure with origin 'center': |
| 58 |
Frees existing quadtrees hanging off of the roots |
| 59 |
|
| 60 |
STREE *stAlloc(STREE *st) |
| 61 |
Allocates a stree structure and creates octahedron base |
| 62 |
|
| 63 |
|
| 64 |
QUADTREE stPoint_locate(STREE *st,FVECT p) |
| 65 |
Returns quadtree leaf node containing point 'p'. |
| 66 |
|
| 67 |
int stAdd_tri(STREE *st,int id,FVECT t0,t1,t2) |
| 68 |
Add triangle 'id' with coordinates 't0,t1,t2' to the stree: returns |
| 69 |
FALSE on error, TRUE otherwise |
| 70 |
|
| 71 |
int stRemove_tri(STREE *st,int id,FVECT t0,t1,t2) |
| 72 |
Removes triangle 'id' with coordinates 't0,t1,t2' from stree: returns |
| 73 |
FALSE on error, TRUE otherwise |
| 74 |
|
| 75 |
int stTrace_ray(STREE *st,FVECT orig,dir,int (*func)(),int *arg1,*arg2) |
| 76 |
Trace ray 'orig-dir' through stree and apply 'func(arg1,arg2)' at each |
| 77 |
node that it intersects |
| 78 |
|
| 79 |
int stApply_to_tri(STREE *st,FVECT t0,t1,t2,int (*edge_func)(), |
| 80 |
(*tri_func)(),int arg1,*arg2) |
| 81 |
Visit nodes intersected by tri 't0,t1,t2'.Apply 'edge_func(arg1,arg2,arg3)', |
| 82 |
to those nodes intersected by edges, and interior_func to ALL nodes: |
| 83 |
ie some Nodes will be visited more than once |
| 84 |
*/ |
| 85 |
|
| 86 |
extern int stBase_verts[8][3]; |
| 87 |
extern FVECT stDefault_base[6]; |
| 88 |
extern STREE *stAlloc(); |
| 89 |
extern QUADTREE stPoint_locate(); |
| 90 |
|
| 91 |
#ifdef __cplusplus |
| 92 |
} |
| 93 |
#endif |
| 94 |
#endif /* _RAD_SM_STREE_H_ */ |
| 95 |
|
| 96 |
|
