Package javax.vecmath

Examples of javax.vecmath.Vector3f.sub()

42
43
44
45
46
47
48
49
50
51
52
    Vector3f clampValue = Stack.alloc(Vector3f.class);
    clampValue.set(quantizationMargin, quantizationMargin, quantizationMargin);
    outMinBound.sub(srcMinBound, clampValue);
    outMaxBound.add(srcMaxBound, clampValue);
    Vector3f aabbSize = Stack.alloc(Vector3f.class);
    aabbSize.sub(outMaxBound, outMinBound);
    bvhQuantization.set(65535.0f, 65535.0f, 65535.0f);
    VectorUtil.div(bvhQuantization, bvhQuantization, aabbSize);
  }

  public static void bt_quantize_clamp(short[] out, Vector3f point, Vector3f min_bound, Vector3f max_bound, Vector3f bvhQuantization) {
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
    Vector3f clampedPoint = Stack.alloc(point);
    VectorUtil.setMax(clampedPoint, min_bound);
    VectorUtil.setMin(clampedPoint, max_bound);

    Vector3f v = Stack.alloc(Vector3f.class);
    v.sub(clampedPoint, min_bound);
    VectorUtil.mul(v, v, bvhQuantization);

    out[0] = (short) (v.x + 0.5f);
    out[1] = (short) (v.y + 0.5f);
    out[2] = (short) (v.z + 0.5f);
View Full Code Here
376
377
378
379
380
381
382
383
384
385
386
            }
            case 3: {
              tmp1.negate(simplex[3].w);
              tmp2.sub(simplex[2].w, simplex[3].w);
              tmp3.sub(simplex[1].w, simplex[3].w);
              tmp4.sub(simplex[0].w, simplex[3].w);
              found = SolveSimplex4(tmp1, tmp2, tmp3, tmp4);
              break;
            }
          }
          if (found) {
View Full Code Here
405
406
407
408
409
410
411
412
413
414
415
        case 0:
          break;
        // Line
        case 1: {
          Vector3f ab = Stack.alloc(Vector3f.class);
          ab.sub(simplex[1].w, simplex[0].w);

          Vector3f[] b = new Vector3f[] { Stack.alloc(Vector3f.class), Stack.alloc(Vector3f.class), Stack.alloc(Vector3f.class) };
          b[0].set(1f, 0f, 0f);
          b[1].set(0f, 1f, 0f);
          b[2].set(0f, 0f, 1f);
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
//#endif //KEEP_DEEPEST_POINT

    float res0 = 0f, res1 = 0f, res2 = 0f, res3 = 0f;
    if (maxPenetrationIndex != 0) {
      Vector3f a0 = Stack.alloc(pt.localPointA);
      a0.sub(pointCache[1].localPointA);

      Vector3f b0 = Stack.alloc(pointCache[3].localPointA);
      b0.sub(pointCache[2].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
    if (maxPenetrationIndex != 0) {
      Vector3f a0 = Stack.alloc(pt.localPointA);
      a0.sub(pointCache[1].localPointA);

      Vector3f b0 = Stack.alloc(pointCache[3].localPointA);
      b0.sub(pointCache[2].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
      cross.cross(a0, b0);

      res0 = cross.lengthSquared();
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
      res0 = cross.lengthSquared();
    }

    if (maxPenetrationIndex != 1) {
      Vector3f a1 = Stack.alloc(pt.localPointA);
      a1.sub(pointCache[0].localPointA);

      Vector3f b1 = Stack.alloc(pointCache[3].localPointA);
      b1.sub(pointCache[2].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    if (maxPenetrationIndex != 1) {
      Vector3f a1 = Stack.alloc(pt.localPointA);
      a1.sub(pointCache[0].localPointA);

      Vector3f b1 = Stack.alloc(pointCache[3].localPointA);
      b1.sub(pointCache[2].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
      cross.cross(a1, b1);
      res1 = cross.lengthSquared();
    }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
      res1 = cross.lengthSquared();
    }

    if (maxPenetrationIndex != 2) {
      Vector3f a2 = Stack.alloc(pt.localPointA);
      a2.sub(pointCache[0].localPointA);

      Vector3f b2 = Stack.alloc(pointCache[3].localPointA);
      b2.sub(pointCache[1].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
    if (maxPenetrationIndex != 2) {
      Vector3f a2 = Stack.alloc(pt.localPointA);
      a2.sub(pointCache[0].localPointA);

      Vector3f b2 = Stack.alloc(pointCache[3].localPointA);
      b2.sub(pointCache[1].localPointA);

      Vector3f cross = Stack.alloc(Vector3f.class);
      cross.cross(a2, b2);

      res2 = cross.lengthSquared();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.