UM
Clustering-based force-directed algorithms for 3D graph visualization
Lu,Jiawei; Si,Yain Whar
2020-12-01
Source PublicationJournal of Supercomputing
ISSN0920-8542
Volume76Issue:12Pages:9654-9715
AbstractForce-directed algorithm is one of the most commonly used methods for visualization of 2D graphs. These algorithms can be applied to a plethora of applications such as data visualization, social network analysis, crypto-currency transactions, and wireless sensor networks. Due to their effectiveness in visualization of topological data, various force-directed algorithms for 2D graphs were proposed in recent years. Although force-directed algorithms for 2D graphs were extensively investigated in research community, the algorithms for 3D graph visualization were rarely reported in the literature. In this paper, we propose four novel clustering-based force-directed (CFD) algorithms for visualization of 3D graphs. By using clustering algorithms, we divide a large graph into many smaller graphs so that they can be effectively processed by force-directed algorithms. In addition, weights are also introduced to further enhance the calculation for clusters. The proposed CFD algorithms are tested on 3 datasets with varying numbers of nodes. The experimental results show that proposed algorithms can significantly reduce edge crossings in visualization of large 3D graphs. The results also reveal that CFD algorithms can also reduce Kamada and Kawai energy and standardized variance of edge lengths in 3D graph visualization.
Keyword3D graphs Clustering algorithm Force-directed algorithm Visualization
DOI10.1007/s11227-020-03226-w
URLView the original
Language英语
Scopus ID2-s2.0-85081599876
Fulltext Access
Citation statistics
Cited Times [WOS]:1   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
AffiliationDepartment of Computer and Information Science,University of Macau,Taipa,Avenida da Universidade,Macao
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Lu,Jiawei,Si,Yain Whar. Clustering-based force-directed algorithms for 3D graph visualization[J]. Journal of Supercomputing,2020,76(12):9654-9715.
APA Lu,Jiawei,&Si,Yain Whar.(2020).Clustering-based force-directed algorithms for 3D graph visualization.Journal of Supercomputing,76(12),9654-9715.
MLA Lu,Jiawei,et al."Clustering-based force-directed algorithms for 3D graph visualization".Journal of Supercomputing 76.12(2020):9654-9715.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lu,Jiawei]'s Articles
[Si,Yain Whar]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lu,Jiawei]'s Articles
[Si,Yain Whar]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lu,Jiawei]'s Articles
[Si,Yain Whar]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.