Blue Noise Plots

We propose Blue Noise Plots, two‐dimensional dot plots that depict data points of univariate data sets. While often one‐dimensional strip plots are used to depict such data, one of their main problems is visual clutter which results from overlap. To reduce this overlap, jitter plots were introduced, whereby an additional, non‐encoding plot dimension is introduced, along which the data point representing dots are randomly perturbed. Unfortunately, this randomness can suggest non‐existent clusters, and often leads to visually unappealing plots, in which overlap might still occur. To overcome these shortcomings, we introduce Blue Noise Plots where random jitter along the non‐encoding plot dimension is replaced by optimizing all dots to keep a minimum distance in 2D i. e., Blue Noise. We evaluate the effectiveness as well as the aesthetics of Blue Noise Plots through both, a quantitative and a qualitative user study. The Python implementation of Blue Noise Plots is available here.

[1]  A. Watson,et al.  Quest: A Bayesian adaptive psychometric method , 1983, Perception & psychophysics.

[2]  Giuseppe Santucci,et al.  By chance is not enough: preserving relative density through nonuniform sampling , 2004, Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004..

[3]  M. Braga,et al.  Exploratory Data Analysis , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[4]  Christoph Peters,et al.  Void-and-Cluster Sampling of Large Scattered Data and Trajectories , 2019, IEEE Transactions on Visualization and Computer Graphics.

[5]  Steven Franconeri,et al.  Ranking Visualizations of Correlation Using Weber's Law , 2014, IEEE Transactions on Visualization and Computer Graphics.

[6]  Hans-Peter Seidel,et al.  Projective Blue‐Noise Sampling , 2016, Comput. Graph. Forum.

[7]  Li-Yi Wei Multi-class blue noise sampling , 2010, SIGGRAPH 2010.

[8]  Markus Gross,et al.  Analysis and synthesis of point distributions based on pair correlation , 2012, ACM Trans. Graph..

[9]  John M. Chambers,et al.  Graphical Methods for Data Analysis , 1983 .

[10]  Steven Franconeri,et al.  Face to Face: Evaluating Visual Comparison , 2019, IEEE Transactions on Visualization and Computer Graphics.

[11]  Gurprit Singh,et al.  Analysis of Sample Correlations for Monte Carlo Rendering , 2019, Comput. Graph. Forum.

[12]  Chi-Wing Fu,et al.  Fast capacity constrained Voronoi tessellation , 2010, I3D '10.

[13]  Antti Oulasvirta,et al.  Towards Perceptual Optimization of the Visual Design of Scatterplots , 2017, IEEE Transactions on Visualization and Computer Graphics.

[14]  Peter L. Brooks,et al.  Visualizing data , 1997 .

[15]  O. Deussen,et al.  Capacity-constrained point distributions: a variant of Lloyd's method , 2009, ACM Trans. Graph..

[16]  K. Pearson Contributions to the Mathematical Theory of Evolution , 1894 .

[17]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[18]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[19]  Timo Ropinski,et al.  On the perceptual influence of shape overlap on data-comparison using scatterplots  , 2020, Comput. Graph..

[20]  J. Yellott Spectral consequences of photoreceptor sampling in the rhesus retina. , 1983, Science.

[21]  Karol Myszkowski,et al.  Deep point correlation design , 2019, ACM Trans. Graph..

[22]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[23]  Raanan Fattal,et al.  Blue-noise point sampling using kernel density model , 2011, ACM Trans. Graph..

[24]  Adrian Secord,et al.  Weighted Voronoi stippling , 2002, NPAR '02.

[25]  Michael Gleicher,et al.  Splatterplots: Overcoming Overdraw in Scatter Plots , 2013, IEEE Transactions on Visualization and Computer Graphics.

[26]  Hui Huang,et al.  Data Sampling in Multi-view and Multi-class Scatterplots via Set Cover Optimization , 2020, IEEE Transactions on Visualization and Computer Graphics.

[27]  Jeffrey Heer,et al.  Beyond Weber's Law: A Second Look at Ranking Visualizations of Correlation , 2016, IEEE Transactions on Visualization and Computer Graphics.

[28]  Hans-Peter Seidel,et al.  Interactive by-example design of artistic packing layouts , 2013, ACM Trans. Graph..

[29]  Mark A. Z. Dippé,et al.  Antialiasing through stochastic sampling , 1985, SIGGRAPH.

[30]  Daniel A. Keim,et al.  Generalized Scatter Plots , 2010, Inf. Vis..

[31]  Mathieu Desbrun,et al.  Blue noise through optimal transport , 2012, ACM Trans. Graph..

[32]  J. Hintze,et al.  Violin plots : A box plot-density trace synergism , 1998 .

[33]  Li-Yi Wei,et al.  Point sampling with general noise spectrum , 2012, ACM Trans. Graph..

[34]  M. Sheelagh T. Carpendale,et al.  Beyond Mouse and Keyboard: Expanding Design Considerations for Information Visualization Interactions , 2012, IEEE Transactions on Visualization and Computer Graphics.

[35]  Issei Fujishiro,et al.  The elements of graphing data , 2005, The Visual Computer.

[36]  Oliver Deussen,et al.  Beyond Stippling 
— Methods for Distributing Objects on the Plane , 2003, Comput. Graph. Forum.

[37]  Robert Ulichney,et al.  Dithering with blue noise , 1988, Proc. IEEE.

[38]  Shixia Liu,et al.  Evaluation of Sampling Methods for Scatterplots , 2021, IEEE Transactions on Visualization and Computer Graphics.

[39]  Won-Ki Jeong,et al.  DXR: A Toolkit for Building Immersive Data Visualizations , 2019, IEEE Transactions on Visualization and Computer Graphics.

[40]  Raanan Fattal Blue-noise point sampling using kernel density model , 2011, SIGGRAPH 2011.

[41]  Gurprit Singh,et al.  Fourier Analysis of Correlated Monte Carlo Importance Sampling , 2019, Comput. Graph. Forum.

[42]  Nassim Nicholas Taleb,et al.  The Black Swan: The Impact of the Highly Improbable , 2007 .

[43]  Daniel Weiskopf,et al.  Continuous Scatterplots , 2008, IEEE Transactions on Visualization and Computer Graphics.