60 void drawPoints(const std::vector<Point2f> &points, Mat &outImage, int radius = 2,  Scalar color = …  in drawPoints()
69 …der::hierarchicalClustering(const std::vector<Point2f> &points, const Size &patternSz, std::vector…  in hierarchicalClustering()
138 …ClusterFinder::findGrid(const std::vector<cv::Point2f> &points, cv::Size _patternSize, std::vector…  in findGrid()
147   std::vector<Point2f> patternPoints;  in findGrid()
160   std::vector<Point2f> hull2f;  in findGrid()
166   std::vector<Point2f> corners;  in findGrid()
171   std::vector<Point2f> outsideCorners, sortedCorners;  in findGrid()
183   std::vector<Point2f> rectifiedPatternPoints;  in findGrid()
191 …lesGridClusterFinder::findCorners(const std::vector<cv::Point2f> &hull2f, std::vector<cv::Point2f>…  in findCorners()
197     Point2f vec1 = hull2f[(i+1) % hull2f.size()] - hull2f[i % hull2f.size()];  in findCorners()
198 …Point2f vec2 = hull2f[(i-1 + static_cast<int>(hull2f.size())) % hull2f.size()] - hull2f[i % hull2f…  in findCorners()
220 …lusterFinder::findOutsideCorners(const std::vector<cv::Point2f> &corners, std::vector<cv::Point2f>…  in findOutsideCorners()
233   std::vector<Point2f> tangentVectors(corners.size());  in findOutsideCorners()
236     Point2f diff = corners[(k + 1) % corners.size()] - corners[k];  in findOutsideCorners()
296 …vector<cv::Point2f> &hull2f, const std::vector<cv::Point2f> &corners, const std::vector<cv::Point2…  in getSortedCorners()
298   Point2f firstCorner;  in getSortedCorners()
301     Point2f center = std::accumulate(corners.begin(), corners.end(), Point2f(0.0f, 0.0f));  in getSortedCorners()
304     std::vector<Point2f> centerToCorners;  in getSortedCorners()
321 …std::vector<Point2f>::const_iterator firstCornerIterator = std::find(hull2f.begin(), hull2f.end(),…  in getSortedCorners()
323   for(std::vector<Point2f>::const_iterator it = firstCornerIterator; it != hull2f.end(); it++)  in getSortedCorners()
325     std::vector<Point2f>::const_iterator itCorners = std::find(corners.begin(), corners.end(), *it);  in getSortedCorners()
331   for(std::vector<Point2f>::const_iterator it = hull2f.begin(); it != firstCornerIterator; it++)  in getSortedCorners()
333     std::vector<Point2f>::const_iterator itCorners = std::find(corners.begin(), corners.end(), *it);  in getSortedCorners()
356 …Points(const std::vector<cv::Point2f> &patternPoints, const std::vector<cv::Point2f> &sortedCorner…  in rectifyPatternPoints()
370   std::vector<Point2f> idealPoints;  in rectifyPatternPoints()
377       idealPoints.push_back(Point2f((2*j + i % 2)*squareSize, i*squareSize));  in rectifyPatternPoints()
381       idealPoints.push_back(Point2f(j*squareSize, i*squareSize));  in rectifyPatternPoints()
392 …s(const std::vector<cv::Point2f> &patternPoints, const std::vector<cv::Point2f> &rectifiedPatternP…  in parsePatternPoints()
402       Point2f idealPt;  in parsePatternPoints()
404         idealPt = Point2f((2*j + i % 2)*squareSize, i*squareSize);  in parsePatternPoints()
406         idealPt = Point2f(j*squareSize, i*squareSize);  in parsePatternPoints()
536 CirclesGridFinder::Segment::Segment(cv::Point2f _s, cv::Point2f _e) :  in Segment()
564 CirclesGridFinder::CirclesGridFinder(Size _patternSize, const std::vector<Point2f> &testKeypoints,  in CirclesGridFinder()
582       std::vector<Point2f> vectors, filteredVectors, basis;  in findHoles()
594       std::vector<Point2f> vectors, tmpVectors, filteredVectors, basis;  in findHoles()
616 void CirclesGridFinder::rng2gridGraph(Graph &rng, std::vector<cv::Point2f> &vectors) const  in rng2gridGraph()
628           Point2f vec1 = keypoints[i] - keypoints[*it1];  in rng2gridGraph()
629           Point2f vec2 = keypoints[*it1] - keypoints[*it2];  in rng2gridGraph()
757 void CirclesGridFinder::findMCS(const std::vector<Point2f> &basis, std::vector<Graph> &basisGraphs)  in findMCS()
816 Mat CirclesGridFinder::rectifyGrid(Size detectedGridSize, const std::vector<Point2f>& centers,  in rectifyGrid()
817 …                      const std::vector<Point2f> &keypoints, std::vector<Point2f> &warpedKeypoints)  in rectifyGrid()
821   const Point2f offset(150, 150);  in rectifyGrid()
823   std::vector<Point2f> dstPoints;  in rectifyGrid()
834       dstPoints.push_back(offset + Point2f(edgeLength * j, edgeLength * i));  in rectifyGrid()
844   std::vector<Point2f> srcKeypoints;  in rectifyGrid()
852   std::vector<Point2f> dstKeypoints;  in rectifyGrid()
858     Point2f pt = dstKeypoints[i];  in rectifyGrid()
865 size_t CirclesGridFinder::findNearestKeypoint(Point2f pt) const  in findNearestKeypoint()
881 void CirclesGridFinder::addPoint(Point2f pt, std::vector<size_t> &points)  in addPoint()
886     Point2f kpt = Point2f(pt);  in addPoint()
896 …er::findCandidateLine(std::vector<size_t> &line, size_t seedLineIdx, bool addRow, Point2f basisVec,  in findCandidateLine()
906       Point2f pt = keypoints[holes[seedLineIdx][i]] + basisVec;  in findCandidateLine()
915       Point2f pt = keypoints[holes[i][seedLineIdx]] + basisVec;  in findCandidateLine()
924 …ndidateHoles(std::vector<size_t> &above, std::vector<size_t> &below, bool addRow, Point2f basisVec,  in findCandidateHoles()
1052 void CirclesGridFinder::addHolesByGraph(const std::vector<Graph> &basisGraphs, bool addRow, Point2f…  in addHolesByGraph()
1062 …lesGridFinder::filterOutliersByDensity(const std::vector<Point2f> &samples, std::vector<Point2f> &…  in filterOutliersByDensity()
1071     Rect_<float> rect(samples[i] - Point2f(parameters.densityNeighborhoodSize) * 0.5,  in filterOutliersByDensity()
1087 void CirclesGridFinder::findBasis(const std::vector<Point2f> &samples, std::vector<Point2f> &basis,…  in findBasis()
1105       Point2f vec(centers.at<float> (i, 0), centers.at<float> (i, 1));  in findBasis()
1123   std::vector<std::vector<Point2f> > clusters(2), hulls(2);  in findBasis()
1150       Point2f vec = keypoints[i] - keypoints[j];  in findBasis()
1165 void CirclesGridFinder::computeRNG(Graph &rng, std::vector<cv::Point2f> &vectors, Mat *drawImage) c…  in computeRNG()
1178       Point2f vec = keypoints[i] - keypoints[j];  in computeRNG()
1314 void CirclesGridFinder::drawBasis(const std::vector<Point2f> &basis, Point2f origin, Mat &drawImg) …  in drawBasis()
1318     Point2f pt(basis[i]);  in drawBasis()
1399 void CirclesGridFinder::getHoles(std::vector<Point2f> &outHoles) const  in getHoles()
1419 void CirclesGridFinder::getAsymmetricHoles(std::vector<cv::Point2f> &outHoles) const  in getAsymmetricHoles()
1452 double CirclesGridFinder::getDirection(Point2f p1, Point2f p2, Point2f p3)  in getDirection()
1454   Point2f a = p3 - p1;  in getDirection()
1455   Point2f b = p2 - p1;  in getDirection()