Lines Matching full:points
69 virtual int findNeighbors( Mat& points, Mat& neighbors ) = 0;
93 Mat points( pointsCount, dims, CV_32FC1 );
102 points.at<float>(pi, d) = data.at<float>(fi, d) + rng.uniform(0.0f, 1.0f) * noise;
105 code = findNeighbors( points, results );
167 int knnSearch( Mat& points, Mat& neighbors );
168 int radiusSearch( Mat& points, Mat& neighbors );
178 int CV_FlannTest::knnSearch( Mat& points, Mat& neighbors )
180 Mat dist( points.rows, neighbors.cols, CV_32FC1);
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() );
188 for( int i = 0; i < points.rows; i++ )
190 float* fltPtr = points.ptr<float>(i);
191 vector<float> query( fltPtr, fltPtr + points.cols );
207 int CV_FlannTest::radiusSearch( Mat& points, Mat& neighbors )
215 for( int i = 0; i < points.rows; i++ )
218 Mat p( 1, points.cols, CV_32FC1, points.ptr<float>(i) ),
223 float* fltPtr = points.ptr<float>(i);
224 vector<float> query( fltPtr, fltPtr + points.cols );
251 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
261 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors ); }
271 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors ); }
281 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
291 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
300 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
