Classes | |
| struct | node |
| struct | timevalg |
| struct | timezone |
| struct | tree |
Typedefs | |
| typedef struct icp::icp::node | Node |
| typedef struct icp::icp::tree | Tree |
| typedef struct icp::icp::timevalg | TV |
| typedef struct icp::icp::timezone | TZ |
Functions | |
| Tree * | build_kdtree (double *reference, int N, int D, int *index, int L, int offset) |
| Node * | build_kdtree_core (double *reference, int N, int D, int *index, int L, int offset) |
| double | calcdistance (double *pt1, double *pt2, int Dim) |
| void | display_tree (Node *nodeptr, int D) |
| void | free_tree (Node *pVertex) |
| int | partition (int *a, int p, int r, double *reference, int offset, int D) |
| Node * | pointLocation (Node *v, double *pt, int D) |
| void | quicksort (int *ra, int p, int r, double *reference, int offset, int D) |
| Node * | rangeQuery (Node *v, double distance, double *pt, int D) |
| void | run_queries (Node *pVertex, double *model, int M, int D, double *closest_pt, double *distance, short ReturnType) |
| void | run_range_search (Node *pVertex, double *model, int M, int D, double distlim, double **pts_in_range, unsigned int *L, unsigned int **indices) |
| 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 |
| Tree* icp::icp::build_kdtree | ( | double * | reference, | |
| int | N, | |||
| int | D, | |||
| int * | index, | |||
| int | L, | |||
| int | offset | |||
| ) |
Definition at line 21 of file kdtree_common.cc.
| Node* icp::icp::build_kdtree_core | ( | double * | reference, | |
| int | N, | |||
| int | D, | |||
| int * | index, | |||
| int | L, | |||
| int | offset | |||
| ) |
Definition at line 37 of file kdtree_common.cc.
| double icp::icp::calcdistance | ( | double * | pt1, | |
| double * | pt2, | |||
| int | Dim | |||
| ) |
Definition at line 146 of file kdtree_common.cc.
| void icp::icp::display_tree | ( | Node * | nodeptr, | |
| int | D | |||
| ) |
Definition at line 306 of file kdtree_common.cc.
| void icp::icp::free_tree | ( | Node * | pVertex | ) |
Definition at line 130 of file kdtree_common.cc.
| int icp::icp::partition | ( | int * | a, | |
| int | p, | |||
| int | r, | |||
| double * | reference, | |||
| int | offset, | |||
| int | D | |||
| ) |
Definition at line 100 of file kdtree_common.cc.
| Node* icp::icp::pointLocation | ( | Node * | v, | |
| double * | pt, | |||
| int | D | |||
| ) |
Definition at line 155 of file kdtree_common.cc.
| void icp::icp::quicksort | ( | int * | ra, | |
| int | p, | |||
| int | r, | |||
| double * | reference, | |||
| int | offset, | |||
| int | D | |||
| ) |
Definition at line 115 of file kdtree_common.cc.
| Node* icp::icp::rangeQuery | ( | Node * | v, | |
| double | distance, | |||
| double * | pt, | |||
| int | D | |||
| ) |
Definition at line 178 of file kdtree_common.cc.
| void icp::icp::run_queries | ( | Node * | pVertex, | |
| double * | model, | |||
| int | M, | |||
| int | D, | |||
| double * | closest_pt, | |||
| double * | distance, | |||
| short | ReturnType | |||
| ) |
Definition at line 231 of file kdtree_common.cc.
| 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 | |||
| ) |
Definition at line 341 of file kdtree_common.cc.
