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
The convex hull is probably the most common approach - its goal is to create the smallest polygon that contains all points from a given list. The scipy.spatial package provides this algorithm (https://docs.scipy.org/doc/scipy-0.19.0/reference/generated/scipy.spatial.ConvexHull.html, accessed 29.12.2018).
49
49
50
50
```{code-cell} ipython3
51
-
# Function that takes a map and a list of points (LON,LAT tupels) and
51
+
# Function that takes a map and a list of points (LON,LAT tuples) and
52
52
# returns a map with the convex hull polygon from the points as a new layer
0 commit comments