Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem
作者
关键词
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
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started