module Tests.Grid
where
-import Data.Maybe (fromJust)
import Test.HUnit
-import Test.QuickCheck
import Assertions
import Comparisons
import Examples
import FunctionValues (value_at)
import Grid
+import Point (Point)
import Tetrahedron
-
-
-instance Arbitrary Grid where
- arbitrary = do
- (Positive h') <- arbitrary :: Gen (Positive Double)
- fvs <- arbitrary :: Gen [[[Double]]]
- return (make_grid h' fvs)
+import ThreeDimensional
-- | Check the value of c0030 for tetrahedron0 belonging to the
assertAlmostEqual "c0030 is correct" (c t 0 0 3 0) (17/8)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0003 is correct" (c t 0 0 0 3) (27/8)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0021 is correct" (c t 0 0 2 1) (61/24)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0012 is correct" (c t 0 0 1 2) (71/24)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0120 is correct" (c t 0 1 2 0) (55/24)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0102 is correct" (c t 0 1 0 2) (73/24)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0111 is correct" (c t 0 1 1 1) (8/3)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0210 is correct" (c t 0 2 1 0) (29/12)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0201 is correct" (c t 0 2 0 1) (11/4)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c0300 is correct" (c t 0 3 0 0) (5/2)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1020 is correct" (c t 1 0 2 0) (8/3)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1002 is correct" (c t 1 0 0 2) (23/6)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1011 is correct" (c t 1 0 1 1) (13/4)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1110 is correct" (c t 1 1 1 0) (23/8)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1101 is correct" (c t 1 1 0 1) (27/8)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c1200 is correct" (c t 1 2 0 0) 3
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c2010 is correct" (c t 2 0 1 0) (10/3)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c2001 is correct" (c t 2 0 0 1) 4
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c2100 is correct" (c t 2 1 0 0) (7/2)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertAlmostEqual "c3000 is correct" (c t 3 0 0 0) 4
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertEqual "v0 is correct" (v0 t) (1, 1, 1)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertEqual "v1 is correct" (v1 t) (0.5, 1, 1)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertEqual "v2 is correct" (v2 t) (0.5, 0.5, 1.5)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
assertClose "v3 is correct" (v3 t) (0.5, 1.5, 1.5)
where
g = make_grid 1 trilinear
- cube = fromJust $ cube_at g 1 1 1
+ cube = cube_at g 1 1 1
t = tetrahedron0 cube
| i <- [0..2],
j <- [0..2],
k <- [0..2],
+ t <- tetrahedra c0,
+ let p = polynomial t,
let i' = fromIntegral i,
let j' = fromIntegral j,
let k' = fromIntegral k]
where
g = make_grid 1 trilinear
- c0 = fromJust $ cube_at g 1 1 1
- t0 = tetrahedron0 c0
- p = polynomial t0
+ c0 = cube_at g 1 1 1
test_zeros_reproduced :: Assertion
let k' = fromIntegral k]
where
g = make_grid 1 zeros
- c0 = fromJust $ cube_at g 1 1 1
+ c0 = cube_at g 1 1 1
t0 = tetrahedron0 c0
p = polynomial t0
+
+
+-- | Make sure we can reproduce a 9x9x9 trilinear from the 3x3x3 one.
+test_trilinear9x9x9_reproduced :: Assertion
+test_trilinear9x9x9_reproduced =
+ assertTrue "trilinear 9x9x9 is reproduced correctly" $
+ and [p (i', j', k') ~= value_at trilinear9x9x9 i j k
+ | i <- [0..8],
+ j <- [0..8],
+ k <- [0..8],
+ t <- tetrahedra c0,
+ let p = polynomial t,
+ let i' = (fromIntegral i) * 0.5,
+ let j' = (fromIntegral j) * 0.5,
+ let k' = (fromIntegral k) * 0.5]
+ where
+ g = make_grid 1 trilinear
+ c0 = cube_at g 1 1 1
+
+
+-- | The point 'p' in this test lies on the boundary of tetrahedra 12 and 15.
+-- However, the 'contains_point' test fails due to some numerical innacuracy.
+-- This bug should have been fixed by setting a positive tolerance level.
+--
+-- Example from before the fix:
+--
+-- > b0 (tetrahedron15 c) p
+-- -3.4694469519536365e-18
+--
+test_tetrahedra_collision_sensitivity :: Assertion
+test_tetrahedra_collision_sensitivity =
+ assertTrue "tetrahedron collision tests isn't too sensitive" $
+ contains_point t15 p
+ where
+ g = make_grid 1 naturals_1d
+ c = cube_at g 0 17 1
+ p = (0, 16.75, 0.5) :: Point
+ t15 = tetrahedron15 c