Abstract
We present the first practical Integer Linear Programming model for Sankey Diagram layout. We show that this approach is viable in terms of running time for reasonably complex diagrams and also that the quality of the layout is measurably and visibly better than heuristic approaches in terms of crossing reduction. Finally, we demonstrate that the model is easily extensible through the addition of constraints, such as arbitrary grouping of nodes.
Original language | English |
---|---|
Title of host publication | Proceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018 |
Subtitle of host publication | 10–13 April 2018 Kobe, Japan |
Editors | Stefan Bruckner, Koji Koyamada, Bongshin Lee |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 135-139 |
Number of pages | 5 |
ISBN (Electronic) | 9781538614242 |
DOIs | |
Publication status | Published - 2018 |
Event | IEEE Pacific Visualization Symposium 2018 - Kobe, Japan Duration: 10 Apr 2018 → 13 Apr 2018 Conference number: 11th http://research.cbs.chula.ac.th/pvis2019/home.aspx https://ieeexplore.ieee.org/xpl/conhome/8365785/proceeding (Proceedings) |
Conference
Conference | IEEE Pacific Visualization Symposium 2018 |
---|---|
Abbreviated title | PacificVis 2018 |
Country/Territory | Japan |
City | Kobe |
Period | 10/04/18 → 13/04/18 |
Internet address |
Keywords
- graph drawings
- integer programming
- Visualization