Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Vectorised version of sp::spDistsN1() over pts and pt? #113

Open
ramiromagno opened this issue Feb 11, 2022 · 0 comments
Open

Vectorised version of sp::spDistsN1() over pts and pt? #113

ramiromagno opened this issue Feb 11, 2022 · 0 comments

Comments

@ramiromagno
Copy link

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() 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?

@ramiromagno ramiromagno changed the title Vectorised version sp::spDistsN1? Vectorised version of sp::spDistsN1() over pts and pt? Feb 11, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant