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 vi-sualization 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 naviga-tion. Variants of the classical Reingold-Tilford algorithm are presented and their performance is studied both experimentally and analytically. © Springer-Verlag Berlin Heidelberg 1999.
Infinite Trees and the Future / Demetrescu, Camil; G., Di Battista; Finocchi, Irene; Giuseppe, Liotta; Maurizio, Patrignani; Maurizio, Pizzonia. - STAMPA. - 1731:(1999), pp. 379-391. (Intervento presentato al convegno 7th International Symposium on Graph Drawing, GD 1999 tenutosi a Prague) [10.1007/3-540-46648-7_39].
Infinite Trees and the Future
DEMETRESCU, Camil;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 vi-sualization 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 naviga-tion. Variants of the classical Reingold-Tilford algorithm are presented and their performance is studied both experimentally and analytically. © Springer-Verlag Berlin Heidelberg 1999.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
