Optimal Sankey Diagrams via Integer Programming

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018
Subtitle of host publication10–13 April 2018 Kobe, Japan
EditorsStefan Bruckner, Koji Koyamada, Bongshin Lee
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages135-139
Number of pages5
ISBN (Electronic)9781538614242
DOIs
Publication statusPublished - 2018
EventIEEE Pacific Visualization Symposium 2018 - Kobe, Japan
Duration: 10 Apr 201813 Apr 2018
Conference number: 11th
http://research.cbs.chula.ac.th/pvis2019/home.aspx

Conference

ConferenceIEEE Pacific Visualization Symposium 2018
Abbreviated titlePacificVis 2018
CountryJapan
CityKobe
Period10/04/1813/04/18
Internet address

Keywords

  • graph drawings
  • integer programming
  • Visualization

Cite this

Zarate, D. C., Bodic, P. L., Dwyer, T., Gange, G., & Stuckey, P. (2018). Optimal Sankey Diagrams via Integer Programming. In S. Bruckner, K. Koyamada, & B. Lee (Eds.), Proceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018: 10–13 April 2018 Kobe, Japan (pp. 135-139). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/PacificVis.2018.00025