)
import Numeric.LinearAlgebra hiding (i, scale)
import Prelude hiding (LT)
-import Test.QuickCheck (Arbitrary(..), Gen, choose)
+import Test.QuickCheck (Arbitrary(..), Gen)
import Cardinal
import Comparisons (nearly_ge)
v1 :: Point,
v2 :: Point,
v3 :: Point,
- precomputed_volume :: Double,
-
- -- | Between 0 and 23; used to quickly determine which
- -- tetrahedron I am in the parent 'Cube' without
- -- having to compare them all.
- number :: Int
+ precomputed_volume :: Double
}
deriving (Eq)
rnd_v2 <- arbitrary :: Gen Point
rnd_v3 <- arbitrary :: Gen Point
rnd_fv <- arbitrary :: Gen FunctionValues
- rnd_no <- choose (0,23)
-- We can't assign an incorrect precomputed volume,
-- so we have to calculate the correct one here.
- let t' = Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 0 rnd_no
+ let t' = Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 0
let vol = volume t'
- return (Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 vol rnd_no)
+ return (Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 vol)
instance Show Tetrahedron where
show t = "Tetrahedron:\n" ++
- " no: " ++ (show (number t)) ++ "\n" ++
" fv: " ++ (show (fv t)) ++ "\n" ++
" v0: " ++ (show (v0 t)) ++ "\n" ++
" v1: " ++ (show (v1 t)) ++ "\n" ++
instance ThreeDimensional Tetrahedron where
- center (Tetrahedron _ v0' v1' v2' v3' _ _) =
+ center (Tetrahedron _ v0' v1' v2' v3' _) =
(v0' + v1' + v2' + v3') `scale` (1/4)
contains_point t p =