2PALMER S,ROCK I. Rethinking perceptual organization: the role of uniform connectedness [ J ]. Psychonomic Bulletin & Review, 1994,1(l):29-55.
3SHNEIDERMAN B, ARIS A. Network visualization by semantic sub-strates[J]. IEEE Trans on Visualization and Computer Graphics, 2006,12(5) :733-740.
4CUI Wei-wei. A survey on graph visualization[ D]. Hong Kong:Hong Kong University of Science and Technology,2007.
5EADES P. A heuristic for graph drawing[ J]. CongreSSUS numer-antium,1984,42 : 149-160.
6KAMADA T, KAWAI S. An algorithm for drawing general undirected graphs[J], Information Processing Letters, 1989,31 (1) :7-15.
7DAVIDSON R, HAREL D. Drawing graphs nicely using simulated annealing[J]. ACM Trans on Graphics, 1996,15(4) :301-331.
8FRUCHTMANER T, REINGOLD E M. Graph drawing by force-directed placement[ J]. Software-Practice and Experience, 1991, 21(11) : 1129-1164.
9GHONIEM M, FEKETE J D, CASTAGLIOLA P. On the readability of graphs using node-link and matrix-bs^ed representations : a controlled experiment and statistical analysis [ J ]. Information Visual-ization,2005,4(2) :114-135.
10HAD ANY K, HAREL D. A multi-scale algorithm for drawing graphs nicely [J]. Discrete Applied Mathematics,2001,113(1) :3-21.
