Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/4265
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Xiaodi | en |
dc.contributor.author | Lai, Wei | en |
dc.contributor.author | Sajeev, Abudulkadir | en |
dc.contributor.author | Gao, Junbin | en |
dc.date.accessioned | 2010-01-25T16:16:00Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Information Sciences, 177(14), p. 2821-2844 | en |
dc.identifier.issn | 0020-0255 | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/4265 | - |
dc.description.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. | en |
dc.language | en | en |
dc.publisher | Elsevier Inc | en |
dc.relation.ispartof | Information Sciences | en |
dc.title | A new algorithm for removing node overlapping in graph visualisation | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1016/j.ins.2007.02.016 | en |
dc.subject.keywords | Computer Graphics | en |
local.contributor.firstname | Xiaodi | en |
local.contributor.firstname | Wei | en |
local.contributor.firstname | Abudulkadir | en |
local.contributor.firstname | Junbin | en |
local.subject.for2008 | 080103 Computer Graphics | en |
local.subject.seo2008 | 890201 Application Software Packages (excl. Computer Games) | en |
local.profile.school | School of Science and Technology | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | xhuang@une.edu.au | en |
local.profile.email | asajeev@une.edu.au | en |
local.profile.email | jgao@une.edu.au | en |
local.output.category | C1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.identifier.epublicationsrecord | pes:4874 | en |
local.publisher.place | United States of America | en |
local.format.startpage | 2821 | en |
local.format.endpage | 2844 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 177 | en |
local.identifier.issue | 14 | en |
local.contributor.lastname | Huang | en |
local.contributor.lastname | Lai | en |
local.contributor.lastname | Sajeev | en |
local.contributor.lastname | Gao | en |
dc.identifier.staff | une-id:xhuang | en |
dc.identifier.staff | une-id:asajeev | en |
dc.identifier.staff | une-id:jgao | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:4366 | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | A new algorithm for removing node overlapping in graph visualisation | en |
local.output.categorydescription | C1 Refereed Article in a Scholarly Journal | en |
local.search.author | Huang, Xiaodi | en |
local.search.author | Lai, Wei | en |
local.search.author | Sajeev, Abudulkadir | en |
local.search.author | Gao, Junbin | en |
local.uneassociation | Unknown | en |
local.identifier.wosid | 000247110000001 | en |
local.year.published | 2007 | en |
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.