Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Force-Transfer : A New Approach to Removing Overlapping Nodes in Graph Layout

Huang, X. and Lai, W.

    Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in each node readable in displaying such graphs, it is required there should be no overlapping nodes. This paper proposes the Force-Transfer algorithm to give a new efficient approach to removing overlapping nodes. The proposed approach employs a heuristic method to approximate the global optimal adjustment with the local minimal movement. Scanning from the seed node, the approach orthogonally transfers the minimum forces to only those nodes recursively overlapping with the node from where the forces start. We compare the Force-Transfer with the Force-Scan algorithm by mathematical proofs and experiments. The Force-Transfer approach can generate better results.
Cite as: Huang, X. and Lai, W. (2003). Force-Transfer : A New Approach to Removing Overlapping Nodes in Graph Layout. In Proc. Twenty-Sixth Australasian Computer Science Conference (ACSC2003), Adelaide, Australia. CRPIT, 16. Oudshoorn, M. J., Ed. ACS. 349-358.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007