# Generalized Pythagoras Trees: A Fractal Approach to Hierarchy Visualization

@inproceedings{Beck2014GeneralizedPT, title={Generalized Pythagoras Trees: A Fractal Approach to Hierarchy Visualization}, author={Fabian Beck and Michael Burch and Tanja Munz and Lorenzo Di Silvestro and Daniel Weiskopf}, booktitle={VISIGRAPP}, year={2014} }

Through their recursive definition, many fractals have an inherent hierarchical structure. An example are binary branching Pythagoras Trees. By stopping the recursion in certain branches, a binary hierarchy can be encoded and visualized. But this binary encoding is an obstacle for representing general hierarchical data such as file systems or phylogenetic trees, which usually branch into more than two subhierarchies. We hence extend Pythagoras Trees to arbitrarily branching trees by adaptingâ€¦Â Expand

#### Figures, Tables, and Topics from this paper

#### 9 Citations

Overlap-Free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization

- Computer Science
- 2019 IEEE Visualization Conference (VIS)
- 2019

This work introduces an adapted drawing algorithm using ellipses instead of circles to recursively place tree nodes representing the subhierarchies to avoid visual overlap of tree branches in generalized Pythagoras trees. Expand

Combining Interactive Hierarchy Visualizations in a Web-based Application

- Computer Science
- VISIGRAPP
- 2019

A web-based tool combining several hierarchy visualization techniques that provide node-link diagrams, Pythagoras trees, circular, as well as 3D treemaps to give several visual perspectives on the same data and to improve data exploration tasks. Expand

Challenges and Perspectives of Interacting with Hierarchy Visualizations on Large-Scale Displays

- Computer Science
- VINCI
- 2018

This paper describes the generalized Pythagoras trees displayed on largescale high-resolution displays and illustrates the challenges and perspectives when the authors have to interact with the visual representation by using the technique individually, but also in collaboration. Expand

Multiple linked perspectives on hierarchical data

- Computer Science
- VINCI
- 2020

This paper describes an interactive web-based tool for visualizing hierarchical data including the recently developed concept of space-reclaiming icicle plots and several more traditional hierarchy visualizations that applies to the NCBI taxonomy that consists of more than 300,000 hierarchically organized species. Expand

VizWick: a multiperspective view of hierarchical data

- Computer Science
- VINCI
- 2020

This paper presents VizWick, a web-based interactive tool for visualizing hierarchical data which provides the option to view the same dataset from multiple coordinated perspectives, thus providing the possibility to gain more analytical insight than if the dataset was visualized in a single view. Expand

Pythagoras Tree Applied For Determined Instagram Usage Habit Decision

- Mathematics
- 2020

In previous studies, Pythagoras Tree constructed using the Regression Method, namely ID3 of Standard Deviation Reduction (SDR). The study using SDR for Classification, which uses the Coefficient ofâ€¦ Expand

An analysis of boosted ensembles of binary fuzzy decision trees

- Computer Science
- Expert Syst. Appl.
- 2020

Compared to a crisp SAMME-AdaBoost implementation, FDT-Boost shows similar performances, but the relative produced models are significantly less complex, thus opening up further exploitation chances also in memory-constrained systems. Expand

Multi-class boosting with fuzzy decision trees

- Mathematics, Computer Science
- 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
- 2017

FDT-Boost is proposed, a boosting approach shaped according to the multi-class SAMME-AdaBoost scheme, that employs size-constrained fuzzy binary decision trees as weak classifiers that is accurate, yet keeping low the model complexity in terms of total number of leaf nodes. Expand

Methods of cognitive-graphical representation of information for effective monitoring of complex technical systems

- Computer Science
- Program Systems: Theory and Applications
- 2018

This document is intended to help clarify the role of Twitter in the operation of this website and its role in the social network. Expand

#### References

SHOWING 1-10 OF 37 REFERENCES

Botanical visualization of huge hierarchies

- Computer Science
- IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.
- 2001

The strand model of Holton is used to convert an abstract tree into a geometric model and the elements, directories and files, as well as their relations can easily be extracted, thereby showing that the use of methods from botanical modeling can be effective for information visualization. Expand

Research report. Interacting with huge hierarchies: beyond cone trees

- Computer Science
- Proceedings of Visualization 1995 Conference
- 1995

The paper describes a system called fsviz which visualizes arbitrarily large hierarchies while retaining user control by augmenting cone trees with several graphical and interaction techniques, and improves upon earlier cone tree visualization systems through a more elaborate node layout algorithm. Expand

Indented Pixel Tree Plots

- Computer Science
- ISVC
- 2010

Indented Pixel Tree Plots are introduced: a novel pixel-based visualization technique for depicting large hierarchies inspired by the visual metaphor of indented outlines, omnipresent in graphical file browsers and pretty printing of source code and as effective as node-link diagrams for accuracy and completion time for three typical tasks. Expand

Fractal approaches for visualizing huge hierarchies

- Computer Science
- Proceedings 1993 IEEE Symposium on Visual Languages
- 1993

Fractal approaches to the problems which associate with visualizing huge hierarchies are described and a prototype visualization system for UNIX directories is shown. Expand

On Balloon Drawings of Rooted Trees

- Computer Science, Mathematics
- J. Graph Algorithms Appl.
- 2007

An efficient algorithm to optimize angular resolution and aspect ratio for the balloon drawing of rooted unordered trees is designed and it is shown that this problem is reducible to the perfect matching problem for bipartite graphs, which is solvable in polynomial time. Expand

Tree visualization with tree-maps: 2-d space-filling approach

- Mathematics, Computer Science
- TOGS
- 1992

This paper deals with a two-dimensional space-filling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Expand

Fractal views: a fractal-based method for controlling information display

- Computer Science
- TOIS
- 1995

A new method for information display based on fractal theory is proposed, which provides fisheye-like views which integrate local details around the focal point and major landmarks further away and can be set flexibly. Expand

The Botanical Beauty of Random Binary Trees

- Mathematics, Computer Science
- Graph Drawing
- 1995

A simple mechanism for quickly rendering computer images of botanical trees based on random binary trees commonly found in computer science is presented, which visualize abstract binary trees as botanical ones and draw them in PostScript to resemble actualBotanical trees found in nature. Expand

Information Slices: Visualising and Exploring Large Hierarchies using Cascading, Semi-Circular Discs

- Computer Science
- 1998

This paper presents work in progress on a new technique for visu- alising and manipulating large hierarchies using a series of semi-circular discs based on information slices. Expand

Voronoi treemaps for the visualization of software metrics

- Computer Science
- SoftVis '05
- 2005

This paper introduces layouts based on arbitrary polygons that are advantageous with respect to the aspect ratio between width and height of the objects and the identification of boundaries between and within the hierarchy levels in the Treemap. Expand