DFU.SciViz.2010.11.pdf
- Filesize: 1.05 MB
- 19 pages
Document
Computing an Optimal Layout for Cone Trees
Authors
-
Part of:
Volume:
Scientific Visualization: Advanced Concepts (DFU - Vol. 1)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2010-08-02
Cite AsGet BibTex
Dirk Zeckzer, Fang Chen, and Hans Hagen. Computing an Optimal Layout for Cone Trees. In Scientific Visualization: Advanced Concepts. Dagstuhl Follow-Ups, Volume 1, pp. 11-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DFU.SciViz.2010.11
https://doi.org/10.4230/DFU.SciViz.2010.11
Abstract
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for trees. This paper is based on an approach for constructing cone trees bottom-up. For this approach, an optimal layout for these trees is given together with a proof that based on the assumptions, there can be no better layouts. This comprises special cases, an optimal constant for the general case, and a post-processing step improving the layout.
Keywords
- Cone Trees
- Information Visualization
- Tree Layout
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads