Examples of net.algart.math.patterns.Pattern.round()

net.algart.math.patterns.Pattern.round()
Returns this pattern, every point of which is rounded to the nearest integer point. The result is always ordinary integer pattern (see the {@link Pattern comments to this interface}, section "Uniform-grid patterns").
More precisely, the resulting pattern:
1. consists of all points, obtained from all points of this pattern by rounding by the call point. {@link Point#toRoundedPoint() toRoundedPoint()}. {@link IPoint#toPoint() toPoint()};
2. has zero origin {@link UniformGridPattern#originOfGrid()}=(0,0,...,0) and unit steps {@link UniformGridPattern#stepsOfGrid()}={1,1,..,1}.
Note: the number of points in the result can be less than {@link #pointCount()}, because some real points can be rounded to the same integer points.

Warning! If this object is not {@link DirectPointSetPattern}and is not {@link RectangularPattern}, this method can work slowly for some large patterns: the required time can be O(N), where N is the number of points. In these cases, this method can also throw {@link TooManyPointsInPatternError}or OutOfMemoryError. The situation is like in {@link #points()} and {@link #roundedPoints()} method.
There is a guarantee, that if this object implements {@link DirectPointSetPattern} interface,then this method requires not greater than O(N) operations and memory (N= {@link #pointCount() pointCount()}) and never throws {@link TooManyPointsInPatternError}.
There is a guarantee, that if this object implements {@link RectangularPattern} interface,then this method works quickly (O(1) operations) and without exceptions. It is an important difference from {@link #points()} and {@link #roundedPoints()} method.
The theorem I, described in the {@link Pattern comments to this interface}, section "Coordinate restrictions", provides a guarantee that this method never throws {@link TooLargePatternCoordinatesException}. @return the integer pattern, geometrically nearest to this one. @throws TooManyPointsInPatternError if this pattern is not {@link DirectPointSetPattern} andnot {@link RectangularPattern} and if, at the same time, the numberof points is greater than Integer.MAX_VALUE or, in some rare situations, is near this limit (OutOfMemoryError can be also thrown instead of this exception).

            System.out.println("Minimal coordinates: " + p.coordMin());
            System.out.println("Maximal coordinates: " + p.coordMax());
            for (int k = 0; k < p.dimCount(); k++) {
                System.out.println("Range of coordinate #" + k + ": " + p.coordRange(k));
            }
            points = p.round().lowerSurface(iterationIndex % dimCount).points();
            System.out.println(points.size() + " left points along axis #" + iterationIndex % dimCount + ":");
            if (points.size() < 1000)
                System.out.println(new TreeSet<Point>(points));
            points = p.round().upperSurface(iterationIndex % dimCount).points();
            System.out.println(points.size() + " right points along axis #" + iterationIndex % dimCount + ":");

View Full Code Here

            }
            points = p.round().lowerSurface(iterationIndex % dimCount).points();
            System.out.println(points.size() + " left points along axis #" + iterationIndex % dimCount + ":");
            if (points.size() < 1000)
                System.out.println(new TreeSet<Point>(points));
            points = p.round().upperSurface(iterationIndex % dimCount).points();
            System.out.println(points.size() + " right points along axis #" + iterationIndex % dimCount + ":");
            if (points.size() < 1000)
                System.out.println(new TreeSet<Point>(points));
            points = p.round().surface().points();
            System.out.println(points.size() + " boundary:");

View Full Code Here

                System.out.println(new TreeSet<Point>(points));
            points = p.round().upperSurface(iterationIndex % dimCount).points();
            System.out.println(points.size() + " right points along axis #" + iterationIndex % dimCount + ":");
            if (points.size() < 1000)
                System.out.println(new TreeSet<Point>(points));
            points = p.round().surface().points();
            System.out.println(points.size() + " boundary:");
            if (points.size() < 1000)
                System.out.println(new TreeSet<Point>(points));
            t1 = System.nanoTime();
            List<Pattern> minkowskiDecomposition = p.minkowskiDecomposition(minimalPointCountForDecomposition);

View Full Code Here

TOP

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.