GitHub / tenindra / RN-kNN-Exp
This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tenindra%2FRN-kNN-Exp
PURL: pkg:github/tenindra/RN-kNN-Exp
Stars: 9
Forks: 7
Open issues: 0
License: agpl-3.0
Language: C++
Size: 394 KB
Dependencies parsed at: Pending
Created at: over 9 years ago
Updated at: over 1 year ago
Pushed at: over 1 year ago
Last synced at: about 1 year ago
Topics: a-star-search, euclidean-distance, k-nearest-neighbors, points-of-interest, road-network, shortest-paths