Abstract | ||
---|---|---|
We present in this paper a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties which are often valuable to be visualized. In general, these networks are pruned with a network scaling algorithm, then visualized using a drawing algorithm \cite{Chen98a}. However, typical drawing algorithms do not work properly, especially when the size of the networks grows. Edge crossings appear while the drawing space is not adequately filled resulting in an unsightly display. The approach presented in this paper is able to print the networks filling all the available space in an aesthetic way, while avoiding edge crossings. The algorithm is detailed and compared with the classical Kamada-Kawai drawing algorithm on two maps. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/CASoN.2009.25 | CASoN |
Keywords | Field | DocType |
unusual topological property,unsightly display,drawing space,classical kamada-kawai drawing algorithm,space-based layout algorithm,graphically co-citation network,co-citation networks,typical drawing algorithm,drawing algorithm,edge crossing,available space,spine,social networks,graph drawing,design methodology,pediatrics,graph theory,social network analysis,displays,shape,algorithm design and analysis,layout,visualization,computer networks,information analysis,data visualization | Computer science,Scaling algorithm,Theoretical computer science,Artificial intelligence,Co-citation,Graph theory,Distance measurement,Line drawing algorithm,Algorithm design,Visualization,Social network analysis,Algorithm,Machine learning | Conference |
ISSN | Citations | PageRank |
2155-7047 | 0 | 0.34 |
References | Authors | |
7 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Arnaud Quirin | 1 | 168 | 13.68 |
Oscar Cordon | 2 | 75 | 9.21 |