A parallel Fruchterman–Reingold algorithm optimized for fast visualization of large graphs and swarms of data

P Gajdoš, T Ježowicz, V Uher, P Dohnálek - Swarm and evolutionary …, 2016 - Elsevier
Graphs in computer science are widely used in social network analysis, computer networks,
transportation networks, and many other areas. In general, they can visualize relationships …

Solving nearest neighbors problem on gpu to speed up the fruchterman-reingold graph layout algorithm

V Uher, P Gajdoš, T Ježowicz - 2015 IEEE 2nd International …, 2015 - ieeexplore.ieee.org
Fast searching of the nearest neigbors in unordered point clouds is a very common task.
This article presents a new parallel method tested on graph layout algorithm. Graphs in …

[PDF][PDF] Organization and Management of Massive Terrain Data Using Block Quadtree

Y Ying - International Journal of Simulation--Systems, Science …, 2016 - ijssst.info
To alleviate the impact on terrain rendering caused by real-time scheduling deformation
data, we presented an organization approach of massive terrain data based on block …

[引用][C] 瓦片四叉树和填充曲线实现海量地形数据管理

杨莹 - 计算机工程与应用, 2016