GraphMaps: browsing large graphs as interactive maps
From MaRDI portal
Abstract: Algorithms for laying out large graphs have seen significant progress in the past decade. However, browsing large graphs remains a challenge. Rendering thousands of graphical elements at once often results in a cluttered image, and navigating these elements naively can cause disorientation. To address this challenge we propose a method called GraphMaps, mimicking the browsing experience of online geographic maps. GraphMaps creates a sequence of layers, where each layer refines the previous one. During graph browsing, GraphMaps chooses the layer corresponding to the zoom level, and renders only those entities of the layer that intersect the current viewport. The result is that, regardless of the graph size, the number of entities rendered at each view does not exceed a predefined threshold, yet all graph elements can be explored by the standard zoom and pan operations. GraphMaps preprocesses a graph in such a way that during browsing, the geometry of the entities is stable, and the viewer is responsive. Our case studies indicate that GraphMaps is useful in gaining an overview of a large graph, and also in exploring a graph on a finer level of detail.
Recommendations
Cited in
(9)- Using the metro-map metaphor for drawing hypergraphs
- Difference Map Readability for Dynamic Graphs
- Image-based graph visualization: advances and challenges
- Building knowledge maps of web graphs
- An experimental study on the ply number of straight-line drawings
- LunarVis – Analytic Visualizations of Large Graphs
- scientific article; zbMATH DE number 1560327 (Why is no real title available?)
- Simplified emanation graphs: a sparse plane spanner with Steiner points
- Emanation graph: a plane geometric spanner with Steiner points
This page was built for publication: GraphMaps: browsing large graphs as interactive maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959735)