학술논문

Stress-Plus-X (SPX) Graph Layout
Document Type
Chapter
Author
Goos, Gerhard, Founding Editor; Hartmanis, Juris, Founding Editor; Bertino, Elisa, Editorial Board Member; Gao, Wen, Editorial Board Member; Steffen, Bernhard, Editorial Board Member; Woeginger, Gerhard, Editorial Board Member; Yung, Moti, Editorial Board Member; Archambault, Daniel, Editor; Tóth, Csaba D., Editor; Devkota, SabinAhmed, ReyanDe Luca, FeliceIsaacs, Katherine E.Kobourov, Stephen
Source
Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings. 11/28/2019. 11904:291-304
Subject
Computer Science
Algorithm Analysis and Problem Complexity
Mathematics of Computing
Data Structures and Information Theory
Computer Imaging, Vision, Pattern Recognition and Graphics
Language
English
ISSN
0302-9743
1611-3349
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.