KOPS - The Institutional Repository of the University of Konstanz

Balanced-partitioning treemapping method for digital hierarchical dataset

Balanced-partitioning treemapping method for digital hierarchical dataset

Cite This

Files in this item

Checksum: MD5:3bf076b81fe25ff59cecc21726fb50f6

FENG, Cong, Minglun GONG, Oliver DEUSSEN, 2022. Balanced-partitioning treemapping method for digital hierarchical dataset. In: Virtual Reality & Intelligent Hardware. Elsevier. 4(4), pp. 342-358. ISSN 2096-5796. eISSN 2666-1209. Available under: doi: 10.1016/j.vrih.2021.09.006

@article{Feng2022-08Balan-58600, title={Balanced-partitioning treemapping method for digital hierarchical dataset}, year={2022}, doi={10.1016/j.vrih.2021.09.006}, number={4}, volume={4}, issn={2096-5796}, journal={Virtual Reality & Intelligent Hardware}, pages={342--358}, author={Feng, Cong and Gong, Minglun and Deussen, Oliver} }

Gong, Minglun Gong, Minglun Background<br />The problem of visualizing a hierarchical dataset is an important and useful technique in many real-life situations. Folder systems, stock markets, and other hierarchical-related datasets can use this technique to better understand the structure and dynamic variation of the dataset. Traditional space-filling(square)-based methods have the advantages of compact space usage and node size as opposed to diagram-based methods. Spacefilling- based methods have two main research directions: static and dynamic performance.<br /><br />Methods<br />This study presented a treemapping method based on balanced partitioning that enables excellent aspect ratios in one variant, good temporal coherence for dynamic data in another, and in the third, a satisfactory compromise between these two aspects. To layout a treemap, all the children of a node were divided into two groups, which were then further divided until groups of single elements were reached. After this, these groups were combined to form a rectangle representing the parent node. This process was performed for each layer of the hierarchical dataset. For the first variant from the partitioning, the child elements were sorted and two groups, sized as equally as possible, were built from both big and small elements (size-balanced partition). This achieved satisfactory aspect ratios for the rectangles but less so temporal coherence (dynamic). For the second variant, the sequence of children was taken and from this, groups, sized as equally as possible, were created without the need for sorting (sequence-based, good compromise between aspect ratio and temporal coherency). For the third variant, the children were split into two groups of equal cardinalities, regardless of their size (number-balanced, worse aspect ratios but good temporal coherence).<br /><br />Results<br />This study evaluated the aspect ratios and dynamic stability of the employed methods and proposed a new metric that measures the visual difference between rectangles during their movement to represent temporally changing inputs.<br /><br />Conclusion<br />This study demonstrated that the proposed method of treemapping via balanced partitioning outperformed the state-of-the-art methods for several real-world datasets. 2022-09-13T07:37:21Z Attribution-NonCommercial-NoDerivatives 4.0 International Deussen, Oliver 2022-08 2022-09-13T07:37:21Z eng Deussen, Oliver Feng, Cong Balanced-partitioning treemapping method for digital hierarchical dataset Feng, Cong

Downloads since Sep 13, 2022 (Information about access statistics)

Feng_2-9d62bb4ap8dz4.pdf 32

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivatives 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International

Search KOPS


Browse

My Account