Lines Matching refs:angles2
360 const std::vector<std::pair<int, double>> &angles2, in findBestSolution() argument
383 rationAngles[j] = fabs(angles1[j].second - angles2[j].second) / in findBestSolution()
384 (angles1[j].second + angles2[j].second); in findBestSolution()
406 nextQuad2 = angles2[j].first; in findBestSolution()
487 findBestSolution(stroke1, stroke2, partialAngles1 + i, 1, angles2, 1, in findBestSolution()
495 angles2, r - 1, partialSolution, bestValue, bestVector); in findBestSolution()
499 angles2, r, partialSolution, bestValue, bestVector); in findBestSolution()
506 const std::vector<std::pair<int, double>> &angles2, in findBestSolution() argument
508 assert(angles1.size() > angles2.size()); in findBestSolution()
512 findBestSolution(stroke1, stroke2, &(angles1[0]), angles1.size(), angles2, in findBestSolution()
513 angles2.size(), partialSolution, bestValue, bestVector); in findBestSolution()
520 const std::vector<std::pair<int, double>> &angles2, in trivialSolution() argument
522 assert(angles1.size() > angles2.size()); in trivialSolution()
535 if (solution.size() != angles2.size()) { in trivialSolution()
537 solution.resize(angles2.size()); in trivialSolution()
540 int toBeErased = angles1.size() - angles2.size(); in trivialSolution()
546 stroke2->getLengthAtControlPoint(angles2[count].first * 2) * invTotalLen2; in trivialSolution()
566 if (angles2.size() < count) in trivialSolution()
568 stroke2->getLengthAtControlPoint(angles2[count].first * 2) * in trivialSolution()
751 std::vector<std::pair<int, double>> angles1, angles2; in computeTransformation() local
759 angles2.clear(); in computeTransformation()
771 detectCorners(stroke2, startMinAngle, angles2, minAngle, maxAngle); in computeTransformation()
775 if (angles1.empty()) angles2.clear(); in computeTransformation()
776 if (angles2.empty()) angles1.clear(); in computeTransformation()
786 if (angles1.size() != angles2.size()) { in computeTransformation()
791 if (isTooComplex(angles1.size(), angles2.size(), maxSubSetNum)) { in computeTransformation()
794 (int)((angles1.size() < angles2.size()) ? minAngle2 in computeTransformation()
797 (int)((angles1.size() < angles2.size()) ? maxAngle1 in computeTransformation()
801 if ((int)(angles1.size() + angles2.size()) < in computeTransformation()
806 sortedAngles2.reserve(angles2.size()); in computeTransformation()
812 for (j = 0; j < angles2.size(); j++) { in computeTransformation()
813 tempAngle = angles2[j].second; in computeTransformation()
828 int numAng2 = angleNumber(angles2, sortedAngles[j]); in computeTransformation()
846 int numAng2 = angleNumber(angles2, angle); in computeTransformation()
862 eraseSmallAngles(angles2, bestAngle); in computeTransformation()
874 if (angles1.size() == angles2.size()) { in computeTransformation()
882 for (j = 0; j < angles2.size(); j++) in computeTransformation()
883 transform.m_secondStrokeCornerIndexes.push_back(angles2[j].first); in computeTransformation()
887 if (isTooComplex(angles1.size(), angles2.size(), maxSubSetNum)) { in computeTransformation()
888 if (angles1.size() > angles2.size()) { in computeTransformation()
889 transform.m_firstStrokeCornerIndexes.resize(angles2.size()); in computeTransformation()
890 trivialSolution(stroke1, stroke2, angles1, angles2, in computeTransformation()
898 for (j = 0; j < angles2.size(); j++) in computeTransformation()
900 angles2[j].first); in computeTransformation()
912 trivialSolution(stroke2, stroke1, angles2, angles1, in computeTransformation()
920 if (angles1.size() > angles2.size()) { in computeTransformation()
921 transform.m_firstStrokeCornerIndexes.resize(angles2.size()); in computeTransformation()
922 findBestSolution(stroke1, stroke2, angles1, angles2, bestValue, in computeTransformation()
930 for (j = 0; j < angles2.size(); j++) in computeTransformation()
932 angles2[j].first); in computeTransformation()
944 findBestSolution(stroke2, stroke1, angles2, angles1, bestValue, in computeTransformation()
961 for (j = 0; j < angles2.size(); j++) in computeTransformation()
962 transform.m_secondStrokeCornerIndexes.push_back(angles2[j].first); in computeTransformation()