Abstract
In this paper, an algorithm is proposed for automatic drawing of undirected graphs. Specifically, a modified method of introducing a fisheye view into the force-directed redrawing algorithm is offered. The proposed representation involves enlargement of regions located near specified nodes and contraction of far regions by varying the edge length while not using node position data, which ensures easy incorporation into the conventional force-directed rearrangement technique. In addition, smooth display of graph transformations using the results of subsequent iterative calculation, which is a feature of the force-directed algorithm, is maintained.
| Original language | English |
|---|---|
| Pages (from-to) | 60-66 |
| Number of pages | 7 |
| Journal | Systems and Computers in Japan |
| Volume | 32 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2001 Nov 15 |
| Externally published | Yes |
Keywords
- Fisheye view
- Force-directed arrangement
- Graph drawing algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics