↑ Fig. 1: A solution develops
A timelapse of 600 t-SNE iterations. The solution generally improves with each iteration. Subject to diminishing returns.
↑ Fig. 2: Align to grid
The logos are aligned to a grid. The Linear assignment problem (LAP) algorithm is a greedy algorithm, and the solution is not guaranteed to be optimal.

↑ Fig. 3: Final composite
Here is one of many possible outcomes. The solution is not deterministic, and will vary slightly each time the visualization is loaded.
An interactive experience


Fig 4: The introduction outlines the process, step by step. Buying some time for the calculations to finish in the background.


Fig 5: The visualization is interactive. Users can zoom, pan, and manipulate the solution space.


Fig 6: A live visualizations makes it possible to change the parameters of the underlying algorithms, altering the outcome—highlighting different patterns.