We have been working continuously on a new die-cutting algorithm. The idea was to allow articles to be split over multiple impositions. From a technical point of view, this is a complex mathematical problem, normally solved with a number of weighty and complicated  techniques. This means, it was time for us to demonstrate our inherent specialty by developing a new and super-fast algorithm. And we succeeded. Currently we are still in the testing phase, but the results we have so far are very promising. The solutions obtained are quasi equal to the theoretical reachable optimum.

We are happy to provide our customers with the best solution for die-cutting available on the market in the very near future. But the new algoritme, we named "DG", is also very suitable for uniform cases  (where all articles have the same size). So also for these cases, it will be a significant amelioration.