Package net.algart.math.patterns

Examples of net.algart.math.patterns.UniformGridPattern.pointCount()


        double step = Double.parseDouble(args[++argIndex]);
        int minimalPointCountForDecomposition = Integer.parseInt(args[++argIndex]);
        UniformGridPattern p = Patterns.newRectangularIntegerPattern(ranges)
            .multiply(step).shift(Point.valueOf(origin));
        System.out.println("Created pattern: " + p);
        System.out.println("Integer number of points: " + p.pointCount());
        System.out.println("Approximate number of points: " + p.largePointCount());
        if (p instanceof QuickPointCountPattern && ((QuickPointCountPattern) p).isPointCountVeryLarge()) {
            System.out.println("It is very large");
        }
        if (p.isActuallyRectangular()) {
View Full Code Here


            System.out.println("It is origin of coordinates");
        }
        if (p.isSurelyInteger()) {
            System.out.println("It is integer");
        }
        if (p.pointCount() < 1000) {
            Pattern samePoints = Patterns.newPattern(p.points());
            System.out.println("Pattern with same points: " + samePoints);
            if (samePoints instanceof UniformGridPattern && ((UniformGridPattern)samePoints).isActuallyRectangular()) {
                System.out.println("It is also rectangular");
            }
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.