Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms
暂无分享,去创建一个
[1] Matthias Pleßow,et al. Graph-Based Engineering Systems - A Family of Software Applications and their Underlying Framework , 2007, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..
[2] Helen C. Purchase,et al. Metrics for Graph Drawing Aesthetics , 2002, J. Vis. Lang. Comput..
[3] Peter J. Stuckey,et al. Orthogonal Hyperedge Routing , 2012, Diagrams.
[4] Carlo Batini,et al. Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..
[5] Bernd Becker,et al. Orthogonal hypergraph routing for improved visibility , 2004, GLSVLSI '04.
[6] Georg Sander,et al. Layout of Directed Hypergraphs with Orthogonal Hyperedges , 2003, GD.
[7] Daniel L. Moody,et al. The “Physics” of Notations: Toward a Scientific Basis for Constructing Visual Notations in Software Engineering , 2009, IEEE Transactions on Software Engineering.
[8] Reinhard von Hanxleden,et al. Counting Crossings for Layered Hypergraphs , 2014, Diagrams.
[9] Bernd Becker,et al. Orthogonal Hypergraph Drawing for Improved Visibility , 2006, J. Graph Algorithms Appl..