582       std::vector<Point2f> vectors, filteredVectors, basis;  in findHoles()  local
587       findBasis(filteredVectors, basis, basisGraphs);  in findHoles()
588       findMCS(basis, basisGraphs);  in findHoles()
594       std::vector<Point2f> vectors, tmpVectors, filteredVectors, basis;  in findHoles()  local
600       findBasis(filteredVectors, basis, basisGraphs);  in findHoles()
601       findMCS(basis, basisGraphs);  in findHoles()
605       findMCS(basis, basisGraphs);  in findHoles()
757 void CirclesGridFinder::findMCS(const std::vector<Point2f> &basis, std::vector<Graph> &basisGraphs)  in findMCS()  argument
782       addHolesByGraph(basisGraphs, true, basis[1]);  in findMCS()
790       addHolesByGraph(basisGraphs, false, basis[0]);  in findMCS()
805       addHolesByGraph(basisGraphs, false, basis[0]);  in findMCS()
811       addHolesByGraph(basisGraphs, true, basis[1]);  in findMCS()
1087 void CirclesGridFinder::findBasis(const std::vector<Point2f> &samples, std::vector<Point2f> &basis,…  in findBasis()  argument
1089   basis.clear();  in findBasis()
1106       basis.push_back(vec);  in findBasis()
1110   if (basis.size() != 2)  in findBasis()
1113   if (basis[1].x > basis[0].x)  in findBasis()
1115     std::swap(basis[0], basis[1]);  in findBasis()
1120   if (norm(basis[0] - basis[1]) < minBasisDif)  in findBasis()
1134       clusters[idx].push_back(basis[idx] + parameters.convexHullFactor * (samples[k] - basis[idx]));  in findBasis()
1137   for (size_t i = 0; i < basis.size(); i++)  in findBasis()
1142   basisGraphs.resize(basis.size(), Graph(keypoints.size()));  in findBasis()
1314 void CirclesGridFinder::drawBasis(const std::vector<Point2f> &basis, Point2f origin, Mat &drawImg) …  in drawBasis()  argument
1316   for (size_t i = 0; i < basis.size(); i++)  in drawBasis()
1318     Point2f pt(basis[i]);  in drawBasis()