I do not know how to correctly call this task. Just can not imagine what it is attributed. To graphs or to the packaging of rectangles.
Related algorithms for packing rectangles pack them turning only 90 degrees. And here the points can be located anywhere, as well as the angle of the optimal packaging.
- Points connected: the nearest to the nearest. That is, it is not a line. There may be branches.
- The distance between the points can be made uniform. That is always 10 px. It can also be assumed that there can be only 8. (top, right-top, right, right-bottom, bottom, left-bottom, left, left-top) directions (this is for those cases if the algorithm is based on a matrix, a simple 32x32 map , 64x64).
- It is highly desirable to be able to set the intervals at which the rectangle is to be stirred.
If there is an implementation in C / C ++ somewhere, then this is just great.
Neural networks here can not help?