Classes | Namespaces | Defines | Typedefs | Functions
kdtree_common.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  icp::node
struct  icp::timevalg
struct  icp::timezone
struct  icp::tree

Namespaces

namespace  icp

Defines

#define EVAL_INDEX(X, Y, L)   (reference[ (Y)*(L) +(X)])
#define RETURN_INDEX   102
#define RETURN_POINTS   101

Typedefs

typedef struct icp::node icp::Node
typedef struct icp::tree icp::Tree
typedef struct icp::timevalg icp::TV
typedef struct icp::timezone icp::TZ

Functions

Tree * icp::build_kdtree (double *reference, int N, int D, int *index, int L, int offset)
Nodeicp::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)
Nodeicp::pointLocation (Node *v, double *pt, int D)
void icp::quicksort (int *ra, int p, int r, double *reference, int offset, int D)
Nodeicp::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)

Define Documentation

#define EVAL_INDEX (   X,
  Y,
 
)    (reference[ (Y)*(L) +(X)])

Definition at line 39 of file kdtree_common.h.

#define RETURN_INDEX   102

Definition at line 33 of file kdtree_common.h.

#define RETURN_POINTS   101

Definition at line 32 of file kdtree_common.h.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Properties Friends Defines


icp
Author(s): Maintained by Juergen Sturm
autogenerated on Wed Dec 26 2012 15:34:47