map party design

← All palettes

Glasbey 48

Generated maximally-distinct set (glasbey-style)

On a map

Basemap

A synthetic demo grid, classed with equal intervals — the point is the palette against real basemap ink, not the data. Switch themes to see how much basemap the palette leaves room for.

Metadata

Type
Qualitative
Family
Designed
Character
algorithmicvivid
Color vision
✕ deuteranopia ✕ protanopia ✕ tritanopia
Data shapes
high cardinality categorical
Visual weight
0.90 · loud
Basemap headroom
0.85

Provenance

Chris Glasbey and colleagues described the method in 2007: rather than picking colors by eye, generate a categorical sequence by repeatedly choosing the color furthest from every color already chosen, measured in a perceptually uniform space. The best-known implementation ships in colorcet under CC BY 4.0, which is where the family gets its name. The 48 values here were precomputed offline as a glasbey-style approximation — a golden-angle sweep across saturation and value tiers — and are intended to be regenerated with a proper glasbey or iwanthue run to tighten distinctness.

When to use it

Forty-eight colors is past what any legend can carry, so this is not a palette you choose — it is the fallback when a categorical field has more classes than a designed set can hold and the map still needs each one distinguishable on hover or click. Use it for exploratory views of high-cardinality fields (parcels by owner, segments by route id) and pair it with interactive identification rather than a legend. It is emphatically not colorblind-safe at this size and it is a very loud palette, so it needs the quietest basemap you have.

License

Original work (map-party, MIT) — golden-angle maximally-distinct set, method credit Glasbey et al. 2007 · source

The color specification carries this license, which is separate from the MIT license on this site. See attribution.