I am looking for an algorithm to cut an image without a rectangle (i.e. a transparent image) into blocks of size (for example) of 16x16 pixels. Blocks may overlap, but the goal is to get the fewest blocks.
Example


Summary
- Blocks must be the same size.
- Blocks may be overlapping
- Least Rectangles - Target
Thank you in advance
source
share