Skip to content
#

algorithm-for-counting

Here is 1 public repository matching this topic...

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.

  • Updated Sep 30, 2023
  • C++

Add this topic to your repo

To associate your repository with the algorithm-for-counting topic, visit your repo's landing page and select "manage topics."

Learn more