You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I was wondering how to compute the Great Circle distance between points if my input are two sets of points, instead of a set of points and a point (as is expected by spDistsN1() and spDists()).
To be clear, if my two sets of points are saved in two matrices m1 and m2, I'd like to have an efficient solution, i.e., avoiding wrapping spDistsN1() in a loop and doing spDistsN1(m1[i, ], m2[i, ]) at each iteration. I'd rather have this iteration done internally at C code level. Is this available from {sp} anyhow?
The text was updated successfully, but these errors were encountered:
ramiromagno
changed the title
Vectorised version sp::spDistsN1?
Vectorised version of sp::spDistsN1() over pts and pt?
Feb 11, 2022
Hi,
Thanks for developing such a nice package.
I was wondering how to compute the Great Circle distance between points if my input are two sets of points, instead of a set of points and a point (as is expected by
spDistsN1()
andspDists()
).To be clear, if my two sets of points are saved in two matrices
m1
andm2
, I'd like to have an efficient solution, i.e., avoiding wrappingspDistsN1()
in a loop and doingspDistsN1(m1[i, ], m2[i, ])
at each iteration. I'd rather have this iteration done internally at C code level. Is this available from{sp}
anyhow?The text was updated successfully, but these errors were encountered: