Yeah I just got a pretty odd idea, but I think that it could work.
I forgot the name of this random (it has spinning objects and its not Mr. Mordaut), but here it goes:
The script would convert the selected area where the items are spinning into a mask (black and white) and just monitor it.
While the script is monitoring the item, finds the minimum and maximum areas of the spinning object. Then it divides them (since each object must have different minimum and maximum areas).
When the script finds the ratio, it can just compare the ratio to a list of ratios and whatever ratio comes closest, that must be the object!
That was hard to explain, but I think this is much faster than the current solver that just stares at the object for 20 seconds.
Any comments?
![]()



Reply With Quote















(You need to have the dev svn though).
