Classes |
| struct | icp::icp::node |
| struct | icp::icp::timevalg |
| struct | icp::icp::timezone |
| struct | icp::icp::tree |
Namespaces |
| namespace | icp |
| namespace | icp::icp |
Defines |
| #define | EVAL_INDEX(X, Y, L) (reference[ (Y)*(L) +(X)]) |
| #define | mxArray double |
| #define | mxCreateDoubleMatrix(n, m, t) malloc(sizeof(t)*n*m) |
| #define | mxREAL double |
| #define | RETURN_INDEX 102 |
| #define | RETURN_POINTS 101 |
Typedefs |
| typedef struct icp::icp::node | icp::icp::Node |
| typedef struct icp::icp::tree | icp::icp::Tree |
| typedef struct icp::icp::timevalg | icp::icp::TV |
| typedef struct icp::icp::timezone | icp::icp::TZ |
Functions |
| Tree * | icp::icp::build_kdtree (double *reference, int N, int D, int *index, int L, int offset) |
| Node * | icp::icp::build_kdtree_core (double *reference, int N, int D, int *index, int L, int offset) |
| double | icp::icp::calcdistance (double *pt1, double *pt2, int Dim) |
| void | icp::icp::display_tree (Node *nodeptr, int D) |
| void | icp::icp::free_tree (Node *pVertex) |
| void | icp::kdtree_main () |
| void | icp::mexFunction (int nlhs, mxArray **plhs, int nrhs, const mxArray **prhs) |
| int | icp::icp::partition (int *a, int p, int r, double *reference, int offset, int D) |
| Node * | icp::icp::pointLocation (Node *v, double *pt, int D) |
| void | icp::icp::quicksort (int *ra, int p, int r, double *reference, int offset, int D) |
| Node * | icp::icp::rangeQuery (Node *v, double distance, double *pt, int D) |
| void | icp::icp::run_queries (Node *pVertex, double *model, int M, int D, double *closest_pt, double *distance, short ReturnType) |
| void | icp::icp::run_range_search (Node *pVertex, double *model, int M, int D, double distlim, double **pts_in_range, unsigned int *L, unsigned int **indices) |
