A Force-Directed Algorithm that Preserves Edge Crossing Properties
作者： François Bertault
关键词:
摘要: … algorithm for undirected graphs, based on a force-directed approach, that preserves edgecrossing properties. This algorithm … to improve classical algorithms for drawing planar graphs …
core.ac.uk
springer.com
sci-hub.st 参考文章(6)
H. De Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid Combinatorica. ,vol. 10, pp. 41- 51 ,(1990) , 10.1007/BF02122694
Tomihisa Kamada, Satoru Kawai, An algorithm for drawing general undirected graphs Information Processing Letters. ,vol. 31, pp. 7- 15 ,(1989) , 10.1016/0020-0190(89)90102-6
Goos Kant, Hans L. Bodlaender, Triangulating Planar Graphs While Minimizing the Maximum Degree Information & Computation. ,vol. 135, pp. 1- 14 ,(1997) , 10.1006/INCO.1997.2635
G. Kant, Drawing planar graphs using the lmc-ordering Proceedings., 33rd Annual Symposium on Foundations of Computer Science. pp. 101- 110 ,(1992) , 10.1109/SFCS.1992.267814
Thomas M. J. Fruchterman, Edward M. Reingold, Graph drawing by force-directed placement Software - Practice and Experience. ,vol. 21, pp. 1129- 1164 ,(1991) , 10.1002/SPE.4380211102
P. Eades, A Heuristic for Graph Drawing Congressus Numerantium. ,vol. 42, pp. 149- 160 ,(1984)