EuroVis 2012 conference - Computer Graphics Forum, Volume 31 Issue 3pt3, June 2012, Pages 1135-1144

Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives

Hendrik Strobelt    Marc Spicker    Andreas Stoffel    Daniel A. Keim    Oliver Deussen
University of Konstanz, Germany

Abstract

When representing 2D data points with spacious objects such as labels, overlap can occur. We present a simple algorithm which modifies the (Mani-) Wordle idea with scan-line based techniques to allow a better placement. We give an introduction to common placement techniques from different fields and compare our method to these techniques w.r.t. euclidean displacement, changes in orthogonal ordering as well as shape and size preservation. Especially in dense scenarios our method preserves the overall shape better than known techniques and allows a good trade-off between the other measures. Applications on real world data are given and discussed.

Downloads

Paper PDF (draft) (1.1 MB) DOI link

Java Code RWordle.java

BibTex

@article {CGF:CGF3106,
author = {Strobelt, H. and Spicker, M. and Stoffel, A. and Keim, D. and Deussen, O.},
title = {Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives},
journal = {Computer Graphics Forum},
volume = {31},
number = {3pt3},
publisher = {Blackwell Publishing Ltd},
issn = {1467-8659},
url = {http://dx.doi.org/10.1111/j.1467-8659.2012.03106.x},
doi = {10.1111/j.1467-8659.2012.03106.x},
pages = {1135--1144},
keywords = {I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation},
year = {2012},
}