A framework of filtering, clustering and dynamic layout graphs for visualization

Xiaodi Huang, Peter Eades, Wei Lai

Research output: Book chapter/Published conference paperConference paperpeer-review

15 Citations (Scopus)

Abstract

Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping node problem, large graph layout and dynamic graph layout. In order to solve these problems, this paper aims to systematically address algorithmic issues related to a novel framework that describes the process of graph visualization applications. First of all, a framework for graph visualization is described. As the important parts of this framework, we then develop two effective algorithms for filtering and clustering large graphs for the layouts. As for the dynamic graph layout, a new approach to removing overlapping nodes called force-transfer algorithm is developed. The framework has been implemented in a prototype called PGA to demonstrate the performance of the proposed algorithms. Finally, a case study is provided.

Original languageEnglish
Title of host publicationComputer Science 2005 - 28th Australasian Computer Science Conference, ACSC 2005
Pages87-96
Number of pages10
Publication statusPublished - 01 Dec 2005
Event28th Australasian Computer Science Conference, ACSC 2005 - Newcastle, NSW, Australia
Duration: 31 Jan 200503 Feb 2005

Publication series

NameConferences in Research and Practice in Information Technology Series
Volume38
ISSN (Print)1445-1336

Conference

Conference28th Australasian Computer Science Conference, ACSC 2005
Country/TerritoryAustralia
CityNewcastle, NSW
Period31/01/0503/02/05

Fingerprint

Dive into the research topics of 'A framework of filtering, clustering and dynamic layout graphs for visualization'. Together they form a unique fingerprint.

Cite this