Home
last modified time | relevance | path

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

/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/
H A DApproxPts.C280 double WorstDist = 0; in ComputeDistSq() local
283 if (X.myDistanceSq[i] >= WorstDist) in ComputeDistSq()
285 WorstDist = X.myDistanceSq[i]; in ComputeDistSq()
385 double WorstDist = 0; in ExistsBadPoint() local
390 if (V[i].myDistanceSq[BadIndex] > WorstDist) in ExistsBadPoint()
392 WorstDist = V[i].myDistanceSq[BadIndex]; in ExistsBadPoint()
398 return WorstDist >= CriticalRadiusSq; in ExistsBadPoint()
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A DApproxPts.C280 double WorstDist = 0; in ComputeDistSq() local
283 if (X.myDistanceSq[i] >= WorstDist) in ComputeDistSq()
285 WorstDist = X.myDistanceSq[i]; in ComputeDistSq()
385 double WorstDist = 0; in ExistsBadPoint() local
390 if (V[i].myDistanceSq[BadIndex] > WorstDist) in ExistsBadPoint()
392 WorstDist = V[i].myDistanceSq[BadIndex]; in ExistsBadPoint()
398 return WorstDist >= CriticalRadiusSq; in ExistsBadPoint()