Home
last modified time | relevance | path

Searched refs:myDistanceSq (Results 1 – 2 of 2) sorted by relevance

/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/
H A DApproxPts.C93 vector<double> myDistanceSq; // used only in PreprocessSubdivAlgm member
278 X.myDistanceSq[i] = L2NormSq(X.myCoords, OrigPts[i]); in ComputeDistSq()
283 if (X.myDistanceSq[i] >= WorstDist) in ComputeDistSq()
285 WorstDist = X.myDistanceSq[i]; in ComputeDistSq()
335 const double diffi = (Ni * PPPts[i].myDistanceSq[*it]) / (Ni-1); in redistribute()
341 … const double diffj = -(Nj * PPPts[j].myDistanceSq[*it]) / (Nj+1); // careful here: Nj is unsigned! in redistribute()
375 PPPts[0].myDistanceSq.resize(NumPts); in PreprocessSubdivInit()
390 if (V[i].myDistanceSq[BadIndex] > WorstDist) in ExistsBadPoint()
392 WorstDist = V[i].myDistanceSq[BadIndex]; in ExistsBadPoint()
412 NewPt.myDistanceSq.push_back(0.0); in NewPPP()
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A DApproxPts.C93 vector<double> myDistanceSq; // used only in PreprocessSubdivAlgm member
278 X.myDistanceSq[i] = L2NormSq(X.myCoords, OrigPts[i]); in ComputeDistSq()
283 if (X.myDistanceSq[i] >= WorstDist) in ComputeDistSq()
285 WorstDist = X.myDistanceSq[i]; in ComputeDistSq()
335 const double diffi = (Ni * PPPts[i].myDistanceSq[*it]) / (Ni-1); in redistribute()
341 … const double diffj = -(Nj * PPPts[j].myDistanceSq[*it]) / (Nj+1); // careful here: Nj is unsigned! in redistribute()
375 PPPts[0].myDistanceSq.resize(NumPts); in PreprocessSubdivInit()
390 if (V[i].myDistanceSq[BadIndex] > WorstDist) in ExistsBadPoint()
392 WorstDist = V[i].myDistanceSq[BadIndex]; in ExistsBadPoint()
412 NewPt.myDistanceSq.push_back(0.0); in NewPPP()
[all …]