Generalized Pythagoras Trees: A Fractal Approach to Hierarchy Visualization

  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},
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… 

Overlap-Free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization

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.

Combining Interactive Hierarchy Visualizations in a Web-based Application

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.

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

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.

Multiple linked perspectives on hierarchical data

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.

VizWick: a multiperspective view of hierarchical data

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.

Membangun Pythagoras Sebagai Visualisasi Random Forest Untuk Pemodelan Pohon Keputusan

The purpose of the study is to facilitate the tracking of ambiguous data contained in the attributes of Pythagorean construction for Random Forest, because the data is more easily traced to errors, which cannot be done by a single decision tree.

Pythagoras Tree Applied For Determined Instagram Usage Habit Decision

The result of the study that SDR is useful for the classification method for constructing Pythagoras Tree, however, the target attribute is must use a numerical variable to gain the Standard Deviation and the Mean.

Multi-class boosting with fuzzy decision trees

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.

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

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



Botanical visualization of huge hierarchies

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.

Indented Pixel Tree Plots

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.

Fractal approaches for visualizing huge hierarchies

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

On Balloon Drawings of Rooted Trees

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.

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

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.

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

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.

The Botanical Beauty of Random Binary Trees

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.

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

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.

Voronoi treemaps for the visualization of software metrics

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.

Computing Voronoi Treemaps: Faster, Simpler, and Resolution‐independent

It is shown that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low‐resolution approximations, even when the latter are implemented on graphics hardware.