Validating a 3D layout for memorable graphs

Summary form only given. Describes a layout technique for relational graphs which is suited to large graphs, i.e. those with many nodes and edges. Unlike many existing layout techniques, the assumptions behind the aesthetic criteria chosen for the graph have been experimentally verified. This paper describes a series of experiments which attempts to determine the internal layout shape that is most appropriate for enabling users to remember where nodes are located for future reference. Graph layout algorithms are concerned with the display of graphs containing relational information that can be applied to a wide spectrum of application domains. This paper describes an experiment used to validate the design of a particular layout form. The layout is described as a `bus graph´, which has been designed with the view to its application on large graphs that are constructed for a specific user. Thus, the shape of the layout is meant to facilitate users remembering the location of previously contacted nodes