Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem

Title
Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem
Authors
Keywords
Component-based nearest neighbor search, 3D Euclidean minimum spanning tree, GPU parallel 3D EMST, GPU breadth first search, GPU union-find, GPU link list, Decentralized control
Journal
APPLIED SOFT COMPUTING
Volume 100, Issue -, Pages 106928
Publisher
Elsevier BV
Online
2020-11-29
DOI
10.1016/j.asoc.2020.106928

Ask authors/readers for more resources

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started