The visualization of graphs using classical node-link diagrams works well up to the point where the number of nodes exceeds the capacity of the display. To overcome this limitation Zinsmaier et al. [5] proposed a rendering technique which aggregates nodes based on their spatial distribution, thereby allowing for visual exploration of large graphs. Since the rendering is done on the graphics processing unit (GPU) this process is reasonably fast. However, the connection between input graph and visual image is partially lost, which makes it harder, for instance, to process weights and labels of the input graph.
展开▼
