Information visualization has been widely used in many fields of science and engineering. As the importance of graphs increases, modifying graphs takes place very frequently. In the past, the concept of “mental map” has largely been ignored. Users have to spend a lot of time relearning the new graphs. In the long run this not only costs a lot of time but also because a painful work for the user since the graph size is getting larger and larger. This paper proposes an effective way to release the user from such kind of a distasteful job by maintaining a high degree of “mental map” when a graph is redrawn.CHAPTER 1 INTRODUCTION 1 CHAPTER 2 DRAWING GRAPH NICELY 5 2.1 INTRODUCTION OF SIMULATED ANNEALING 5 2.2 THE GRAPH DRAWING ALGORITHM 7 2....
A recent trend in graph drawing is directed to the visualization of graphs in 3D [1, 5, 6]. A promis...
Introduction. Graph drawing algorithms developed over the past 30 years aim to produce “readable” p...
Automatic graphic object layout methods have long been studied in these application areas in which g...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
Dynamic graph visualization is a key component of interactive graph visualization systems. Whenever ...
to the presentation of a person’s mind while exploring visual information, the better the pop datab ...
Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an imp...
In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not c...
Users working with graph layouts form mental maps of the layout’s parts and relative structure. When...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
Research on effective algorithms for efficient graph layout continues apace, and faster technology h...
This article we address the general problem of drawing nice-looking undirected straight-line graphs....
This paper presents graph drawing as an optimization problem. Each vertex of the graph is to be repr...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
While some research has been performed on the human understanding of static graph layout algorithms,...
A recent trend in graph drawing is directed to the visualization of graphs in 3D [1, 5, 6]. A promis...
Introduction. Graph drawing algorithms developed over the past 30 years aim to produce “readable” p...
Automatic graphic object layout methods have long been studied in these application areas in which g...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
Dynamic graph visualization is a key component of interactive graph visualization systems. Whenever ...
to the presentation of a person’s mind while exploring visual information, the better the pop datab ...
Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an imp...
In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not c...
Users working with graph layouts form mental maps of the layout’s parts and relative structure. When...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
Research on effective algorithms for efficient graph layout continues apace, and faster technology h...
This article we address the general problem of drawing nice-looking undirected straight-line graphs....
This paper presents graph drawing as an optimization problem. Each vertex of the graph is to be repr...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
While some research has been performed on the human understanding of static graph layout algorithms,...
A recent trend in graph drawing is directed to the visualization of graphs in 3D [1, 5, 6]. A promis...
Introduction. Graph drawing algorithms developed over the past 30 years aim to produce “readable” p...
Automatic graphic object layout methods have long been studied in these application areas in which g...