Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/4735
Title: | A Scalable Algorithm for Adjusting Node-Node Overlaps | Contributor(s): | Huang, Xiaodi (author); Sajeev, Abudulkadir (author); Lai, Wei (author) | Publication Date: | 2006 | DOI: | 10.1109/CGIV.2006.9 | Handle Link: | https://hdl.handle.net/1959.11/4735 | 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. | Publication Type: | Conference Publication | Conference Details: | CGIVF 2006: 3rd International Conference on Computer Graphics, Imaging and Visualisation, Sydney, Australia, 26th - 28th July, 2006 | Source of Publication: | Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation, p. 43-48 | Publisher: | Institute of Electrical and Electronics Engineers (IEEE) | Place of Publication: | Los Alamitos, United States of America | Fields of Research (FoR) 2008: | 080103 Computer Graphics | Socio-Economic Objective (SEO) 2008: | 890202 Application Tools and System Utilities | Peer Reviewed: | Yes | HERDC Category Description: | E1 Refereed Scholarly Conference Publication |
---|---|
Appears in Collections: | Conference Publication |
Files in This Item:
File | Description | Size | Format |
---|
SCOPUSTM
Citations
4
checked on Jun 29, 2024
Page view(s)
1,132
checked on Jun 30, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.