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.
@InCollection{zeckzer_et_al:DFU.SciViz.2010.11, author = {Zeckzer, Dirk and Chen, Fang and Hagen, Hans}, title = {{Computing an Optimal Layout for Cone Trees}}, booktitle = {Scientific Visualization: Advanced Concepts}, pages = {11--29}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-19-4}, ISSN = {1868-8977}, year = {2010}, volume = {1}, editor = {Hagen, Hans}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DFU.SciViz.2010.11}, URN = {urn:nbn:de:0030-drops-26947}, doi = {10.4230/DFU.SciViz.2010.11}, annote = {Keywords: Cone Trees, Information Visualization, Tree Layout} }
Feedback for Dagstuhl Publishing