dc.contributor.author | Strobelt, Hendrik | en_US |
dc.contributor.author | Spicker, Marc | en_US |
dc.contributor.author | Stoffel, Andreas | en_US |
dc.contributor.author | Keim, Daniel | en_US |
dc.contributor.author | Deussen, Oliver | en_US |
dc.contributor.editor | S. Bruckner, S. Miksch, and H. Pfister | en_US |
dc.date.accessioned | 2015-02-28T07:02:25Z | |
dc.date.available | 2015-02-28T07:02:25Z | |
dc.date.issued | 2012 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.2012.03106.x | en_US |
dc.description.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. | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
dc.title | Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |