List of lowerSurface() Examples

Returns the lower boundary of this pattern along the given axis: a pattern consisting of all such points A of this pattern, that the neighbour point B, generated by the backward shift of point A along the coordinate #j=coordIndex by the corresponding grid step d_j= {@link #stepOfGrid(int) stepOfGrid(coordIndex)}, does not belong to this pattern. The number of dimensions in the resulting pattern ( {@link #dimCount() dimCount()}) is the same as in this one.

In other words, the point A = (x₀, x₁, ..., x_j, ..., x_n−1) belongs to the returned pattern if and only if it belongs to this pattern and the point B = (x₀, x₁, ..., x_j−d_j, ..., x_n−1) (corresponding to decreasing the grid index i_j by 1) does not belong to this pattern.

Please compare with {@link #minBound(int)} method. This method can return a patterncontaining more points than {@link #minBound(int)}, in particular, if this pattern contains some "holes".

The returned pattern always implements {@link DirectPointSetPattern}if this pattern implements {@link DirectPointSetPattern}

The returned pattern always implements {@link RectangularPattern}if this pattern implements {@link RectangularPattern}.

Note: 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.However, this situation is possible only in custom implementation of this interface — all implementations, provided by this package, implement either {@link DirectPointSetPattern}or {@link RectangularPattern} interface.

There is a guarantee, that if this object implements {@link DirectPointSetPattern} interface,then this method requires not greater than O(N) 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. @param coordIndex the index of the coordinate (0 for x, 1 for y, 2 for z, etc.) @return the "lower boundary" of this pattern: new pattern consisting of all points of this pattern,which have no leftward neighbour along the given coordinate. @throws IndexOutOfBoundsException if coordIndex<0 orcoordIndex>= {@link #dimCount() dimCount()}. @throws TooManyPointsInPatternError (impossible for implementations, provided by this package)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).

Examples of lowerSurface()

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

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