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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86096042" target="_blank" >RIV/61989100:27240/16:86096042 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.swevo.2015.07.006" target="_blank" >http://dx.doi.org/10.1016/j.swevo.2015.07.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.swevo.2015.07.006" target="_blank" >10.1016/j.swevo.2015.07.006</a>

Result language
angličtina
Original language name
A parallel Fruchterman-Reingold algorithm optimized for fast visualization of large graphs and swarms of data
Original language description
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 between objects. However, fast drawing of graphs and other structures containing large numbers of data points with readable layouts is still a challenge. This paper describes a novel variant of the Fruchterman-Reingold graph layout algorithm which is adapted to GPU parallel architecture. A new approach based on space filling curves and a new way of repulsive forces computation on GPU are described. The paper contains both performance and quality tests of the new algorithm.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA15-06700S" target="_blank" >GA15-06700S: Unconventional Control of Complex Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)