HomeSort by relevance Sort by last modified time
    Searched defs:pointB (Results 1 - 11 of 11) sorted by null

  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/
DistanceOutput.java 37 public final Vec2 pointB = new Vec2();
WorldManifold.java 74 final Vec2 pointB = pool4;
80 // Transform.mulToOutUnsafe(xfB, manifold.points[0].localPoint, pointB);
84 pointB.x = (xfB.q.c * mp0p.x - xfB.q.s * mp0p.y) + xfB.p.x;
85 pointB.y = (xfB.q.s * mp0p.x + xfB.q.c * mp0p.y) + xfB.p.y;
87 if (MathUtils.distanceSquared(pointA, pointB) > Settings.EPSILON * Settings.EPSILON) {
88 normal.x = pointB.x - pointA.x;
89 normal.y = pointB.y - pointA.y;
96 final float cBx = -normal.x * radiusB + pointB.x;
97 final float cBy = -normal.y * radiusB + pointB.y;
TimeOfImpact.java 161 // distanceOutput.pointB.x, distanceOutput.pointB.y,
322 private final Vec2 pointB = new Vec2();
356 * pointB = Mul(transformB, localPointB); m_axis = pointB - pointA; m_axis.Normalize();
361 Transform.mulToOutUnsafe(xfb, localPointB, pointB);
362 m_axis.set(pointB).subLocal(pointA);
379 Transform.mulToOutUnsafe(xfb, m_localPoint, pointB);
384 temp.set(pointA).subLocal(pointB);
408 Transform.mulToOutUnsafe(xfb, localPointB, pointB);
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
GaussianParametersGuesser.java 161 WeightedObservedPoint pointB = twoPoints[1];
165 if (pointB.getY() == y) {
166 return pointB.getX();
169 (((y - pointA.getY()) * (pointB.getX() - pointA.getX())) / (pointB.getY() - pointA.getY()));
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2Collision.cpp 37 b2Vec2 pointB = b2Mul(xfB, manifold->points[0].localPoint);
38 if (b2DistanceSquared(pointA, pointB) > b2_epsilon * b2_epsilon)
40 normal = pointB - pointA;
45 b2Vec2 cB = pointB - radiusB * normal;
b2Distance.h 81 b2Vec2 pointB; ///< closest point on shapeB
b2TimeOfImpact.cpp 68 b2Vec2 pointB = b2Mul(xfB, localPointB);
69 m_axis = pointB - pointA;
85 b2Vec2 pointB = b2Mul(xfB, m_localPoint);
90 float32 s = b2Dot(pointA - pointB, normal);
113 b2Vec2 pointB = b2Mul(xfB, localPointB);
115 float32 s = b2Dot(pointB - pointA, normal);
146 b2Vec2 pointB = b2Mul(xfB, localPointB);
148 float32 separation = b2Dot(pointB - pointA, m_axis);
163 b2Vec2 pointB = b2Mul(xfB, localPointB);
165 float32 separation = b2Dot(pointB - pointA, normal)
    [all...]
  /external/pdfium/xfa/src/fxbarcode/datamatrix/
BC_DataMatrixDetector.cpp 55 CBC_ResultPoint* pointB = (CBC_ResultPoint*)(*cornerPoints)[1];
61 transitions.Add(TransitionsBetween(pointA, pointB));
63 transitions.Add(TransitionsBetween(pointB, pointD));
100 delete pointB;
119 } else if (!pointCount.Lookup(pointB, value)) {
120 topRight = pointB;
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/Contacts/
b2ContactSolver.cpp 630 b2Vec2 pointB = b2Mul(xfB, pc->localPoints[0]);
631 normal = pointB - pointA;
633 point = 0.5f * (pointA + pointB);
634 separation = b2Dot(pointB - pointA, normal) - pc->radiusA - pc->radiusB;
  /external/opencv/cvaux/src/
cvepilines.cpp 403 double pointB[3];
411 (CvPoint3D64d*)pointB);
413 if( pointB[2] < 0 )/* If negative use other lines for cross */
418 (CvPoint3D64d*)pointB);
431 *((CvPoint3D64d*)pointB),
436 *((CvPoint3D64d*)pointB),
444 *((CvPoint3D64d*)pointB),
449 *((CvPoint3D64d*)pointB),
470 xB = pointB[0];
471 yB = pointB[1]
    [all...]
  /external/zxing/core/
core.jar 

Completed in 528 milliseconds