Home
last modified time | relevance | path

Searched refs:minDistSq (Results 1 – 3 of 3) sorted by relevance

/external/eigen/unsupported/doc/examples/
DBVH_Example.cpp35 double minDistSq = std::numeric_limits<double>::max(); in main() local
40 minDistSq = std::min(minDistSq, minimizer.minimumOnObjectObject(redPoints[i], bluePoints[j])); in main()
41 …std::cout << "Brute force distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << st… in main()
46 minDistSq = BVMinimize(redTree, blueTree, minimizer); //actual BVH minimization call in main()
47 …std::cout << "BVH distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << st… in main()
/external/skqp/src/utils/
DSkShadowTessellator.cpp253 SkScalar minDistSq = SkPointPriv::DistanceToLineSegmentBetweenSqd(fCentroid, in computeConvexShadow() local
267 if (distSq < minDistSq) { in computeConvexShadow()
268 minDistSq = distSq; in computeConvexShadow()
275 if (minDistSq < (inset + kTolerance)*(inset + kTolerance)) { in computeConvexShadow()
277 auto newInset = SkScalarSqrt(minDistSq) - kTolerance; in computeConvexShadow()
/external/skia/src/utils/
DSkShadowTessellator.cpp253 SkScalar minDistSq = SkPointPriv::DistanceToLineSegmentBetweenSqd(fCentroid, in computeConvexShadow() local
267 if (distSq < minDistSq) { in computeConvexShadow()
268 minDistSq = distSq; in computeConvexShadow()
275 if (minDistSq < (inset + kTolerance)*(inset + kTolerance)) { in computeConvexShadow()
277 auto newInset = SkScalarSqrt(minDistSq) - kTolerance; in computeConvexShadow()