diff --git a/Mapping/DistanceMap/distance_map.py b/Mapping/DistanceMap/distance_map.py
index 0f96c9e8c6..f50ed18308 100644
--- a/Mapping/DistanceMap/distance_map.py
+++ b/Mapping/DistanceMap/distance_map.py
@@ -122,12 +122,7 @@ def dt(d):
     Parameters
     ----------
     d : array_like
-        Input array containing the distances.
-
-    Returns:
-    --------
-    d : array_like
-        The transformed array with computed distances.
+        Input costs, overwritten in place with the squared distance transform.
     """
     v = np.zeros(len(d) + 1)
     z = np.zeros(len(d) + 1)
@@ -144,12 +139,14 @@ def dt(d):
         v[k] = q
         z[k] = s
         z[k + 1] = INF
+    # Keep the original parabola costs while overwriting the output in place.
+    costs = d.copy()
     k = 0
     for q in range(len(d)):
         while z[k + 1] < q:
             k = k + 1
         dx = q - v[k]
-        d[q] = dx * dx + d[int(v[k])]
+        d[q] = dx * dx + costs[int(v[k])]
 
 
 def main():
diff --git a/tests/test_distance_map.py b/tests/test_distance_map.py
index df6e394e2c..56cad546f3 100644
--- a/tests/test_distance_map.py
+++ b/tests/test_distance_map.py
@@ -1,5 +1,6 @@
 import conftest  # noqa
 import numpy as np
+import pytest
 from Mapping.DistanceMap import distance_map as m
 
 
@@ -114,5 +115,79 @@ def test_main():
     m.main()
 
 
+def test_dt_preserves_parabola_costs():
+    distances = np.array([0.0, 4.0, 9.0, 9.0])
+    assert m.dt(distances) is None
+    np.testing.assert_array_equal(distances, [0.0, 1.0, 4.0, 8.0])
+
+
+def test_dt_matches_brute_force():
+    rng = np.random.default_rng(0)
+    for size in range(1, 17):
+        for _ in range(10):
+            costs = rng.uniform(0.0, 30.0, size)
+            expected = [min((q - j) ** 2 + costs[j] for j in range(size))
+                        for q in range(size)]
+            distances = costs.copy()
+            m.dt(distances)
+            np.testing.assert_allclose(distances, expected)
+
+
+def test_dt_updates_strided_view():
+    values = np.array([[0.0, 10.0], [4.0, 20.0],
+                       [9.0, 30.0], [9.0, 40.0]])
+    m.dt(values[:, 0])
+    np.testing.assert_array_equal(values[:, 0], [0.0, 1.0, 4.0, 8.0])
+    np.testing.assert_array_equal(values[:, 1], [10.0, 20.0, 30.0, 40.0])
+
+
+def brute_force_udf(obstacles):
+    obstacle_indices = np.argwhere(obstacles)
+    return np.array([
+        min(np.sum((np.array(index) - obstacle) ** 2)
+            for obstacle in obstacle_indices) ** 0.5
+        for index in np.ndindex(obstacles.shape)
+    ]).reshape(obstacles.shape)
+
+
+def test_distance_fields_preserve_column_costs():
+    obstacles = np.array([[1, 0, 0, 0], [0, 0, 1, 0],
+                          [0, 0, 0, 1], [0, 0, 0, 1]])
+    expected = brute_force_udf(obstacles)
+    assert expected[3, 0] == np.sqrt(8)
+    np.testing.assert_allclose(m.compute_udf(obstacles), expected)
+    np.testing.assert_allclose(m.compute_sdf(obstacles),
+                               expected - brute_force_udf(obstacles == 0))
+
+
+@pytest.mark.parametrize("shape", [(1, 7), (7, 1), (3, 5), (5, 3), (7, 8)])
+def test_distance_fields_match_brute_force(shape):
+    rng = np.random.default_rng(0)
+    for _ in range(10):
+        obstacles = rng.integers(0, 2, size=shape).astype(bool)
+        obstacles.flat[0] = True
+        obstacles.flat[-1] = False
+        original = obstacles.copy()
+        expected_udf = brute_force_udf(obstacles)
+        expected_sdf = expected_udf - brute_force_udf(~obstacles)
+        np.testing.assert_allclose(m.compute_udf(obstacles), expected_udf)
+        np.testing.assert_allclose(m.compute_sdf(obstacles), expected_sdf)
+        np.testing.assert_allclose(m.compute_udf_scipy(obstacles), expected_udf)
+        np.testing.assert_allclose(m.compute_sdf_scipy(obstacles), expected_sdf)
+        np.testing.assert_array_equal(obstacles, original)
+
+
+@pytest.mark.parametrize("occupied", [False, True])
+@pytest.mark.parametrize("shape", [(1, 1), (1, 5), (5, 1), (3, 4)])
+def test_uniform_distance_fields(shape, occupied):
+    obstacles = np.full(shape, occupied)
+    expected_udf = 0.0 if occupied else np.sqrt(m.INF)
+    expected_sdf = -np.sqrt(m.INF) if occupied else np.sqrt(m.INF)
+    np.testing.assert_array_equal(m.compute_udf(obstacles),
+                                  np.full(shape, expected_udf))
+    np.testing.assert_array_equal(m.compute_sdf(obstacles),
+                                  np.full(shape, expected_sdf))
+
+
 if __name__ == "__main__":
     conftest.run_this_test(__file__)