Pith. sign in

REVIEW

A Force-Directed Method for Large Crossing Angle Graph Drawing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1012.4559 v1 pith:TXWKZP5R submitted 2010-12-21 cs.HC

A Force-Directed Method for Large Crossing Angle Graph Drawing

classification cs.HC
keywords crossinggraphmethodanglesedgealgorithmsangledrawing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

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