diff --git a/server/map/__pycache__/get_relation.cpython-311.pyc b/server/map/__pycache__/get_relation.cpython-311.pyc
index d8abc88c3545f0521eb620e7ff3bbd18cdadcf63..2d37bcfac8dc8206bf7c1e617e77af1be98c6fc4 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 ae404a2c66752e83e59bd89caf2d11d03441c07c..197d3b17fe6a687e4722841d481319c5d9cdc6c8 100644
--- a/server/map/get_relation.py
+++ b/server/map/get_relation.py
@@ -182,7 +182,7 @@ def populate_new_edge(split_shape, remaining_shape, cell_size: float, divisor: f
         # Create list of corners
         corners = []
 
-        divisor_range = ((divisor - 0.01),(divisor + 0.01))
+        divisor_range = ((divisor - 0.1),(divisor + 0.1)) # Define tolerance
 
         # Find all corners of split shape. Corner = point that intersects divisor
         for point in split_shape: