# Overlap-free Drawing of Generalized Pythagoras Trees for Hierarchy   Visualization

**Authors:** Tanja Munz, Michael Burch, Toon van Benthem, Yoeri Poels, Fabian Beck, and Daniel Weiskopf

arXiv: 1907.12845 · 2019-07-31

## TL;DR

This paper presents an improved algorithm for drawing generalized Pythagoras trees that eliminates branch overlaps using ellipses, enhancing hierarchical data visualization clarity.

## Contribution

The authors introduce an adapted drawing algorithm employing ellipses to prevent overlaps in generalized Pythagoras trees for better hierarchy visualization.

## Key findings

- Successfully removes overlaps in various datasets
- Outperforms original circle-based layout in clarity
- Demonstrates applicability to real-world data

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1907.12845/full.md

## Figures

15 figures with captions in the complete paper: https://tomesphere.com/paper/1907.12845/full.md

## References

20 references — full list in the complete paper: https://tomesphere.com/paper/1907.12845/full.md

---
Source: https://tomesphere.com/paper/1907.12845