K means clustering the color space is certainly an interesting idea, though you might need n+1 colors as I’d guess the background color of the hoop is often pre

K means clustering the color space is certainly an interesting idea, though you might need n+1 colors as I’d guess the background color of the hoop is often prevalent. Also: it seems like your query function is actually building the tree on each call? If so, that would slow it down a lot (though the lru cache is still a great idea!)