|
Published Articles >> Table of Contents >> Abstract
International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)
pp. 43-48
A Scalable Algorithm for Adjusting Node-Node Overlaps
Xiaodi Huang, The University of New England, Australia
A.S.M. Sajeev, The University of New England, Australia
Wei Lai, Swinburne University of Technology, Australia
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CGIV.2006.9
Send link to a friend
| 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.
|
 Additional Information
|
Citation:
Xiaodi Huang, A.S.M. Sajeev, Wei Lai,
"A Scalable Algorithm for Adjusting Node-Node Overlaps,"
cgiv,
pp. 43-48,
International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06),
2006
|
|
