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

Authors:
H. Strobelt;M. Spicker;A. Stoffel;D. Keim;O. Deussen
Affiliations:
University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz
Venue:
Computer Graphics Forum
Year:
2012

Citing 13
Cited 1

Graph drawing by force-directed placement

Software—Practice & Experience
Removing Node Overlapping in Graph Layout Using Constrained Optimization

Constraints
A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Cluster busting in anchored graph drawing

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
A new algorithm for removing node overlapping in graph visualization

Information Sciences: an International Journal
Seeing things in the clouds: the effect of visual features on tag cloud selections

Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Efficient Node Overlap Removal Using a Proximity Stress Model

Graph Drawing
Drawing graphs with non-uniform vertices

Proceedings of the Working Conference on Advanced Visual Interfaces
Participatory Visualization with Wordle

IEEE Transactions on Visualization and Computer Graphics
ManiWordle: Providing Flexible Control over Wordle

IEEE Transactions on Visualization and Computer Graphics
WordBridge: Using Composite Tag Clouds in Node-Link Diagrams for Visualizing Content and Relations in Text Corpora

HICSS '11 Proceedings of the 2011 44th Hawaii International Conference on System Sciences
Fast node overlap removal

GD'05 Proceedings of the 13th international conference on Graph Drawing
HiTSEE: A visualization tool for hit selection and analysis in high-throughput screening experiments

BIOVIS '11 Proceedings of the 2011 IEEE Symposium on Biological Data Visualization

Interactive by-example design of artistic packing layouts

ACM Transactions on Graphics (TOG)

Quantified Score

Hi-index	0.00

Visualization

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. © 2012 Wiley Periodicals, Inc.