Stress-Plus-X (SPX) Graph Layout

• Published in: Graph Drawing and Network Visualization Vol. 11904; pp. 291 - 304
• Main Authors: Devkota, Sabin, Ahmed, Reyan, De Luca, Felice, Isaacs, Katherine E., Kobourov, Stephen
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2019; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 3030358011; 9783030358013
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-35802-0_23

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.