nearest neighbor - k-d tree - wikipedia proof.

Posted by user123930 on Stack Overflow See other posts from Stack Overflow or by user123930
Published on 2009-10-26T20:58:36Z Indexed on 2010/03/15 4:29 UTC
Read the original article Hit count: 374

Filed under:

nearest-neighbor

|

kdtree

On the wikipedia entry for k-d trees, an algorithm is presented for doing a nearest neighbor search on a k-d tree. What I don't understand is the explanation of step 3.2. How do you know there isn't a closer point just because the difference between the splitting coordinate of the search point and the current node is greater than the difference between the splitting coordinate of the search point and the current best?

© Stack Overflow or respective owner

Related posts about nearest-neighbor

nearest neighbor - k-d tree - wikipedia proof.

as seen on Stack Overflow - Search for 'Stack Overflow'
On the wikipedia entry for k-d trees, an algorithm is presented for doing a nearest neighbor search on a k-d tree. What I don't understand is the explanation of step 3.2. How do you know there isn't a closer point just because the difference between the splitting coordinate of the search point and… >>> More
Traveling Salesman - Nearest Neighbor vs Genetic DEATHMATCH

as seen on Stack Overflow - Search for 'Stack Overflow'
Over the last few days I have noted a few web sites that demonstrated TS solution using genetic algorithms. I am looking for your opinion which is better for this particular problem. Heuristics vs Genetic. By better, I mean will yield a shorter/lower cost path. Explain why you feel the way that… >>> More
Stata Nearest neighbor of percentile

as seen on Stack Overflow - Search for 'Stack Overflow'
This has probably already been answered, but I must just be searching for the wrong terms. Suppose I am using the built in Stata data set auto: sysuse auto, clear and say for example I am working with 1 independent and 1 dependent variable and I want to essentially compress down to the IQR elements… >>> More
PHP image resize using nearest-neighbor interpolation?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a 16x16 sprite in PNG or GIF image format, and would like to display it on a website at 64 x 64 in all its pixelated glory. In Firefox 3.6+ and IE I can do this easily with CSS using image-rendering and -ms-interpolation-mode, but as this doesn't work in all browsers I'd like to resize the… >>> More
How can I extend this SQL query to find the k nearest neighbors?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a database full of two-dimensional data - points on a map. Each record has a field of the geometry type. What I need to be able to do is pass a point to a stored procedure which returns the k nearest points (k would also be passed to the sproc, but that's easy). I've found a query at http://blogs… >>> More

Related posts about kdtree

library for octree or kdtree

as seen on Game Development - Search for 'Game Development'
Are there any robust performant libraries for indexing objects? It would need frustum culling and visiting objects hit by a ray as well as neighbourhood searches. I can find lots of articles showing the math for the component parts, often as algebra rather than simple C, but nothing that puts it… >>> More
Confused about definition of a 'median' when constructing a kd-Tree

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi there. Im trying to build a kd-tree for searching through a set of points, but am getting confused about the use of 'median' in the wikipedia article. For ease of use, the wikipedia article states the pseudo-code of kd-tree construction as: function kdtree (list of points pointList, int depth) { … >>> More
Is it possible to find the KNN for a node that is *IN* the KD-tree?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi there, Trying to create a KNN search using a KD-tree. I can form the KD-tree fine (or at least, I believe I can!). My problem is that I am searching to find the closest 2 neighbours to every point in a list of points. So, is there a method to find the K nearest neighbours to a point using a… >>> More
C++: looking for thread based a parallel kd tree library.

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, Are there some implementation for KD-Tree on shared memory machines? thanks Arman. >>> More
nearest neighbor - k-d tree - wikipedia proof.

as seen on Stack Overflow - Search for 'Stack Overflow'
On the wikipedia entry for k-d trees, an algorithm is presented for doing a nearest neighbor search on a k-d tree. What I don't understand is the explanation of step 3.2. How do you know there isn't a closer point just because the difference between the splitting coordinate of the search point and… >>> More