Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tiling heuristics and evaluation metrics for treemaps with a target node aspect ratio
KTH, School of Computer Science and Communication (CSC).
2017 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Tegelläggningsheuristiker och evalueringsmått för treemaps med ett målsatt bredd-höjd-förhållande för noder (Swedish)
Abstract [en]

Treemaps are a popular space-filling visualization of hierarchical data that maps an attribute of a datum, or a data aggregate, to a proportional amount of area. Assuming a rectangular treemap consisting of nested rectangles (also called tiles), there are multiple possible valid tiling arrangements.

A common criterion for optimization is aspect ratio. Nevertheless, treemaps usually consist of multiple rectangles, so the aspect ratios need be aggregated.

The basic definition of aspect ratio (width divided by height) cannot be meaningfully aggregated. Given this, a definition of aspect ratio that does not differentiate height from width was suggested. This definition allows for meaningful aggregation, but only as long as there are no large differences in the data distribution, and the target aspect ratio is 1:1.

Originally, a target aspect ratio of 1:1 was deemed to be axiomatically ideal. Currently, perceptual studies have found an aspect ratio of 1:1 to lead to the largest area estimation error.

However, with any other target this definition of aspect ratio cannot be meaningfully aggregated.

This thesis suggests a correction that can be applied to the current metric and would allow it to be meaningfully aggregated even when there are large value differences in the data. Furthermore, both the uncorrected and corrected metrics can be generalized for any target (i.e. targets other than 1:1).

Another issue with current evaluation techniques is that algorithm fitness is evaluated through Monte Carlo trials. In this method, synthetic data is generated and then aggregated to generate a single final result. However, tiling algorithm performance is dependant on data distribution, so a single aggregateresult cannot generalize overall performance. The alternative suggested in this thesis is visual cluster analysis, which should hold more general predictive power.All of the above is put into practice with an experiment. In the experiment, a new family of tiling algorithms, based on criteria derived from the results of the perceptual tests in literature,is compared to the most popular tiling algorithm, Squarify.

The results confirm that there are indeed vast but consistent value fluctuations for different normal distributions. At least for a target aspect ratio of 1.5, the new proposed algorithms are shown to perform better than Squarify for most use cases in terms of aspect ratio.

Place, publisher, year, edition, pages
2017. , p. 62
Keywords [en]
Treemap, heuristics, tiling, tessellation, metrics, aspect ratio, orientation agnostic, OAAR, FOAAR, orientation, offset factor, offset quotient, information visualization, infoviz, macro-economic metaphor, eat the poor, eat the rich, subsidy, welfare
National Category
Computer Sciences Computer and Information Sciences Human Computer Interaction
Identifiers
URN: urn:nbn:se:kth:diva-211512OAI: oai:DiVA.org:kth-211512DiVA, id: diva2:1129639
Subject / course
Computer Technology and Graphic Programming
Educational program
Master of Science in Engineering - Computer Science and Technology
Presentation
2017-06-21, VIC, Lindstedtsvägen 5, 114 28 Stockholm, 11:00 (English)
Supervisors
Examiners
Available from: 2017-09-21 Created: 2017-08-04 Last updated: 2025-02-18Bibliographically approved

Open Access in DiVA

fulltext(3527 kB)745 downloads
File information
File name FULLTEXT01.pdfFile size 3527 kBChecksum SHA-512
825b6254ad5b7b5fe9de6f600d43cccdc0092ef628f5db1e0f626631a7717cbb941cd66fab097ade4f70558a70b39d6bf63a2cd47858439a8a28f9e3ace9e6bb
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Roa Rodríguez, Rodrigo
By organisation
School of Computer Science and Communication (CSC)
Computer SciencesComputer and Information SciencesHuman Computer Interaction

Search outside of DiVA

GoogleGoogle Scholar
Total: 746 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 425 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf