Thanks to visit codestin.com
Credit goes to github.com

Skip to content
GitHub Universe 2025
Explore 100+ talks, demos, and workshops at Universe 2025. Choose your favorites.
#

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++

Improve this page

Add a description, image, and links to the algorithm-for-counting topic page so that developers can more easily learn about it.

Curate this topic

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