Package com.ardor3d.math.type

Examples of com.ardor3d.math.type.ReadOnlyTransform

923
924
925
926
927
928
929
930
931
932
933
934
935
936
            return true;
        }
        if (!(o instanceof ReadOnlyTransform)) {
            return false;
        }
        final ReadOnlyTransform comp = (ReadOnlyTransform) o;
        return _matrix.equals(comp.getMatrix())
                && Math.abs(_translation.getX() - comp.getTranslation().getX()) < Transform.ALLOWED_DEVIANCE
                && Math.abs(_translation.getY() - comp.getTranslation().getY()) < Transform.ALLOWED_DEVIANCE
                && Math.abs(_translation.getZ() - comp.getTranslation().getZ()) < Transform.ALLOWED_DEVIANCE
                && Math.abs(_scale.getX() - comp.getScale().getX()) < Transform.ALLOWED_DEVIANCE
                && Math.abs(_scale.getY() - comp.getScale().getY()) < Transform.ALLOWED_DEVIANCE
                && Math.abs(_scale.getZ() - comp.getScale().getZ()) < Transform.ALLOWED_DEVIANCE;
    }
View Full Code Here
946
947
948
949
950
951
952
953
954
            return true;
        }
        if (!(o instanceof ReadOnlyTransform)) {
            return false;
        }
        final ReadOnlyTransform comp = (ReadOnlyTransform) o;
        return _matrix.strictEquals(comp.getMatrix()) && _scale.equals(comp.getScale())
                && _translation.equals(comp.getTranslation());
    }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
        _rotations = new ReadOnlyQuaternion[transforms.length];
        _translations = new ReadOnlyVector3[transforms.length];
        _scales = new ReadOnlyVector3[transforms.length];

        for (int i = 0; i < transforms.length; i++) {
            final ReadOnlyTransform transform = transforms[i];
            if (!transform.isRotationMatrix()) {
                TransformChannel.logger.warning("TransformChannel '" + channelName
                        + "' supplied transform with non-rotational matrices.  May have unexpected results.");
            }
            _rotations[i] = new Quaternion().fromRotationMatrix(transform.getMatrix()).normalizeLocal();
            _translations[i] = new Vector3(transform.getTranslation());
            _scales[i] = new Vector3(transform.getScale());
        }
    }
View Full Code Here
116
117
118
119
120
121
122
123
124
        if (thisCT == null || checkCT == null) {
            return false;
        }

        final ReadOnlyTransform worldTransform = testMesh.getWorldTransform();
        thisCT.getBounds().transform(worldTransform, thisCT.getWorldBounds());
        return thisCT.intersect(checkCT);
    }
View Full Code Here
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
            }
            return false;
        }

        // both are leaves
        final ReadOnlyTransform transformA = getMesh().getWorldTransform();
        final ReadOnlyTransform transformB = collisionTree.getMesh().getWorldTransform();

        final MeshData dataA = getMesh().getMeshData();
        final MeshData dataB = collisionTree.getMesh().getMeshData();

        Vector3[] storeA = null;
        Vector3[] storeB = null;

        // for every primitive to compare, put them into world space and check for intersections
        for (int i = _start; i < _end; i++) {
            storeA = dataA.getPrimitiveVertices(_primitiveIndices[i], _section, storeA);
            // to world space
            for (int t = 0; t < storeA.length; t++) {
                transformA.applyForward(storeA[t]);
            }
            for (int j = collisionTree._start; j < collisionTree._end; j++) {
                storeB = dataB.getPrimitiveVertices(collisionTree._primitiveIndices[j], collisionTree._section, storeB);
                // to world space
                for (int t = 0; t < storeB.length; t++) {
                    transformB.applyForward(storeB[t]);
                }
                if (Intersection.intersection(storeA, storeB)) {
                    return true;
                }
            }
View Full Code Here
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
        }

        // both this node and the testing node are leaves. Therefore, we can
        // switch to checking the contained primitives with each other. Any
        // that are found to intersect are placed in the appropriate list.
        final ReadOnlyTransform transformA = getMesh().getWorldTransform();
        final ReadOnlyTransform transformB = collisionTree.getMesh().getWorldTransform();

        final MeshData dataA = getMesh().getMeshData();
        final MeshData dataB = collisionTree.getMesh().getMeshData();

        Vector3[] storeA = null;
        Vector3[] storeB = null;

        boolean test = false;

        for (int i = _start; i < _end; i++) {
            storeA = dataA.getPrimitiveVertices(_primitiveIndices[i], _section, storeA);
            // to world space
            for (int t = 0; t < storeA.length; t++) {
                transformA.applyForward(storeA[t]);
            }
            for (int j = collisionTree._start; j < collisionTree._end; j++) {
                storeB = dataB.getPrimitiveVertices(collisionTree._primitiveIndices[j], collisionTree._section, storeB);
                // to world space
                for (int t = 0; t < storeB.length; t++) {
                    transformB.applyForward(storeB[t]);
                }
                if (Intersection.intersection(storeA, storeB)) {
                    test = true;
                    aList.add(new PrimitiveKey(_primitiveIndices[i], _section));
                    bList.add(new PrimitiveKey(collisionTree._primitiveIndices[j], collisionTree._section));
View Full Code Here
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
        } else if (_left == null) {
            // This is a leaf node. We can therefore check each primitive this node contains. If an intersection occurs,
            // place it in the list.

            final MeshData data = getMesh().getMeshData();
            final ReadOnlyTransform transform = getMesh().getWorldTransform();

            Vector3[] points = null;
            for (int i = _start; i < _end; i++) {
                points = data.getPrimitiveVertices(_primitiveIndices[i], _section, points);
                for (int t = 0; t < points.length; t++) {
                    transform.applyForward(points[t]);
                }
                if (ray.intersects(points, null)) {
                    result.add(new PrimitiveKey(_primitiveIndices[i], _section));
                }
            }
View Full Code Here
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
        final int width = getLocalComponentWidth();
        return getRelativeComponentBounds(rVal, width, height);
    }

    private Rectangle2 getRelativeComponentBounds(final Rectangle2 store, final int width, final int height) {
        final ReadOnlyTransform local = getTransform();
        if (local.isIdentity() || local.getMatrix().isIdentity()) {
            store.set(0, 0, width, height);
        } else {
            float minX, maxX, minY, maxY;
            final Vector3 t = Vector3.fetchTempInstance();

            t.set(width, height, 0);
            local.applyForwardVector(t);
            minX = Math.min(t.getXf(), 0);
            maxX = Math.max(t.getXf(), 0);
            minY = Math.min(t.getYf(), 0);
            maxY = Math.max(t.getYf(), 0);

            t.set(0, height, 0);
            local.applyForwardVector(t);
            minX = Math.min(t.getXf(), minX);
            maxX = Math.max(t.getXf(), maxX);
            minY = Math.min(t.getYf(), minY);
            maxY = Math.max(t.getYf(), maxY);

            t.set(width, 0, 0);
            local.applyForwardVector(t);
            minX = Math.min(t.getXf(), minX);
            maxX = Math.max(t.getXf(), maxX);
            minY = Math.min(t.getYf(), minY);
            maxY = Math.max(t.getYf(), maxY);
View Full Code Here
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
     *
     * @param width
     * @param height
     */
    public void fitComponentIn(final int width, final int height) {
        final ReadOnlyTransform local = getTransform();
        if (local.isIdentity() || local.getMatrix().isIdentity()) {
            setLocalComponentSize(width, height);
            return;
        }

        final Vector3 temp = Vector3.fetchTempInstance();
        temp.set(1, 0, 0);
        local.applyForwardVector(temp);
        if (Math.abs(temp.getX()) >= 0.99999) {
            setLocalComponentSize(width, height);
        } else if (Math.abs(temp.getY()) >= 0.99999) {
            setLocalComponentSize(height, width);
        } else {
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
        SubTexUtil._vals[5] = height;
        SubTexUtil._vals[6] = 0;
        SubTexUtil._vals[7] = height;

        // Set our transform
        final ReadOnlyTransform worldT = appliedTransform != null ? appliedTransform : Transform.IDENTITY;
        final Vector3 v = Vector3.fetchTempInstance();
        v.set(x, y, 0);
        SubTexUtil._helperT.set(worldT);
        SubTexUtil._helperT.applyForwardVector(v);
        SubTexUtil._helperT.translate(v);
View Full Code Here
TOP

Related Classes of com.ardor3d.math.type.ReadOnlyTransform

  • com.ardor3d.bounding.CollisionTree
  • com.ardor3d.example.pipeline.AnimationBlinnPhongExample
  • com.ardor3d.example.pipeline.ColladaManualAnimationExample
  • com.ardor3d.extension.animation.skeletal.clip.TransformChannel
  • com.ardor3d.extension.ui.UIComponent
  • com.ardor3d.extension.ui.util.SubTexUtil
  • com.ardor3d.intersection.PickingUtil
  • com.ardor3d.math.Transform
    • Copyright © 2018 www.massapicom. 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.