Speeding-Up Forced-directed Algorithm by Clustering and Its Implementation
碩士 === 國立清華大學 === 資訊工程學系 === 104 === Graph drawing can simplify complex information of graphs through visualization. One of commonly used graph drawing methods is Force-directed algorithm (FDA) because of its easy of implementation and good quality of uniform edge length, uniform vertex distribution...
Main Authors: | Ho, Chia Han, 何佳翰 |
---|---|
Other Authors: | Lee, Che Rung |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93325593382657575029 |
Similar Items
-
Drawing Large Clustered Graphs Using a Multilevel Force-Directed Algorithm
by: Ming-Yen Ho, et al.
Published: (2005) -
Speeding up Fuzzy k-Means Clustering Algorithm on GPU
by: Chang, Tsun-Chuan, et al.
Published: (2015) -
Speeding Up the Human Action Recognition System by Using Expectation-Maximization Algorithm
by: Yue-LinHo, et al.
Published: (2015) -
Drawing Clustered Graphs Using a Force-directed Placement Algorithm
by: Yu-Jung Ko, et al.
Published: (2015) -
Speeding up Generalized Fuzzy k-Means Clustering Using m Nearest Cluster Centers Algorithm on GPU
by: Dinh-Trung Vu, et al.
Published: (2015)