Solving nearest neighbors problem on GPU to speed up the Fruchterman-Reingold graph layout algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096067" target="_blank" >RIV/61989100:27240/15:86096067 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/15:86096067 RIV/61989100:27730/15:86096067
Result on the web
<a href="http://dx.doi.org/10.1109/CYBConf.2015.7175951" target="_blank" >http://dx.doi.org/10.1109/CYBConf.2015.7175951</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CYBConf.2015.7175951" target="_blank" >10.1109/CYBConf.2015.7175951</a>
Alternative languages
Result language
angličtina
Original language name
Solving nearest neighbors problem on GPU to speed up the Fruchterman-Reingold graph layout algorithm
Original language description
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 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 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 using a new K-NN approach based on space-filling curves and a new way of repulsive forces computation on GPU. The paper contains both performance and quality tests of the algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings - 2015 IEEE 2nd International Conference on Cybernetics, CYBCONF 2015
ISBN
978-1-4799-8322-3
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
305-310
Publisher name
Institute of Electrical and Electronics Engineers
Place of publication
New York
Event location
Gdynia
Event date
Jun 24, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—