Please use this identifier to cite or link to this item:
|Title:||Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout||Contributor(s):||Huang, X (author); Lai, W (author)||Publication Date:||2003||Handle Link:||https://hdl.handle.net/1959.11/910||Abstract:||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 onlythose 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.||Publication Type:||Conference Publication||Conference Name:||ACSC2003: The Twenty-Sixth Australasian Computer Science Conference, Adelaide, 4-7 February, 2003||Conference Details:||ACSC2003: The Twenty-Sixth Australasian Computer Science Conference, Adelaide, 4-7 February, 2003||Source of Publication:||Proceedings of The Twenty-Sixth Australasian Computer Science Conference (ACSC2003) - Volume 16, p. 349-358||Publisher:||ACS: Australian Computer Society, Inc||Place of Publication:||Darlinghurst, Australia||ISSN:||1445-1336||Field of Research (FOR):||080103 Computer Graphics||Peer Reviewed:||Yes||HERDC Category Description:||C1 Refereed Article in a Scholarly Journal||Other Links:||http://portal.acm.org/citation.cfm?id=783106.783146
|Statistics to Oct 2018:||Visitors: 239
|Appears in Collections:||Conference Publication|
Files in This Item:
checked on Feb 8, 2019
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.