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

Add graph-based linejoin #10

Draft
wants to merge 1 commit into
base: main
Choose a base branch
from
Draft

Add graph-based linejoin #10

wants to merge 1 commit into from

Conversation

ScottWales
Copy link

Version of linejoin using Scipy's graph tools to find paths.

Creates a graph of the input points weighted by distance, then find minimum spanning subtrees of that graph

@ScottWales
Copy link
Author

Comparison of linejoin_graph (black dots) vs. linejoin (red lines). Smooth fronts are pretty much the same, there are differences in squiggly fronts (possibly these are marginal detections?)

comparison

linejoin_graph completed in ~ 200 ms, linejoin in 1 min 25 s for a 500x500 subset of ERA5.

@ScottWales
Copy link
Author

Possible enhancements

  • Measure distances in x-y-z space instead of lat-lon
  • Return output as a geopandas table

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

Successfully merging this pull request may close these issues.

1 participant