Abstract
The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynamic drawing, have been a problem in graph visualization. Several approaches have recently been proposed to solve such a problem. These approaches, however, lack the scalabilities of dealing with large number of overlapping nodes. Providing a formal description of the problem, this paper presents a scalable version of our previous approach called the Force-Transfer algorithm. Compared to other methods, our new algorithm is able to achieve the compact adjusted layout of a large graph.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation |
| Editors | Ebad Banissi, Muhammad Sarfraz, Mao Lin Huang, Qiang Wu |
| Place of Publication | Los Alamitos, United States of America |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 43-48 |
| ISBN (Print) | 0769526063 |
| DOIs | |
| Publication status | Published - 2006 |
| Event | CGIVF 2006: 3rd International Conference on Computer Graphics, Imaging and Visualisation - Sydney, Australia Duration: 26 Jul 2006 → 28 Jul 2006 |
Conference
| Conference | CGIVF 2006: 3rd International Conference on Computer Graphics, Imaging and Visualisation |
|---|---|
| City | Sydney, Australia |
| Period | 26/07/06 → 28/07/06 |
Keywords
- Computer Graphics
Fingerprint
Dive into the research topics of 'A Scalable Algorithm for Adjusting Node-Node Overlaps'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver