Examples of net.algart.math.RectangularArea

net.algart.math.RectangularArea

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

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

min. {@link Point#coord(int) coord(0)} ≤ x₀ ≤max. {@link Point#coord(int) coord(0)},
min. {@link Point#coord(int) coord(1)} ≤ x₁ ≤max. {@link Point#coord(int) coord(1)},
...,
min. {@link Point#coord(int) coord(n-1)} ≤ x_n−1 ≤max. {@link Point#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 Point#coord(int) coord(i)}are never greater than the corresponding coordinates of the maximal vertex max. {@link Point#coord(int) coord(i)}, and all coordinates of both vertices are never Double.NaN.
All calculations in this class are performed in strictfp mode, so the result is absolutely identical on all platforms.

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 IRectangularArea

        private ShiftWeighedStitchingFunc(List<? extends Frame<P>> frames) {
            this.areas = new RectangularArea[frames.size()];
            int n = 0;
            Point shiftMinus05 = null;
            for (Frame<P> frame : frames) {
                RectangularArea area = ShiftFramePosition.area(
                    frame.position().area().min(), frame.matrix().dimensions());
                // important: we should not use frame.position().area() here, because it can be too large
                if (shiftMinus05 == null) {
                    double[] shift = new double[area.coordCount()];
                    JArrays.fillDoubleArray(shift, -0.5);
                    shiftMinus05 = Point.valueOf(shift);
                }
                this.areas[n] = area.shift(shiftMinus05);
                n++;
            }
        }

View Full Code Here

        if (shiftPositions) {
            // optimization: instead of shifting results by area.min(), we just subtract area.min() from all positions
            List<Frame<P>> shiftedFrames = new ArrayList<Frame<P>>();
            for (Frame<P> frame : actualFrames) {
                Matrix<? extends PArray> m = frame.matrix();
                RectangularArea shiftedArea = frame.position().area().shift(area.min().symmetric());
                P position = castPosition(ShiftFramePosition.valueOf(shiftedArea));
                // here we are sure that P is ShiftFramePosition, in other case shiftPosition(...) cannot return true
                shiftedFrames.add(DefaultFrame.valueOf(m, position));
            }
            actualFrames = shiftedFrames;

View Full Code Here

                assert subPos[k] < dim[k];
                subDim[k] = Math.min(tileDim[k], dim[k] - subPos[k]);
                subMin[k] = offset.coord(k) + subPos[k];
                subMax[k] = subMin[k] + subDim[k];
            }
            final RectangularArea subArea = RectangularArea.valueOf(Point.valueOf(subMin), Point.valueOf(subMax));
            final Matrix<? extends UpdatablePArray> subResult = result.subMatr(subPos, subDim);
            final List<Frame<P>> localFrames = actualFrames(subArea);
            Stitcher<P> localStitcher = frames(localFrames);
            // reduce the number of frames in stitcher as early as possible
            final double requiredMemory = sizeOfFrames(localFrames);

View Full Code Here

            this.inverseTransforms = new CoordinateTransformationOperator[frames.size()];
            int n = 0;
            Point shiftMinus05 = null;
            for (Frame<P> frame : frames) {
                UniversalFramePosition p = frame.position();
                RectangularArea area = ShiftFramePosition.area(
                    Point.origin(frame.dimCount()), frame.matrix().dimensions());
                if (shiftMinus05 == null) {
                    double[] shift = new double[area.coordCount()];
                    JArrays.fillDoubleArray(shift, -0.5);
                    shiftMinus05 = Point.valueOf(shift);
                }
                this.areasInMatrices[n] = area.shift(shiftMinus05);
                this.inverseTransforms[n] = p.inverseTransform();
                n++;
            }
        }

View Full Code Here

TOP

Related Classes of net.algart.math.RectangularArea

net.algart.matrices.stitching.ShiftStitchingMethod$ShiftWeighedStitchingFunc

net.algart.matrices.stitching.Stitcher

net.algart.matrices.stitching.UniversalStitchingMethod$UniversalWeighedStitchingFunc

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.