pith. machine review for the scientific record. sign in

arxiv: 1012.4559 · v1 · submitted 2010-12-21 · 💻 cs.HC

Recognition: unknown

A Force-Directed Method for Large Crossing Angle Graph Drawing

Authors on Pith no claims yet
classification 💻 cs.HC
keywords crossinggraphmethodanglesedgealgorithmsangledrawing
0
0 comments X
read the original abstract

Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increases crossing angles. Surprisingly, the experimental results further demonstrate that the resulting drawings produced by our method have fewer edge crossings, a shorter total edge length and more uniform edge lengths, compared to classical spring algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.