Top "Nearest-neighbor" questions

Nearest neighbors are points (or other objects) in close proximity to a given location in some multi-dimensional space, e.g. a plane.

how to find k-th nearest neighbor of a point in a set of point

I have a set of point (x,y) on a 2d plane. Given a point (x0,y0), and the number …

matlab nearest-neighbor
All k nearest neighbors in 2D, C++

I need to find for each point of the data set all its nearest neighbors. The data set contains approx. 10 …

c++ algorithm nearest-neighbor large-data
ERROR: subquery in FROM cannot refer to other relations of same query level

I'm working with PostgreSQL 9 and I want to find the nearest neighbor inside table RP for all tuples in RQ, …

sql postgresql subquery nearest-neighbor correlated-subquery
SQL efficient nearest neighbour query

I'm having trouble coming up with an efficient SQL query to handle the following situation: Assume we have a table …

sql nearest-neighbor
Quadtree Nearest Neighbour Algorithm

I have implemented a quadtree structure for n points as well as a method for returning an array of points …

algorithm geolocation nearest-neighbor quadtree
Identifying points with the smallest Euclidean distance

I have a collection of n dimensional points and I want to find which 2 are the closest. The best I …

python algorithm numpy nearest-neighbor euclidean-distance
Distance of point feature to nearest polygon in R

I working on a project at the moment, where I have a point feature -- the point feature includes a 142 …

r polygon distance point nearest-neighbor
How to efficiently find k-nearest neighbours in high-dimensional data?

So I have about 16,000 75-dimensional data points, and for each point I want to find its k nearest neighbours (using …

algorithm data-structures computational-geometry nearest-neighbor dimensionality-reduction
How do I traverse a KDTree to find k nearest neighbors?

This question concerns the implementation of KNN searching of KDTrees. Traversal of a KDTree to find a single best match (…

nearest-neighbor knn kdtree
How to find the nearest neighbors for latitude and longitude point on python?

Input: point = (lat, long) places = [(lat1, long1), (lat2, long2), ..., (latN, longN)] count = L Output: neighbors = subset of places close to …

python geolocation scipy nearest-neighbor kdtree