From 30d192920b6ac521461de0cd54f597584dde9c77 Mon Sep 17 00:00:00 2001 From: Filipe Fernandes Date: Mon, 6 Nov 2023 13:59:37 -0300 Subject: [PATCH] fix typo --- docs/advanced_guide/polygons_from_list_of_points.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/advanced_guide/polygons_from_list_of_points.md b/docs/advanced_guide/polygons_from_list_of_points.md index 5b3984b51..e099c978c 100644 --- a/docs/advanced_guide/polygons_from_list_of_points.md +++ b/docs/advanced_guide/polygons_from_list_of_points.md @@ -48,7 +48,7 @@ def draw_points(map_object, list_of_points, layer_name, line_color, fill_color, 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). ```{code-cell} ipython3 -# Function that takes a map and a list of points (LON,LAT tupels) and +# Function that takes a map and a list of points (LON,LAT tuples) and # returns a map with the convex hull polygon from the points as a new layer