Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/4265
Title: | A new algorithm for removing node overlapping in graph visualisation | Contributor(s): | Huang, Xiaodi (author); Lai, Wei (author); Sajeev, Abudulkadir (author); Gao, Junbin (author) | Publication Date: | 2007 | DOI: | 10.1016/j.ins.2007.02.016 | Handle Link: | https://hdl.handle.net/1959.11/4265 | Abstract: | Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, particularly in dynamic graph visualization. Providing a formal description of this problem, this paper presents a new approach called the Force-Transfer algorithm that removes node overlaps. Compared to other methods, our algorithm is usually able to achieve a compact adjusted layout within a reasonable running time. | Publication Type: | Journal Article | Source of Publication: | Information Sciences, 177(14), p. 2821-2844 | Publisher: | Elsevier Inc | Place of Publication: | United States of America | ISSN: | 0020-0255 | Fields of Research (FoR) 2008: | 080103 Computer Graphics | Socio-Economic Objective (SEO) 2008: | 890201 Application Software Packages (excl. Computer Games) | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
---|---|
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Description | Size | Format |
---|
SCOPUSTM
Citations
39
checked on Aug 10, 2024
Page view(s)
1,234
checked on Aug 3, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.