Examples of IRectangularArea

net.algart.math.IRectangularArea

Rectangular integer area, i.e. hyperparallelepiped in multidimensional space with integer coordinates of vertices. All edges of the hyperparallelepiped are parallel to coordinate axes. In 1-dimensional case it is an equivalent of {@link IRange} class,in 2-dimensional case it is an analog of the standard java.awt.Rectangle class.

More precisely, the region, specified by this class, is defined by two n-dimensional points with integer coordinates ( {@link IPoint}), named the minimal vertex min and maximal vertex max, and consists of all such points (x₀, x₁, ..., x_n−1), that:

min. {@link IPoint#coord(int) coord(0)} ≤ x₀ ≤max. {@link IPoint#coord(int) coord(0)},
min. {@link IPoint#coord(int) coord(1)} ≤ x₁ ≤max. {@link IPoint#coord(int) coord(1)},
...,
min. {@link IPoint#coord(int) coord(n-1)} ≤ x_n−1 ≤max. {@link IPoint#coord(int) coord(n-1)}.

The min and max points are specified while creating an instance of this class and can be retrieved by {@link #min()} and {@link #max()} methods.
The coordinates of the minimal vertex min. {@link IPoint#coord(int) coord(i)}are never greater than the corresponding coordinates of the maximal vertex max. {@link IPoint#coord(int) coord(i)}, the coordinates of the minimal and maximal vertices are always in range -Long.MAX_VALUE+1..Long.MAX_VALUE-1, and their difference is always less than Long.MAX_VALUE. In other words, "max. {@link IPoint#coord(int) coord(i)}-min. {@link IPoint#coord(int) coord(i)}+1" expression, returned by {@link #size(int)} method, and also"min. {@link IPoint#coord(int) coord(i)}-1", "min. {@link IPoint#coord(int) coord(i)}-2" and "max. {@link IPoint#coord(int) coord(i)}+1" expressions are always calculated without overflow, and the {@link #range(int)} method is always possible to return an allowed range.
This class is immutable and thread-safe: there are no ways to modify settings of the created instance.

AlgART Laboratory 2007–2014
@author Daniel Alievsky @version 1.2 @since JDK 1.5 @see RectangularArea

Examples of net.algart.math.IRectangularArea

    }


    public Matrix<? extends UpdatablePArray> maskedDilationErosion(Matrix<? extends PArray> src,
        Pattern ptn1, Pattern ptn2)
    {
        IRectangularArea a = SUM_MAX_0.getAperture(src.dimCount(), ptn1, false, ptn2, true);
        return reduce(parent.maskedDilationErosion(extend(src, a), ptn1, ptn2), a);
    }

View Full Code Here

Examples of net.algart.math.IRectangularArea

    }


    public Matrix<? extends UpdatablePArray> maskedErosionDilation(Matrix<? extends PArray> src,
        Pattern ptn1, Pattern ptn2)
    {
        IRectangularArea a = SUM_MAX_0.getAperture(src.dimCount(), ptn1, true, ptn2, false);
        return reduce(parent.maskedErosionDilation(extend(src, a), ptn1, ptn2), a);
    }

View Full Code Here

Examples of net.algart.math.IRectangularArea

    public void dilation(
        Matrix<? extends UpdatablePArray> dest, Matrix<? extends PArray> src, Pattern pattern,
        boolean disableMemoryAllocation)
    {
        Matrices.checkDimensionEquality(dest, src);
        IRectangularArea a = (disableMemoryAllocation ? SUM_MAX_0 : SUM).getAperture(src.dimCount(), pattern, false);
        // SUM_MAX_0: including the origin is necessary while extending the destination matrix
        Matrix<? extends PArray> continued = extend(src, a);
        if (disableMemoryAllocation) { // in this case we should not create extra matrices
            parent.dilation(extend(dest, a, true), continued, pattern, disableMemoryAllocation);
        } else { // in this case destination matrix can be used as a temporary storage: it's better to work quickly

View Full Code Here

Examples of net.algart.math.IRectangularArea

    public void erosion(
        Matrix<? extends UpdatablePArray> dest, Matrix<? extends PArray> src, Pattern pattern,
        boolean disableMemoryAllocation)
    {
        Matrices.checkDimensionEquality(dest, src);
        IRectangularArea a = (disableMemoryAllocation ? SUM_MAX_0 : SUM).getAperture(src.dimCount(), pattern, true);
        // SUM_MAX_0: including the origin is necessary while extending the destination matrix
        Matrix<? extends PArray> continued = extend(src, a);
        if (disableMemoryAllocation) { // in this case we should not create extra matrices
            parent.erosion(extend(dest, a, true), continued, pattern, disableMemoryAllocation);
        } else { // in this case destination matrix can be used as a temporary storage: it's better to work quickly

View Full Code Here

Examples of net.algart.math.IRectangularArea

    public boolean isPseudoCyclic() {
        return tiler.continuationMode() == Matrix.ContinuationMode.PSEUDO_CYCLIC;
    }


    public Matrix<? extends PArray> asDilation(Matrix<? extends PArray> src, Pattern pattern) {
        IRectangularArea a = (parent.isPseudoCyclic() ? SUM : SUM_MAX_0).getAperture(src.dimCount(), pattern, false);
        src = DependenceApertureBuilder.extend(src, a, tiler.continuationMode());
        return DependenceApertureBuilder.reduce(parent.asDilation(src, pattern), a);
    }

View Full Code Here

Examples of net.algart.math.IRectangularArea

        src = DependenceApertureBuilder.extend(src, a, tiler.continuationMode());
        return DependenceApertureBuilder.reduce(parent.asDilation(src, pattern), a);
    }


    public Matrix<? extends PArray> asErosion(Matrix<? extends PArray> src, Pattern pattern) {
        IRectangularArea a = (parent.isPseudoCyclic() ? SUM : SUM_MAX_0).getAperture(src.dimCount(), pattern, true);
        src = DependenceApertureBuilder.extend(src, a, tiler.continuationMode());
        return DependenceApertureBuilder.reduce(parent.asErosion(src, pattern), a);
    }

View Full Code Here

0 1 2

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.