Optimal Sankey Diagrams Via Integer Programming
Optimal Sankey Diagrams Via Integer Programming
复制标题
通过整数规划的最佳桑基图
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Peter James Stuckey
中科院分区：
文献类型：
--
作者：
David Cheng Zarate;P. L. Bodic;Tim Dwyer;G. Gange;Peter James Stuckey
我们提出了第一个实用的Sankey图布局的非线性规划模型。我们表明，这种方法是可行的合理复杂的图表的运行时间，也是布局的质量是可衡量的，明显优于启发式方法在减少交叉。最后，我们证明了该模型是很容易扩展的，通过添加约束，如任意分组的节点。
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.