X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FGrid.hs;h=e4f3d62b9a661df068ec80e837fc9d7289734ea4;hb=f3d720f107f74b07a5f9f96e6a7c9c7a9022aeb0;hp=893fe5c360d3f39c73a99ebab26d1320fd798815;hpb=89a8f8f3728c6e8730a37304708312b67bc23274;p=spline3.git diff --git a/src/Grid.hs b/src/Grid.hs index 893fe5c..e4f3d62 100644 --- a/src/Grid.hs +++ b/src/Grid.hs @@ -27,9 +27,8 @@ import Cube (Cube(Cube), import Examples import FunctionValues import Point (Point) -import PolynomialArray (PolynomialArray) import ScaleFactor -import Tetrahedron (Tetrahedron, c, number, polynomial, v0, v1, v2, v3) +import Tetrahedron (Tetrahedron, c, polynomial, v0, v1, v2, v3) import ThreeDimensional import Values (Values3D, dims, empty3d, zoom_shape) @@ -72,8 +71,9 @@ cubes delta fvs j <- [0..ymax], k <- [0..zmax], let tet_vol = (1/24)*(delta^(3::Int)), + let fvs' = make_values fvs i j k, let cube_ijk = - Cube delta i j k (make_values fvs i j k) tet_vol] + Cube delta i j k fvs' tet_vol] where xmax = xsize - 1 ymax = ysize - 1 @@ -133,15 +133,15 @@ find_containing_cube g p = {-# INLINE zoom_lookup #-} -zoom_lookup :: Grid -> PolynomialArray -> ScaleFactor -> a -> (R.DIM3 -> Double) -zoom_lookup g polynomials scale_factor _ = - zoom_result g polynomials scale_factor +zoom_lookup :: Grid -> ScaleFactor -> a -> (R.DIM3 -> Double) +zoom_lookup g scale_factor _ = + zoom_result g scale_factor {-# INLINE zoom_result #-} -zoom_result :: Grid -> PolynomialArray -> ScaleFactor -> R.DIM3 -> Double -zoom_result g polynomials (sfx, sfy, sfz) (R.Z R.:. m R.:. n R.:. o) = - (polynomials ! (i, j, k, (number t))) p +zoom_result :: Grid -> ScaleFactor -> R.DIM3 -> Double +zoom_result g (sfx, sfy, sfz) (R.Z R.:. m R.:. n R.:. o) = + f p where offset = (h g)/2 m' = (fromIntegral m) / (fromIntegral sfx) - offset @@ -149,16 +149,14 @@ zoom_result g polynomials (sfx, sfy, sfz) (R.Z R.:. m R.:. n R.:. o) = o' = (fromIntegral o) / (fromIntegral sfz) - offset p = (m', n', o') :: Point cube = find_containing_cube g p - -- Figure out i,j,k without importing those functions. - Cube _ i j k _ _ = cube t = find_containing_tetrahedron cube p - + f = polynomial t -zoom :: Grid -> PolynomialArray -> ScaleFactor -> Values3D -zoom g polynomials scale_factor +zoom :: Grid -> ScaleFactor -> Values3D +zoom g scale_factor | xsize == 0 || ysize == 0 || zsize == 0 = empty3d | otherwise = - R.force $ R.traverse arr transExtent (zoom_lookup g polynomials scale_factor) + R.force $ R.unsafeTraverse arr transExtent (zoom_lookup g scale_factor) where arr = function_values g (xsize, ysize, zsize) = dims arr