A practical approach for 1/4-SHPEDs
暂无分享,去创建一个
[1] David A. Carrington,et al. Empirical Evaluation of Aesthetics-based Graph Layout , 2002, Empirical Software Engineering.
[2] Helen C. Purchase,et al. Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.
[3] Michael Kaufmann,et al. 1-Bend Orthogonal Partial Edge Drawing , 2014, J. Graph Algorithms Appl..
[4] Alexander Wolff,et al. Progress on Partial Edge Drawings , 2012, Graph Drawing.
[5] Giuseppe Liotta,et al. Fáry's Theorem for 1-Planar Graphs , 2012, COCOON.
[6] Michael Kaufmann,et al. Mad at Edge Crossings? Break the Edges! , 2012, FUN.
[7] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[8] Graham J. Wills,et al. Visualizing Network Data , 2009, Encyclopedia of Database Systems.
[9] Walter Didimo,et al. The Crossing-Angle Resolution in Graph Drawing , 2013 .
[10] Marcus Schaefer,et al. Train Tracks and Confluent Drawings , 2004, Graph Drawing.
[11] János Pach,et al. Graphs drawn with few crossings per edge , 1997, Comb..
[12] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[13] Hong Zhou,et al. Edge bundling in information visualization , 2013 .
[14] David Eppstein,et al. Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .
[15] J. Cremona,et al. Proceedings of the London Mathematical Society , 1893 .
[16] Michael Burch,et al. Evaluating Partially Drawn Links for Directed Graph Edges , 2011, GD.
[17] Adrian Rusu,et al. Using the Gestalt Principle of Closure to Alleviate the Edge Crossing Problem in Graph Drawings , 2011, 2011 15th International Conference on Information Visualisation.
[18] Emilio Di Giacomo,et al. Area requirement of graph drawings with few crossings per edge , 2013, Comput. Geom..
[19] Colin Ware,et al. Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..
[20] Gábor Tardos,et al. On the maximum number of edges in quasi-planar graphs , 2007, J. Comb. Theory, Ser. A.