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 |
Conference
| Conference | IEEE Pacific Visualization Symposium 2018 |
|---|---|
| Abbreviated title | PacificVis 2018 |
| Country | Japan |
| City | Kobe |
| Period | 10/04/18 → 13/04/18 |
| Internet address |
Keywords
- graph drawings
- integer programming
- Visualization
Cite this
}
Optimal Sankey Diagrams via Integer Programming. / Zarate, David Cheng; Bodic, Pierre Le; Dwyer, Tim; Gange, Graeme; Stuckey, Peter.
Proceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018: 10–13 April 2018 Kobe, Japan. ed. / Stefan Bruckner; Koji Koyamada; Bongshin Lee. Piscataway NJ USA : IEEE, Institute of Electrical and Electronics Engineers, 2018. p. 135-139.Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
TY - GEN
T1 - Optimal Sankey Diagrams via Integer Programming
AU - Zarate, David Cheng
AU - Bodic, Pierre Le
AU - Dwyer, Tim
AU - Gange, Graeme
AU - Stuckey, Peter
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
KW - graph drawings
KW - integer programming
KW - Visualization
UR - http://www.scopus.com/inward/record.url?scp=85048264535&partnerID=8YFLogxK
U2 - 10.1109/PacificVis.2018.00025
DO - 10.1109/PacificVis.2018.00025
M3 - Conference Paper
SP - 135
EP - 139
BT - Proceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018
A2 - Bruckner, Stefan
A2 - Koyamada, Koji
A2 - Lee, Bongshin
PB - IEEE, Institute of Electrical and Electronics Engineers
CY - Piscataway NJ USA
ER -