X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FGrid.hs;h=3d636b53a780f465b515c6e45f8ee53b6e7f10ba;hb=40d8f23c7abd648e1e147c7457244c31dc9b20e4;hp=e67ac764022a82ab974593395482ec4d6cfa81fc;hpb=89b8b6e94fcc944a1f4611811265f3c6217af850;p=spline3.git

diff --git a/src/Grid.hs b/src/Grid.hs
index e67ac76..3d636b5 100644
--- a/src/Grid.hs
+++ b/src/Grid.hs
@@ -1,25 +1,40 @@
 -- | The Grid module just contains the Grid type and two constructors
 --   for it. We hide the main Grid constructor because we don't want
 --   to allow instantiation of a grid with h <= 0.
-module Grid (empty_grid,
-             function_values,
-             Grid,
-             h,
-             make_grid)
+module Grid
 where
 
+import Test.QuickCheck (Arbitrary(..), Gen, Positive(..))
+
+import Cube (Cube(Cube), find_containing_tetrahedra)
+import FunctionValues
+import Misc (flatten)
+import Point (Point)
+import Tetrahedron (polynomial)
+import ThreeDimensional (contains_point)
+import Values (Values3D, dims, empty3d, zoom_shape)
+
+import qualified Data.Array.Repa as R
+
 -- | 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
 --   function at the grid points, which are distance h from one
 --   another in each direction (x,y,z).
 data Grid = Grid { h :: Double, -- MUST BE GREATER THAN ZERO!
-                   function_values :: [[[Double]]] }
+                   function_values :: Values3D }
           deriving (Eq, Show)
 
 
+instance Arbitrary Grid where
+    arbitrary = do
+      (Positive h') <- arbitrary :: Gen (Positive Double)
+      fvs <- arbitrary :: Gen Values3D
+      return (make_grid h' fvs)
+
+
 -- | The constructor that we want people to use. If we're passed a
 --   non-positive grid size, we throw an error.
-make_grid :: Double -> [[[Double]]] -> Grid
+make_grid :: Double -> Values3D -> Grid
 make_grid grid_size values
     | grid_size <= 0 = error "grid size must be positive"
     | otherwise = Grid grid_size values
@@ -27,4 +42,65 @@ make_grid grid_size values
 
 -- | Creates an empty grid with grid size 1.
 empty_grid :: Grid
-empty_grid = Grid 1 [[[]]]
+empty_grid = Grid 1 empty3d
+
+
+-- | Returns a three-dimensional list of cubes centered on the grid
+--   points of g with the appropriate 'FunctionValues'.
+cubes :: Grid -> [[[Cube]]]
+cubes g
+    | xsize == 0 || ysize == 0 || zsize == 0 = [[[]]]
+    | otherwise =
+        [[[ Cube (h g) i j k (make_values fvs i j k) | i <- [0..xsize]]
+              | j <- [0..ysize]]
+              | k <- [0..zsize]]
+    where
+      fvs = function_values g
+      (xsize, ysize, zsize) = dims fvs
+
+
+-- | Takes a grid and a position as an argument and returns the cube
+--   centered on that position. If there is no cube there (i.e. the
+--   position is outside of the grid), it will return 'Nothing'.
+cube_at :: Grid -> Int -> Int -> Int -> Maybe Cube
+cube_at g i j k
+    | i < 0 = Nothing
+    | j < 0 = Nothing
+    | k < 0 = Nothing
+    | i >= length (cubes g) = Nothing
+    | 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
+
+
+zoom :: Grid -> Int -> Values3D
+zoom g scale_factor
+    | xsize == 0 || ysize == 0 || zsize == 0 = empty3d
+    | otherwise =
+        R.traverse arr transExtent (\_ -> newlookup)
+          where
+            fvs = function_values g
+            (xsize, ysize, zsize) = dims fvs
+            arr = fvs
+            transExtent = zoom_shape scale_factor
+            newlookup :: R.DIM3 -> Double
+            newlookup (R.Z R.:. i R.:. j R.:. k) =
+                f p
+                  where
+                    i' = fromIntegral i
+                    j' = fromIntegral j
+                    k' = fromIntegral k
+                    p = (i', j', k') :: Point
+                    c = head (find_containing_cubes g p)
+                    t = head (find_containing_tetrahedra c p)
+                    f = polynomial t