Polygon unique-prime-factorization n=10005

n=10005=3x5x23x29. I used the unique-prime-factorization theorem (e.g. 28=2*2*7) to iteratively fragment polygons in n tiles, coloring them in HSI space. Hue and Intensity are functions of residuals of smaller factors for global view and of largest factor for details. I created a one-to-one correspondence n image one #NFT | Made in @ProcessingOrg /python | @SantoLeonarArt