Overlap-free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization

07/30/2019
by   Tanja Munz, et al.
0

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.

READ FULL TEXT
research
12/22/2021

Recognising the overlap graphs of subtrees of restricted trees is hard

The overlap graphs of subtrees in a tree (SOGs) generalise many other gr...
research
05/17/2023

A Scalable Method for Readable Tree Layouts

Large tree structures are ubiquitous and real-world relational datasets ...
research
06/14/2019

Multi-level tree based approach for interactive graph visualization with semantic zoom

A recent data visualization literacy study shows that most people cannot...
research
08/20/2022

Dual Space Coupling Model Guided Overlap-Free Scatterplot

The overdraw problem of scatterplots seriously interferes with the visua...
research
02/08/2021

Blue Noise Plots

We propose Blue Noise Plots, two-dimensional dot plots that depict data ...
research
05/14/2021

Generalized LR-drawings of trees

The LR-drawing-method is a method of drawing an ordered rooted binary tr...
research
02/07/2019

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

When analysing binary data, the ease at which one can interpret results ...

Please sign up or login with your details

Forgot password? Click here to reset