The key to solving a difficult problem is to break it down into a series of smaller, more tractable, problems.

Here we start with a rectangular polygon. We shrink our polygon by some fixed amount (inset), and then pick a point inside it. We then send off rays in N evenly spaced directions and use these to split the polygon into N new polygons. Repeat the process, varying parameters such as how we pick our point or the angles of our projected rays, and see what emerges.

Press 'v' to download an svg output.

This page has been generated using fx_hash public API, to display an overview of a creator's collection from The computation of "rarity" is not the official computation and therefore can differ. Dev by @zancan.