Multi-level graph layout on the GPU
This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contrib...
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1998. - 13(2007), 6 vom: 01. Nov., Seite 1310-9 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article |
| Langue: | English |
| Publié: |
2007
|
| Accès à la collection: | IEEE transactions on visualization and computer graphics |
| Sujets: | Journal Article |
| Résumé: | This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet Service Provider) networks is presented |
|---|---|
| Description: | Date Completed 14.12.2007 Date Revised 09.01.2024 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1077-2626 |