Visualization of large graphs has become increasingly important due to the growing size of data available around us. Traditional data visualization systems render the graph in full detail on a single screen. This approach sometimes requires to render many objects on the screen, which overwhelms the user. A GraphMaps system tries to overcome this problem by visualizing the graph using zoom levels, which is similar to a geographic map visualization. GraphMaps reveals the structural properties of the graph and enables users to interact with the graph in a natural way  . The available implementation of GraphMaps system is based on an incremental mesh generation technique that does not control the number of zoom levels and the way the nodes appear on different levels . In this paper we develop a technique to construct GraphMaps from any given mesh that is generated from a 2D point set  , and for any given number of zoom levels. We demonstrate our approach introducing competition mesh, which is simple to construct, has  low dilation and high angular resolution. Finally, we give an algorithm for assigning nodes to zoom levels that minimizes the  number of nodes appearing while the user zooms in to a lower level. Keeping the number of such nodes low helps avoiding abrupt changes when zooming in and out between the levels  .
A GraphMaps is a system that visualizes a graph using zoom levels, which is similar to a geographic map visualization. GraphMaps reveals the structural properties of the graph and enables users to explore the graph in a natural way by using the standard zoom and pan operations . The available implementation of GraphMaps faces many challenges such as the number of zoom levels may be large, nodes may be unevenly distributed to different levels, shared edges may create ambiguity due to the selection of multiple nodes . In this paper , we develop an algorithmic framework to construct GraphMaps from any given mesh ( generated from a 2D point set ) , and for any given number of zoom levels. We demonstrate our approach introducing competition mesh, which is simple to construct, has a low dilation and high angular resolution. We present an algorithm for assigning nodes to zoom levels that minimizes the change in the number of nodes on visible on the screen while the user zooms in and out between the levels . We think that keeping this change small facilitates smooth browsing of the graph. We also propose new node selection techniques to cope with some of the challenges of the GraphMaps approach .
R
Visualization of large graphs has become increasingly important due to the growing size of data available around us. Traditional data visualization systems render the graph in full detail on a single screen. This approach sometimes requires to render many objects on the screen, which overwhelms the user. A GraphMaps system tries to overcome this problem by visualizing the
A GraphMaps is a system that visualizes a
R
interact with
explore
A
by using the standard zoom and pan operations
R
system is based on an incremental mesh generation technique that does not control
faces many challenges such as
R
and the way the nodes appear on different levels
may be large, nodes may be unevenly distributed to different levels, shared edges may create ambiguity due to the selection of multiple nodes
R
we develop a technique
, we develop an algorithmic framework
R
that is
(
A
)
A
a
R
Finally, we give
We present
A
change in the
R
appearing
on visible on the screen
D
to a lower level. Keeping the number of such nodes low helps avoiding abrupt changes when zooming in
A
. We think that keeping this change small facilitates smooth browsing of the graph. We also propose new node selection techniques to cope with some of the challenges of the GraphMaps approach