Dynamic Tree Colors: Adaptive Discriminable Hierarchies with Minimum Instability
3.00T1 sourcearXiv cs.HC
Source record
Published by arXiv cs.HC (T1 source). The original is at https://arxiv.org/abs/2608.26734.
Pipeline notes
The summary and note below are generated by the signal pipeline — they are Beyond Desk’s reading, not quotations from the source.
SummaryA research paper introducing Dynamic Tree Colors, a dynamic hierarchical color map for visualizing large hierarchical data. It balances discriminability and color stability via configurable tradeoffs, with defined quality metrics and an 18-participant user study, though it underperforms the Cuttlefish algorithm in that algorithm's specific scenario.
Why it mattersOffers a configurable color-mapping algorithm and explicit quality metrics for hierarchical visualization, useful for analysts working with large tree-structured datasets.
Cited by
No citations on record.