TY - GEN

T1 - Semantic word cloud representations

T2 - 11th Latin American Theoretical Informatics Symposium, LATIN 2014

AU - Barth, Lukas

AU - Fabrikant, Sara Irina

AU - Kobourov, Stephen G.

AU - Lubiw, Anna

AU - Nöllenburg, Martin

AU - Okamoto, Yoshio

AU - Pupyrev, Sergey

AU - Squarcella, Claudio

AU - Ueckerdt, Torsten

AU - Wolff, Alexander

PY - 2014

Y1 - 2014

N2 - We study a geometric representation problem, where we are given a set of axis-aligned rectangles (boxes) with fixed dimensions and a graph with vertex set. The task is to place the rectangles without overlap such that two rectangles touch if the graph contains an edge between them. We call this problem Contact Representation of Word Networks (Crown). It formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Here, we represent words by rectangles and semantic relationships by edges. We show that Crown is strongly NP-hard even if restricted to trees and weakly NP-hard if restricted to stars. We also consider the optimization problem Max-Crown where each adjacency induces a certain profit and the task is to maximize the sum of the profits. For this problem, we present constant-factor approximations for several graph classes, namely stars, trees, planar graphs, and graphs of bounded degree. Finally, we evaluate the algorithms experimentally and show that our best method improves upon the best existing heuristic by 45%.

AB - We study a geometric representation problem, where we are given a set of axis-aligned rectangles (boxes) with fixed dimensions and a graph with vertex set. The task is to place the rectangles without overlap such that two rectangles touch if the graph contains an edge between them. We call this problem Contact Representation of Word Networks (Crown). It formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Here, we represent words by rectangles and semantic relationships by edges. We show that Crown is strongly NP-hard even if restricted to trees and weakly NP-hard if restricted to stars. We also consider the optimization problem Max-Crown where each adjacency induces a certain profit and the task is to maximize the sum of the profits. For this problem, we present constant-factor approximations for several graph classes, namely stars, trees, planar graphs, and graphs of bounded degree. Finally, we evaluate the algorithms experimentally and show that our best method improves upon the best existing heuristic by 45%.

UR - http://www.scopus.com/inward/record.url?scp=84899939512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899939512&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-54423-1_45

DO - 10.1007/978-3-642-54423-1_45

M3 - Conference contribution

AN - SCOPUS:84899939512

SN - 9783642544224

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 514

EP - 525

BT - LATIN 2014

PB - Springer-Verlag

Y2 - 31 March 2014 through 4 April 2014

ER -