Examples of allUnionDecompositions()

• net.algart.math.patterns.Pattern.allUnionDecompositions()
  Returns a non-empty list of all best or almost best {@link #unionDecomposition(int) union decompositions}with equal or similar "quality", i.e. with the same or almost same summary number of points in all Minkowski decompositions of all returned patterns.

  This method is a useful addition to {@link #unionDecomposition(int)} method for a case,when there are several union decompositions with similar "quality". In this case an algorithm, using union decompositions, is able to choose the best from several variants according additional algorithm-specific criteria.

  The number of space dimensions in all returned patterns ( {@link #dimCount()} is the same as in this one.

  The result of this method and the elements of the result are immutable (Collections.unmodifiableList). @param minimalPointCount this method usually does not decompose patterns that containless than minimalPointCount points. @return several good variants of decomposition of this pattern to the union of patterns;the result always contains ≥1 elements, and all its elements also contain ≥1 elements. @throws IllegalArgumentException if the argument is negative.

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