import Cube (Cube(Cube))
import FunctionValues
+import Misc (flatten)
+import Point (Point)
+import ThreeDimensional (contains_point)
+
-- | Our problem is defined on a Grid. The grid size is given by the
-- positive number h. The function values are the values of the
where
fvs = function_values g
zsize = (length fvs) - 1
- ysize = (length $ head fvs) - 1
- xsize = (length $ head $ head fvs) - 1
+ ysize = length (head fvs) - 1
+ xsize = length (head $ head fvs) - 1
-- | Takes a grid and a position as an argument and returns the cube
| j >= length ((cubes g) !! i) = Nothing
| k >= length (((cubes g) !! i) !! j) = Nothing
| otherwise = Just $ (((cubes g) !! i) !! j) !! k
+
+
+-- | Takes a 'Grid', and returns all 'Cube's belonging to it that
+-- contain the given 'Point'.
+find_containing_cubes :: Grid -> Point -> [Cube]
+find_containing_cubes g p =
+ filter contains_our_point all_cubes
+ where
+ all_cubes = flatten $ cubes g
+ contains_our_point = flip contains_point p