Solving the problem of cutting a given polygon into any number of areas of given squares with a lines of minimal length. Based on Algorithm by Sumit Khetarpal. It works for both convex and concave polygons without self-intersected edges.
Qt >= 5.3.2.
Licensed under the MIT license.
I would be very grateful for finding bugs and expressing constructive criticism.