Skip to main navigation Skip to search Skip to main content

A Scalable Algorithm for Adjusting Node-Node Overlaps

Xiaodi Huang, Abudulkadir Sajeev, Wei Lai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynamic drawing, have been a problem in graph visualization. Several approaches have recently been proposed to solve such a problem. These approaches, however, lack the scalabilities of dealing with large number of overlapping nodes. Providing a formal description of the problem, this paper presents a scalable version of our previous approach called the Force-Transfer algorithm. Compared to other methods, our new algorithm is able to achieve the compact adjusted layout of a large graph.
Original languageEnglish
Title of host publicationProceedings of the International Conference on Computer Graphics, Imaging and Visualisation
EditorsEbad Banissi, Muhammad Sarfraz, Mao Lin Huang, Qiang Wu
Place of PublicationLos Alamitos, United States of America
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages43-48
ISBN (Print)0769526063
DOIs
Publication statusPublished - 2006
EventCGIVF 2006: 3rd International Conference on Computer Graphics, Imaging and Visualisation - Sydney, Australia
Duration: 26 Jul 200628 Jul 2006

Conference

ConferenceCGIVF 2006: 3rd International Conference on Computer Graphics, Imaging and Visualisation
CitySydney, Australia
Period26/07/0628/07/06

Keywords

  • Computer Graphics

Fingerprint

Dive into the research topics of 'A Scalable Algorithm for Adjusting Node-Node Overlaps'. Together they form a unique fingerprint.

Cite this