Name
Abstract | ||
|---|---|---|
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 the geometry of the original fractal approach. Each vertex in the hierarchy is visualized as a rectangle sized according to a metric. We analyze several visual parameters such as length, width, order, and color of the nodes against the use of different metrics. Interactions help to zoom, browse, and filter the hierarchy. The usefulness of our technique is illustrated by two case studies visualizing directory structures and a large phylogenetic tree. We compare our approach with existing tree diagrams and discuss questions of geometry, perception, readability, and aesthetics. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-25117-2_8 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Hierarchy visualization,Fractals | Vertex (geometry),Computer science,Rectangle,Fractal,Theoretical computer science,Hierarchy,Hierarchical database model,Recursion,Recursive definition,Binary number | Conference |
Volume | ISSN | Citations |
550 | 1865-0929 | 1 |
PageRank | References | Authors |
0.35 | 11 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabian Beck | 1 | 591 | 43.93 |
| Michael Burch | 2 | 854 | 66.47 |
| Tanja Munz | 3 | 9 | 2.20 |
| Lorenzo Di Silvestro | 4 | 6 | 1.16 |
| Daniel Weiskopf | 5 | 2988 | 204.30 |