July 16, 2003 to July 18, 2003
Peter Rodgers , University of Kent, UK
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing web page similarity data.
graph drawing, metric embedding
Peter Rodgers, "Visualizing Weighted Edges in Graphs", IV, 2003, 2013 17th International Conference on Information Visualisation, 2013 17th International Conference on Information Visualisation 2003, pp. 258, doi:10.1109/IV.2003.1217988