Method | Description | |
---|---|---|
AnnKdSearch ( double points, int n, int dim, double eps = 0.0 ) : double>>.List |
||
AnnKdSearch ( double point, double eps = 0.0 ) : double>.Tuple |
||
AnnKdSearch ( double point, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
AnnkFRSearch ( double point, double squareRadius, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
AnnkPriSearch ( double point, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
InitKdTree ( double points, int bucketSize = 1, ANNSplitRule splitRule = ANNSplitRule.ANN_KD_SUGGEST ) : void | ||
InitKdTree ( double points, int n, int dim, int bucketSize = 1, ANNSplitRule splitRule = ANNSplitRule.ANN_KD_SUGGEST ) : void |
Method | Description | |
---|---|---|
AnnAllocPt ( int dim, double c ) : double* | ||
AnnAllocPts ( int n, int dim ) : double** | ||
AnnClose ( ) : void | ||
AnnCopyPt ( int dim, double source ) : double* | ||
AnnDeallocPt ( double p ) : double* | ||
AnnDeallocPts ( double p ) : double* | ||
AnnDist ( int dim, double p, double q ) : double* | ||
AnnFree ( ) : void | ||
AnnKdQuerySearch ( double q, int n, int dim, int nnIdx, double dd, double eps = 0.0 ) : void | ||
AnnMaxPtsVisit ( int maxPts ) : void |
public static AnnKdSearch ( double points, int n, int dim, double eps = 0.0 ) : double>>.List |
||
points | double | |
n | int | |
dim | int | |
eps | double | |
return | double>>.List |
public static AnnKdSearch ( double point, double eps = 0.0 ) : double>.Tuple |
||
point | double | |
eps | double | |
return | double>.Tuple |
public static AnnKdSearch ( double point, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
point | double | |
nearNeighbourCount | int | |
indexes | int | |
distances | double | |
eps | double | |
return | void |
public static AnnkFRSearch ( double point, double squareRadius, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
point | double | |
squareRadius | double | |
nearNeighbourCount | int | |
indexes | int | |
distances | double | |
eps | double | |
return | void |
public static AnnkPriSearch ( double point, int nearNeighbourCount, int &indexes, double &distances, double eps = 0.0 ) : void | ||
point | double | |
nearNeighbourCount | int | |
indexes | int | |
distances | double | |
eps | double | |
return | void |
public static InitKdTree ( double points, int bucketSize = 1, ANNSplitRule splitRule = ANNSplitRule.ANN_KD_SUGGEST ) : void | ||
points | double | |
bucketSize | int | |
splitRule | ANNSplitRule | |
return | void |
public static InitKdTree ( double points, int n, int dim, int bucketSize = 1, ANNSplitRule splitRule = ANNSplitRule.ANN_KD_SUGGEST ) : void | ||
points | double | |
n | int | |
dim | int | |
bucketSize | int | |
splitRule | ANNSplitRule | |
return | void |