Name
Abstract | ||
|---|---|---|
The force-directed graph layout algorithm is one of the most widely used algorithms for drawing graphs. It aims at improving the graphs' readability and understanding by producing high-quality drawings. However, the traditional algorithm, while trying to find the most stable position for each vertex, fails to produce graphs that satisfy different aesthetic criteria. In this paper, we present an algorithm that concerns the number of edge crossings, angular resolution and crossing angles. These aesthetic criteria are chosen because they are closely related to human comprehension. In addition, we also introduce a refinement process by applying a curved edges drawing method to further improve the angular resolution, which can also beautify the final drawing. The experimental results have shown that our approach can produce graphs in a more aesthetically pleasing way with larger angular resolution, proper crossing angles and less edge crossings. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00791-014-0228-5 | Computat. and Visualiz. in Science |
Keywords | Field | DocType |
68r10,curved edges,force-directed method,angular resolution,crossing angle,graph visualization,05c85,68w40 | Graph drawing,Graph,Vertex (geometry),Algorithm,Force-directed graph drawing,Readability,Angular resolution,1-planar graph,Mathematics,Graph Layout | Journal |
Volume | Issue | ISSN |
16 | 3 | 1433-0369 |
Citations | PageRank | References |
2 | 0.36 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenqiang Dong | 1 | 2 | 0.36 |
| Xingyu Fu | 2 | 9 | 2.22 |
| Guangluan Xu | 3 | 2 | 0.70 |
| Yu Huang | 4 | 2 | 0.36 |