Graph-based visualisation
(Jansz 1998; Jansz, Manning and Indurkhya 1999)
Classic graph layout problem
Adapts work by Eades et al. (1998) and Huang et al. (1998) on visualisation and navigation of WWW document linkages
Uses the spring algorithm. Big advantage is that it is an iterative updating algorithm, and so gives an easy interactivity:
- it wiggles and people can play with it.
Clarity and simplicity of graph: Software maintains a set of focus nodes to prevent overcrowding