Hi Chiro,
Actually, in my problem, the set of points is static. It means that I have fixed known set of points in 4D. For example {0.125; 0.342; 0.9871; 0.7653} is a typical point in the set of some such 2000 points. Only the query point is dynamic. It means for each time instance I have to...
Hi everyone,
I am new to computational geometry. As part of my master thesis, I have to solve a popular nearest neighbor problem. My task is to search for a point in a set of some 2000 4-dimensional points which is closest to a given point in the sense of Euclidean distance.
After reading...