0
$\begingroup$

I have a point with spatial and temporal coordinates

x=(lonx,latx,timex)

and I would like to find the nearest neighbour (according to some metric) amongst these other points

y1 = c(lony1,laty1,timey1)
y2 = c(lony2,laty2,timey2)
...
yn = c(lonyn,latyn,timeyn)

Is there any nearest-neighbour algorithm that I can use?

Improve this question
$\endgroup$

2 Answers 2

Reset to default
1
$\begingroup$

The solution is to calculate the time when you can reach your neighbour's place and compare that time with its time. The only parameter is the speed.

Improve this answer
$\endgroup$
1
$\begingroup$

Yes.

Any metric index will work if you provide the metric.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.