Go to the source code of this file.
Namespaces | |
| namespace | icp |
Defines | |
| #define | INT_SWAP(X, Y) { swap_tmp_int=X; X=Y; Y=swap_tmp_int; } |
Functions | |
| Tree * | icp::build_kdtree (double *reference, int N, int D, int *index, int L, int offset) |
| Node * | icp::build_kdtree_core (double *reference, int N, int D, int *index, int L, int offset) |
| double | icp::calcdistance (double *pt1, double *pt2, int Dim) |
| void | icp::display_tree (Node *nodeptr, int D) |
| void | icp::free_tree (Node *pVertex) |
| int | icp::partition (int *a, int p, int r, double *reference, int offset, int D) |
| Node * | icp::pointLocation (Node *v, double *pt, int D) |
| void | icp::quicksort (int *ra, int p, int r, double *reference, int offset, int D) |
| Node * | icp::rangeQuery (Node *v, double distance, double *pt, int D) |
| void | icp::run_queries (Node *pVertex, double *model, int M, int D, double *closest_pt, double *distance, short ReturnType) |
| void | icp::run_range_search (Node *pVertex, double *model, int M, int D, double distlim, double **pts_in_range, unsigned int *L, unsigned int **indices) |
Variables | |
| int | icp::swap_tmp_int |
| #define INT_SWAP | ( | X, | |
| Y | |||
| ) | { swap_tmp_int=X; X=Y; Y=swap_tmp_int; } |
Definition at line 16 of file kdtree_common.cc.
