X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FCube.hs;h=1c654ffd72763010bbb56352022160f61a0257c6;hb=610d0f0af8a802c26d51231d6e2426a72e40fd2d;hp=32b4b652c4ceebf76f4837fd5ed6d1b2a4723cc0;hpb=35bc3798d28ed65ab970cf158082bf8d68e2c480;p=spline3.git

diff --git a/src/Cube.hs b/src/Cube.hs
index 32b4b65..1c654ff 100644
--- a/src/Cube.hs
+++ b/src/Cube.hs
@@ -655,8 +655,9 @@ find_containing_tetrahedron cube p =
           else
             back_right_down_tetrahedra cube
 
-    -- Use the dot product instead of 'distance' here to save a
-    -- sqrt(). So, "distances" below really means "distances squared."
+    -- Use the dot product instead of Euclidean distance here to save
+    -- a sqrt(). So, "distances" below really means "distances
+    -- squared."
     distances = V.map ((dot p) . center) candidates
     shortest_distance = V.minimum distances
     lucky_idx = V.findIndex