EjderAysun/algorithm-for-counting-all-possible-sections-that-have-a-min-pixel-size-of-axb-and-bxa-in-artworks

A simple algorithm to find the number of all possible sections in artworks(or anything 2D and rectangular that can be represented by pixel dimensions) that maintain their styles and don't compromise their essences as long as they have a minimum size of axb or bxa pixels.

Language: C++ - Size: 22.5 KB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0