diff --git a/server/map/__pycache__/get_relation.cpython-311.pyc b/server/map/__pycache__/get_relation.cpython-311.pyc
index 2d37bcfac8dc8206bf7c1e617e77af1be98c6fc4..b60cf86f63fea40cec5c55d8ee98c439fd98b3da 100644
Binary files a/server/map/__pycache__/get_relation.cpython-311.pyc and b/server/map/__pycache__/get_relation.cpython-311.pyc differ
diff --git a/server/map/get_relation.py b/server/map/get_relation.py
index 197d3b17fe6a687e4722841d481319c5d9cdc6c8..4d32b06fa0c21e602b43acceefa5b50cb37b4e8c 100644
--- a/server/map/get_relation.py
+++ b/server/map/get_relation.py
@@ -206,7 +206,7 @@ def populate_new_edge(split_shape, remaining_shape, cell_size: float, divisor: f
         # Insert new points with cell_size spacing while starting_point is within bounds
         while starting_point < sorted_corners[-1].x:
             split_shape.insert(0, (starting_point, divisor))  # NB may have to add/subtract small offset of 0.00001
-            remaining_shape.insert(0, (starting_point, divisor))  # Prepend new point to shape
+            remaining_shape.insert(-1, (starting_point, divisor))  # Prepend new point to shape
             print("Hit point insertion")
 
             starting_point += cell_size