Abstract
This document describes a simple agglomerative layout algorithm. The algorithm produces the coordinates for a set of packed hexagons given a similarity matrix. It combines the hexagons representing the items in a bottom up, or agglomerative manner.
| Original language | English |
|---|---|
| Pages | 1-3 |
| Number of pages | 3 |
| Publication status | Unpublished - 2018 |