Lines Matching full:hull2f
160 std::vector<Point2f> hull2f;
161 convexHull(Mat(patternPoints), hull2f, false);
163 if(hull2f.size() < cornersCount)
167 findCorners(hull2f, corners);
179 getSortedCorners(hull2f, corners, outsideCorners, sortedCorners);
191 void CirclesGridClusterFinder::findCorners(const std::vector<cv::Point2f> &hull2f, std::vector<cv::Point2f> &corners)
195 for(size_t i=0; i<hull2f.size(); i++)
197 Point2f vec1 = hull2f[(i+1) % hull2f.size()] - hull2f[i % hull2f.size()];
198 Point2f vec2 = hull2f[(i-1 + static_cast<int>(hull2f.size())) % hull2f.size()] - hull2f[i % hull2f.size()];
216 corners.push_back(hull2f[cornersIndices.at<int>(i, 0)]);
296 void CirclesGridClusterFinder::getSortedCorners(const std::vector<cv::Point2f> &hull2f, const std::vector<cv::Point2f> &corners, const std::vector<cv::Point2f> &outsideCorners, std::vector<cv::Point2f> &sortedCorners)
321 std::vector<Point2f>::const_iterator firstCornerIterator = std::find(hull2f.begin(), hull2f.end(), firstCorner);
323 for(std::vector<Point2f>::const_iterator it = firstCornerIterator; it != hull2f.end(); it++)
331 for(std::vector<Point2f>::const_iterator it = hull2f.begin(); it != firstCornerIterator; it++)
