Automatic Improvement of Continuous Colormaps in Euclidean Colorspaces

10Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Colormapping is one of the simplest and most widely used data visualization methods within and outside the visualization community. Uniformity, order, discriminative power, and smoothness of continuous colormaps are the most important criteria for evaluating and potentially improving colormaps. We present a local and a global automatic optimization algorithm in Euclidean color spaces for each of these design rules in this work. As a foundation for our optimization algorithms, we used the CCC-Tool colormap specification (CMS); each algorithm has been implemented in this tool. In addition to synthetic examples that demonstrate each method's effect, we show the outcome of some of the methods applied to a typhoon simulation.

Cite

CITATION STYLE

APA

Nardini, P., Chen, M., Böttinger, M., Scheuermann, G., & Bujack, R. (2021). Automatic Improvement of Continuous Colormaps in Euclidean Colorspaces. Computer Graphics Forum, 40(3), 361–373. https://doi.org/10.1111/cgf.14313

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free