Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I have a dataset for which I need to find the K nearest neighbours, or all the neighbours within a distance d. The dataset has a custom distance defined but it is not an Euclidean distance.
I need to find for each point of the data set all its nearest neighbors. The data set contains approx. 10 million 2D points. The data are close to the grid, but do not form a precise grid...
I am trying to build KD Tree (static case). We assume points are sorted on both x and y coordinates. For even depth of recursion the set is split into two subsets with a vertical line going through m
So, I\'m implementing a KD-Tree to do a nearest neighbor search. I\'ve got the building the tree part working, but I don\'t 开发者_JAVA百科think I understand the search part completely.
I\'ve been tasked to find N clusters containing the most points for 开发者_JAVA百科a certain data set given that the clusters are bounded by a certain size. Currently, I am attempting to do this by pl
I have a database with 500,000 points in a 100 dimensional space, and I want to find the closest 2 points. How do I do it?
I would like to build an app that\'s going to give you the closest restaurant depending on your location. We\'ll have a database with all the POI corresponding to the restaurant and we\'ll get your lo
I have a sprite that animates using a sprite sheet. He is only 16x16, but I want to scale him up to around 64x64 in all its pixel-y goodness!
T开发者_开发百科hanks to those who\'ve answered my previous questions and gotten me this far. I have a table of about 25,000 vectors, each with 48 dimensions, with values ranging from 0-255.
加载中,请稍侯......