Introducing the fisheye view into graph drawing algorithm

Jun Nagumo, Jiro Tanaka

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)60-66
Number of pages7
JournalSystems and Computers in Japan
Volume32
Issue number12
DOIs
Publication statusPublished - 2001 Nov 15
Externally publishedYes

Fingerprint

Graph Drawing
Graph Transformation
Enlargement
Vertex of a graph
Rearrangement
Undirected Graph
Contraction
Display
Display devices

Keywords

  • Fisheye view
  • Force-directed arrangement
  • Graph drawing algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science

Cite this

Introducing the fisheye view into graph drawing algorithm. / Nagumo, Jun; Tanaka, Jiro.

In: Systems and Computers in Japan, Vol. 32, No. 12, 15.11.2001, p. 60-66.

Research output: Contribution to journalArticle

@article{dfb4cdb441b44bb5a202b8661bbb1ac0,
title = "Introducing the fisheye view into graph drawing algorithm",
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.",
keywords = "Fisheye view, Force-directed arrangement, Graph drawing algorithms",
author = "Jun Nagumo and Jiro Tanaka",
year = "2001",
month = "11",
day = "15",
doi = "10.1002/scj.1078",
language = "English",
volume = "32",
pages = "60--66",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "12",

}

TY - JOUR

T1 - Introducing the fisheye view into graph drawing algorithm

AU - Nagumo, Jun

AU - Tanaka, Jiro

PY - 2001/11/15

Y1 - 2001/11/15

N2 - 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.

AB - 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.

KW - Fisheye view

KW - Force-directed arrangement

KW - Graph drawing algorithms

UR - http://www.scopus.com/inward/record.url?scp=0035891909&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035891909&partnerID=8YFLogxK

U2 - 10.1002/scj.1078

DO - 10.1002/scj.1078

M3 - Article

AN - SCOPUS:0035891909

VL - 32

SP - 60

EP - 66

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 12

ER -