A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps

Abstract

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.

Multi-level tree based approach for interactive graph visualization with semantic zoom

“…Other studies that compare standard node-link representations with map-like ones show that map-like visualizations are superior in terms of task performance, memorization and engagement [54,55]. In this context, GraphMaps [48] visualizes a graph using the map metaphor and provides different zoom levels, driven by an embedding of the entire underlying graph. GRAM [14] also visualizes a graph using the map metaphor and provides different zoom levels but neither GraphMaps nor GRAM guarantees all six of our desirable properties.…”

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points

“…Nachmanson et al [13] introduced a system called GraphMaps for interactive visualization of large graphs based on constrained Delaunay triangulations. Later, Mondal and Nachmanson [12] introduced and used a specific mesh called the competition mesh to improve GraphMaps (Figure 1). Given a set of points P , a competition mesh is constructed by shooting from each point, four axis-aligned rays at the same speed, where the shorter rays stop the longer ones upon collision (the rays that are not stopped are clipped by the axis-aligned bounding box of P ).…”