Finds (with high probability) the k nearest neighbors in tr for each of the given (row-)vectors in desc, using best-bin-first searching ([Beis97]). The complexity of the entire operation is at most O(m*emax*log2(n)), where n is the number of vectors in the tree

public static void cvFindFeatures(
	IntPtr tr,
	IntPtr desc,
	IntPtr results,
	IntPtr dist,
	int k,
	int emax
)

Public Shared Sub cvFindFeatures ( _
	tr As IntPtr, _
	desc As IntPtr, _
	results As IntPtr, _
	dist As IntPtr, _
	k As Integer, _
	emax As Integer _
)

public:
static void cvFindFeatures(
	IntPtr tr, 
	IntPtr desc, 
	IntPtr results, 
	IntPtr dist, 
	int k, 
	int emax
)