Generalized Pythagoras trees were developed for visualizing hierarchical data, producing organic, fractal-like representations. However, the drawback of the original layout algorithm is visual overlap of tree branches. To avoid such overlap, we introduce an adapted drawing algorithm using ellipses instead of circles to recursively place tree nodes representing the subhierarchies. Our technique is demonstrated by resolving overlap in diverse real-world and generated datasets, while comparing the results to the original approach.
%0 Conference Paper
%1 8933606
%A Munz, Tanja
%A Burch, Michael
%A van Benthem, Toon
%A Poels, Yoeri
%A Beck, Fabian
%A Weiskopf, Daniel
%B 2019 IEEE Visualization Conference (VIS)
%D 2019
%K myown visus:weiskopf from:tanjamunz visus:munzta peerReviewed pn6 vis(us) EXC2075 visus
%P 251-255
%R 10.1109/VISUAL.2019.8933606
%T Overlap-Free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization
%U https://ieeexplore.ieee.org/document/8933606/
%X Generalized Pythagoras trees were developed for visualizing hierarchical data, producing organic, fractal-like representations. However, the drawback of the original layout algorithm is visual overlap of tree branches. To avoid such overlap, we introduce an adapted drawing algorithm using ellipses instead of circles to recursively place tree nodes representing the subhierarchies. Our technique is demonstrated by resolving overlap in diverse real-world and generated datasets, while comparing the results to the original approach.
@inproceedings{8933606,
abstract = {Generalized Pythagoras trees were developed for visualizing hierarchical data, producing organic, fractal-like representations. However, the drawback of the original layout algorithm is visual overlap of tree branches. To avoid such overlap, we introduce an adapted drawing algorithm using ellipses instead of circles to recursively place tree nodes representing the subhierarchies. Our technique is demonstrated by resolving overlap in diverse real-world and generated datasets, while comparing the results to the original approach.},
added-at = {2020-10-16T18:21:00.000+0200},
author = {Munz, Tanja and Burch, Michael and van Benthem, Toon and Poels, Yoeri and Beck, Fabian and Weiskopf, Daniel},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2bfc8aa5f192ba5932034a88b1cb945df/visus},
booktitle = {2019 IEEE Visualization Conference (VIS)},
doi = {10.1109/VISUAL.2019.8933606},
interhash = {7ef49c65ae0e8ce206a9e40206727c9e},
intrahash = {bfc8aa5f192ba5932034a88b1cb945df},
keywords = {myown visus:weiskopf from:tanjamunz visus:munzta peerReviewed pn6 vis(us) EXC2075 visus},
month = oct,
pages = {251-255},
timestamp = {2020-10-16T16:21:00.000+0200},
title = {Overlap-Free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization},
url = {https://ieeexplore.ieee.org/document/8933606/},
year = 2019
}
