|
ocssw
1.0
|
Go to the source code of this file.
Classes | |
| struct | vector |
| struct | KDtree |
Defines | |
| #define | vdiff(x1, x2, y1, y2, z1, z2) ((((x1)-(x2))*((x1)-(x2)))+(((y1)-(y2))*((y1)-(y2)))+(((z1)-(z2))*((z1)-(z2)))) |
| #define | minreach(x, xstart) (((x)>=(xstart)) ? (x) : (xstart)) |
| #define | maxreach(x, xend) (((x)<=(xend)) ? (x) : (xend)) |
| #define | vlength(x, y, z) ((x)*(x)+(y)*(y)+(z)*(z)) |
Functions | |
| void | v_insert (vector **m_pt, vector *t) |
| void | newKDtree (KDtree **Tree) |
| void | freeKDtree (KDtree *Tree) |
| void | m_fnInsert (KDtree **Tree, vector *t) |
| int | m_bfnNearestNeighbor (KDtree *Tree, float dRadius, vector *tClosest, vector *t) |
| int | m_bfnFarthestNeighbor (KDtree *Tree, vector **tFarthest, vector *t) |
| int32_t | m_lfnFindInSphere (KDtree *Tree, float dRadius, vector **tClosest, vector *t) |
| void | m_lfnInSphere (KDtree *Tree, float dRadius, vector *t, vector **tClosest, int32_t *lReturn) |
| int | m_bfnNearest (KDtree *Tree, float *dRadius, vector *tClosest, vector *t) |
| int | m_bfnFindFarthest (KDtree *Tree, float *dRadius, vector **tFarthest, vector *t) |
| void | alloc_Vector (vector *v, float da, float db, float dc, int32_t dd) |
| float | vdistance (vector *v1, vector *v2) |
| #define maxreach | ( | x, | |
| xend | |||
| ) | (((x)<=(xend)) ? (x) : (xend)) |
Definition at line 11 of file KDvector.h.
| #define minreach | ( | x, | |
| xstart | |||
| ) | (((x)>=(xstart)) ? (x) : (xstart)) |
Definition at line 10 of file KDvector.h.
| #define vdiff | ( | x1, | |
| x2, | |||
| y1, | |||
| y2, | |||
| z1, | |||
| z2 | |||
| ) | ((((x1)-(x2))*((x1)-(x2)))+(((y1)-(y2))*((y1)-(y2)))+(((z1)-(z2))*((z1)-(z2)))) |
Definition at line 9 of file KDvector.h.
| #define vlength | ( | x, | |
| y, | |||
| z | |||
| ) | ((x)*(x)+(y)*(y)+(z)*(z)) |
Definition at line 12 of file KDvector.h.
| void alloc_Vector | ( | vector * | v, |
| float | da, | ||
| float | db, | ||
| float | dc, | ||
| int32_t | dd | ||
| ) |
| void freeKDtree | ( | KDtree * | Tree | ) |
| int m_bfnFarthestNeighbor | ( | KDtree * | Tree, |
| vector ** | tFarthest, | ||
| vector * | t | ||
| ) |
| int m_bfnFindFarthest | ( | KDtree * | Tree, |
| float * | dRadius, | ||
| vector ** | tFarthest, | ||
| vector * | t | ||
| ) |
| int m_bfnNearest | ( | KDtree * | Tree, |
| float * | dRadius, | ||
| vector * | tClosest, | ||
| vector * | t | ||
| ) |
| int m_bfnNearestNeighbor | ( | KDtree * | Tree, |
| float | dRadius, | ||
| vector * | tClosest, | ||
| vector * | t | ||
| ) |
| void m_fnInsert | ( | KDtree ** | Tree, |
| vector * | t | ||
| ) |
| int32_t m_lfnFindInSphere | ( | KDtree * | Tree, |
| float | dRadius, | ||
| vector ** | tClosest, | ||
| vector * | t | ||
| ) |
| void m_lfnInSphere | ( | KDtree * | Tree, |
| float | dRadius, | ||
| vector * | t, | ||
| vector ** | tClosest, | ||
| int32_t * | lReturn | ||
| ) |
1.7.6.1