PUMA publications for /author/Owen%20Kaserhttps://puma.uni-kassel.de/author/Owen%20KaserPUMA RSS feed for /author/Owen%20Kaser2024-03-29T07:54:54+01:00Tag-Cloud Drawing: Algorithms for Cloud Visualizationhttps://puma.uni-kassel.de/bibtex/256270d1311c066a3852bea23eeb8d484/jaeschkejaeschke2009-04-16T11:22:34+02:00visualization tag folksonomy cloud drawing <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Owen Kaser" itemprop="url" href="/author/Owen%20Kaser"><span itemprop="name">O. Kaser</span></a></span>, and <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Daniel Lemire" itemprop="url" href="/author/Daniel%20Lemire"><span itemprop="name">D. Lemire</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>CoRR</em></span></span> </span>(<em><span>2007<meta content="2007" itemprop="datePublished"/></span></em>)<em>informal publication.</em>Thu Apr 16 11:22:34 CEST 2009CoRRinformal publicationTag-Cloud Drawing: Algorithms for Cloud Visualizationabs/cs/07031092007visualization tag folksonomy cloud drawing Tag clouds provide an aggregate of tag-usage statistics. They are typically sent as in-line HTML to browsers. However, display mechanisms suited for ordinary text are not ideal for tags, because font sizes may vary widely on a line. As well, the typical layout does not account for relationships that may be known between tags. This paper presents models and algorithms to improve the display of tag clouds that con- sist of in-line HTML, as well as algorithms that use nested tables to achieve a more general 2-dimensional layout in which tag relationships are considered. The first algorithms leverage prior work in typesetting and rectangle packing, whereas the second group of algorithms leverage prior work in Electronic Design Automation. Experiments show our algorithms can be efficiently implemented and perform well.