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.
Infinite Trees and the Future / Demetrescu, Camil; G., Di Battista; Finocchi, Irene; Giuseppe, Liotta; Maurizio, Patrignani; Maurizio, Pizzonia. - Proc. 7th Int. Symp. on Graph Drawing (GD'99), (1999), pp. 379-391. (Graph Drawing, Štiřín Castle, Czech Republic, September 15–19, 1999). [10.1007/3-540-46648-7_39].
Infinite Trees and the Future
FINOCCHI, Irene;
1999
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
