Please use this identifier to cite or link to this item:
|Title:||A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization||Contributor(s):||Huang, X (author); Eades, P (author); Lai, W (author)||Publication Date:||2005||Handle Link:||https://hdl.handle.net/1959.11/244||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 algorithmicissues 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 calledforce-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.||Publication Type:||Journal Article||Source of Publication:||Conferences in Research and Practice in Information Technology, v.38, p. 87-96||Publisher:||Australian Computer Society Inc||Place of Publication:||Australia||ISSN:||1445-1336||Field of Research (FOR):||080103 Computer Graphics||Peer Reviewed:||Yes||HERDC Category Description:||C1 Refereed Article in a Scholarly Journal||Statistics to Oct 2018:||Visitors: 168
|Appears in Collections:||Journal Article|
Files in This Item:
checked on Dec 29, 2018
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.