System.out.println(points.size() + " boundary:");
if (points.size() < 1000) {
System.out.println(new TreeSet<Point>(points));
}
System.out.println("Carcass:");
System.out.println(" " + p.carcass() + " " + new TreeSet<Point>(p.carcass().points()));
List<Pattern> unionDecomposition = p.unionDecomposition(minimalPointCountForDecomposition);
System.out.println("Union decomposition to " + unionDecomposition.size() + " patterns:");
for (Pattern q : unionDecomposition) {
System.out.println(" " + q
+ (!q.hasMinkowskiDecomposition() ? " " + new TreeSet<Point>(q.points()) : ""));