I’ve been noodling on this one for a few weeks, thought others might find it interesting, or maybe it’s been explored before.

I recall Gehry used K-clustering for Museo Soumaya to find a happy number of distinct hexagons to tile their shape without too much deviation. Could the same be done in Grasshopper?

Finding a set of face edge lengths which approximate an existing mesh edge lengths seems easy. In the image below and attached graph, each color represents rectangles which are ‘close enough’ in shape to eachother. The problem is adjacent shapes might have mis-matching edge lengths. Finding a set of shapes with matching edge lengths is much harder. And that’s not getting into rotational symmetry of faces where two faces might be the same but with different edge order. It feels a lot like the Wang tile problem.

I’ll spoil this a little by saying I don’t think they matched edge lengths. Instead, I think the gaps between panels allow for mismatching shapes to join. Thoughts?

K-Cluster Panel Shapes.gh (25.3 KB)

Unique families in Museo Soumaya [Source: pg 68]