Orthogonal Hyperedge Routing
暂无分享,去创建一个
[1] Hai Zhou,et al. EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2] Danny Holten,et al. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.
[3] Yao-Wen Chang,et al. Efficient obstacle-avoiding rectilinear steiner tree construction , 2007, ISPD '07.
[4] F. Hwang,et al. The Steiner Tree Problem , 2012 .
[5] Chris C. N. Chu,et al. FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction , 2011, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Jarke J. van Wijk,et al. Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.
[7] Michael Kaufmann,et al. Improving Layered Graph Layouts with Edge Bundling , 2010, GD.
[8] Peter J. Stuckey,et al. Incremental Connector Routing , 2005, GD.
[9] Peter J. Stuckey,et al. Orthogonal Connector Routing , 2009, GD.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .