Drawing Large Clustered Graphs Using a Multilevel Force-Directed Algorithm
碩士 === 國立臺灣大學 === 電機工程學研究所 === 93 === To draw large clustered graphs, a force-directed method combine with the multilevel technique is presented. As a large graph containing a huge number of vertices, a key step in drawing such a graph is to group those entities which have attributes in common to re...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14473010175906713215 |
| Summary: | 碩士 === 國立臺灣大學 === 電機工程學研究所 === 93 === To draw large clustered graphs, a force-directed method combine with the multilevel technique is presented. As a large graph containing a huge number of vertices, a key step in drawing such a graph is to group those entities which have attributes in common to reduce the original problem size.
Although the force-directed method which combines the multilevel technique can handle large graphs, it cannot express embedded clustered graphs very well. That is because straight-line drawing only cares about drawing graphs faster and nicer. We describe a method that can use straight-line drawing to show embedded clustered graphs. We alter the multilevel algorithm mentioned above to achieve the goal of aesthetic. As our experimental results indicate improved multilevel algorithm allows large clustered graphs to be drawn nicely.
|
|---|