1. Research UNE
  2. UNE
  3. Journal Article
Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/4265
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Xiaodien
dc.contributor.authorLai, Weien
dc.contributor.authorSajeev, Abudulkadiren
dc.contributor.authorGao, Junbinen
dc.date.accessioned2010-01-25T16:16:00Z-
dc.date.issued2007-
dc.identifier.citationInformation Sciences, 177(14), p. 2821-2844en
dc.identifier.issn0020-0255en
dc.identifier.urihttps://hdl.handle.net/1959.11/4265-
dc.description.abstractTechniques 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.languageenen
dc.publisherElsevier Incen
dc.relation.ispartofInformation Sciencesen
dc.titleA new algorithm for removing node overlapping in graph visualisationen
dc.typeJournal Articleen
dc.identifier.doi10.1016/j.ins.2007.02.016en
dc.subject.keywordsComputer Graphicsen
local.contributor.firstnameXiaodien
local.contributor.firstnameWeien
local.contributor.firstnameAbudulkadiren
local.contributor.firstnameJunbinen
local.subject.for2008080103 Computer Graphicsen
local.subject.seo2008890201 Application Software Packages (excl. Computer Games)en
local.profile.schoolSchool of Science and Technologyen
local.profile.schoolSchool of Science and Technologyen
local.profile.emailxhuang@une.edu.auen
local.profile.emailasajeev@une.edu.auen
local.profile.emailjgao@une.edu.auen
local.output.categoryC1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.identifier.epublicationsrecordpes:4874en
local.publisher.placeUnited States of Americaen
local.format.startpage2821en
local.format.endpage2844en
local.peerreviewedYesen
local.identifier.volume177en
local.identifier.issue14en
local.contributor.lastnameHuangen
local.contributor.lastnameLaien
local.contributor.lastnameSajeeven
local.contributor.lastnameGaoen
dc.identifier.staffune-id:xhuangen
dc.identifier.staffune-id:asajeeven
dc.identifier.staffune-id:jgaoen
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:4366en
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleA new algorithm for removing node overlapping in graph visualisationen
local.output.categorydescriptionC1 Refereed Article in a Scholarly Journalen
local.search.authorHuang, Xiaodien
local.search.authorLai, Weien
local.search.authorSajeev, Abudulkadiren
local.search.authorGao, Junbinen
local.uneassociationUnknownen
local.identifier.wosid000247110000001en
local.year.published2007en
Appears in Collections:Journal Article
School of Science and Technology
Files in This Item:
2 files
File Description SizeFormat 
Show simple item record

SCOPUSTM   
Citations

39
checked on Aug 10, 2024

Page view(s)

1,234
checked on Aug 3, 2024
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.