An algorithm for drawing general undirected graphs
Information Processing Letters
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Toolkit Design for Interactive Structured Graphics
IEEE Transactions on Software Engineering
prefuse: a toolkit for interactive information visualization
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
GUESS: a language and interface for graph exploration
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
Rapid Multipole Graph Drawing on the GPU
Graph Drawing
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Force-directed approaches to sensor localization
ACM Transactions on Sensor Networks (TOSN)
Walking in facebook: a case study of unbiased sampling of OSNs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
Distributed force-directed graph layout and visualization
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
A scalable parallel force-directed graph layout algorithm
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
Hi-index | 0.00 |
In this paper, we propose a distributed approach for visualizing graph datasets using distributed force-directed layout algorithm on multiple displays each of which is controlled by a compute device. In this distributed network of compute-display nodes, the display devices form a geometrically contiguous tiled display wall, and the data distribution among the compute-display nodes for algorithmic purposes is related to the data distribution to its corresponding display nodes for visualization purposes. This approach collocates computation and visualization within the same node and minimizes network bandwidth requirement for data exchange between nodes. Leveraging the advantages of the above novel system design, we also present a distributed force directed graph layout algorithm. In this distributed algorithm, we address two issues specific to tiled displays: number of edges crossing the display panel boundaries (across two different compute-display clients) and the location of graph vertices close to panel boundaries which may lead to incorrect visual analytic conclusions. We integrate the cost functions expressing the above two effects along with the cost function of the edge-crossings within each display into the graph layout algorithm. Using this distributed approach, for the first time a very large graph has been laid out in a large real estate provided by the tiled display. The proposed system is evaluated on various parameters including the scalability, the impact on display real-estate utilization, and finally, network bandwidth usage.