Metraipolis › archive › dc_bf4d885571aa
Dynamic Tree Colors: Adaptive Discriminable Hierarchies with Minimum Instability — arXiv:2608.26734
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26734
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T16:05:00.077Z
- SHA-256 of the archived text
528f5a07334dc6ab096a58ea4f68e60eb2cc82c22747d696d401aaeac057ae92- Stable URL of this page
https://metraipolis.com/documento/dc_bf4d885571aa
How to cite
Dynamic Tree Colors: Adaptive Discriminable Hierarchies with Minimum Instability — arXiv:2608.26734 — arXiv (en), https://arxiv.org/abs/2608.26734 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf4d885571aa (Metraipolis archive dc_bf4d885571aa, sha256 528f5a07334dc6ab096a58ea4f68e60eb2cc82c22747d696d401aaeac057ae92)
BibTeX
@misc{dcbf4d885571aa,
title = {Dynamic Tree Colors: Adaptive Discriminable Hierarchies with Minimum Instability — arXiv:2608.26734},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26734},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf4d885571aa; sha256 528f5a07334dc6ab096a58ea4f68e60eb2cc82c22747d696d401aaeac057ae92},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26734. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hierarchical color maps can support users in the analysis of hierarchical data. For large hierarchies, dynamic color maps can improve discriminability upon user interactions, but the incremental color changes may cause users to lose their orientation in the data set. To address this challenge, we present Dynamic Tree Colors, a dynamic hierarchical color map that can be configured to a suitable tradeoff between discriminability and color stability. We also define quality metrics for both criteria and investigate our algorithm's performance with respect to these metrics as well as a user study with 18 participants. Our results indicate that Dynamic Tree Colors yields good results in a wide range of application scenarios, but it does not achieve the performance of the state-of-the-art algorithm Cuttlefish in the specific scenario that algorithm was designed for. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-28 in cs.HC). Categorie arXiv: Human-Computer Interaction (cs.HC) ; Graphics (cs.GR). Pagina del lavoro: https://arxiv.org/abs/2608.26734 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T15:31:59.882Z dalla pagina https://arxiv.org/catchup/cs.HC/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).