Infinite Trees and the Future (Extended Abstract)

Demetrescu, Camil and Di Battista, Giuseppe and Finocchi, Irene and Liotta, Giuseppe and Patrignani, Maurizio and Pizzonia, Maurizio (1999) Infinite Trees and the Future (Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 379-391(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_39).

Full text not available from this repository.

Abstract

We study the problem of designing layout facilities for the navigation of an "infinite" graph, i. e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the navigation. We propose a framework for designing layout facilities that support the navigation of an infinite tree. The framework allows to exploit the knowledge of future moves of the user in order to reduce the changes in her mental map during the navigation. Variants of the classical Reingold-Tilford algorithm are presented and their performance is studied both experimentally and analytically.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_39
Classifications: M Methods > M.999 Others
M Methods > M.900 Tree
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/384

Actions (login required)

View Item View Item