pith. sign in

arxiv: 1908.01769 · v5 · pith:Q64MRSQAnew · submitted 2019-08-04 · 💻 cs.CG · cs.LG· stat.ML

Stress-Plus-X (SPX) Graph Layout

classification 💻 cs.CG cs.LGstat.ML
keywords criteriagraphoptimizealgorithmscrossingcrossingsdrawingedge
0
0 comments X
read the original abstract

Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that simultaneously optimizes stress together with several other criteria: edge crossings, minimum crossing angle, and upwardness (for directed acyclic graphs). SPX achieves results that are close to the state-of-the-art algorithms that optimize these metrics individually. SPX is flexible and extensible and can optimize a subset or all of these criteria simultaneously. Our experimental analysis shows that our joint optimization approach is successful in drawing graphs with good performance across readability criteria.

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.