module Tetrahedron
where
+import qualified Data.Vector as V (
+ singleton,
+ snoc,
+ sum
+ )
import Numeric.LinearAlgebra hiding (i, scale)
import Prelude hiding (LT)
-import Test.QuickCheck (Arbitrary(..), Gen, Positive(..))
+import Test.QuickCheck (Arbitrary(..), Gen, choose)
import Cardinal
import Comparisons (nearly_ge)
import RealFunction
import ThreeDimensional
-data Tetrahedron = Tetrahedron { fv :: FunctionValues,
- v0 :: Point,
- v1 :: Point,
- v2 :: Point,
- v3 :: Point,
- precomputed_volume :: Double }
- deriving (Eq)
+data Tetrahedron =
+ Tetrahedron { fv :: FunctionValues,
+ v0 :: Point,
+ 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
+ }
+ deriving (Eq)
instance Arbitrary Tetrahedron where
rnd_v2 <- arbitrary :: Gen Point
rnd_v3 <- arbitrary :: Gen Point
rnd_fv <- arbitrary :: Gen FunctionValues
- (Positive rnd_vol) <- arbitrary :: Gen (Positive Double)
- return (Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 rnd_vol)
+ 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 vol = volume t'
+ return (Tetrahedron rnd_fv rnd_v0 rnd_v1 rnd_v2 rnd_v3 vol rnd_no)
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 t = ((v0 t) + (v1 t) + (v2 t) + (v3 t)) `scale` (1/4)
+ center (Tetrahedron _ v0' v1' v2' v3' _ _) =
+ (v0' + v1' + v2' + v3') `scale` (1/4)
+
contains_point t p =
b0_unscaled `nearly_ge` 0 &&
b1_unscaled `nearly_ge` 0 &&
polynomial :: Tetrahedron -> (RealFunction Point)
polynomial t =
- sum [ (c t i j k l) `cmult` (beta t i j k l) | i <- [0..3],
- j <- [0..3],
- k <- [0..3],
- l <- [0..3],
- i + j + k + l == 3]
+ V.sum $ V.singleton ((c t 0 0 0 3) `cmult` (beta t 0 0 0 3)) `V.snoc`
+ ((c t 0 0 1 2) `cmult` (beta t 0 0 1 2)) `V.snoc`
+ ((c t 0 0 2 1) `cmult` (beta t 0 0 2 1)) `V.snoc`
+ ((c t 0 0 3 0) `cmult` (beta t 0 0 3 0)) `V.snoc`
+ ((c t 0 1 0 2) `cmult` (beta t 0 1 0 2)) `V.snoc`
+ ((c t 0 1 1 1) `cmult` (beta t 0 1 1 1)) `V.snoc`
+ ((c t 0 1 2 0) `cmult` (beta t 0 1 2 0)) `V.snoc`
+ ((c t 0 2 0 1) `cmult` (beta t 0 2 0 1)) `V.snoc`
+ ((c t 0 2 1 0) `cmult` (beta t 0 2 1 0)) `V.snoc`
+ ((c t 0 3 0 0) `cmult` (beta t 0 3 0 0)) `V.snoc`
+ ((c t 1 0 0 2) `cmult` (beta t 1 0 0 2)) `V.snoc`
+ ((c t 1 0 1 1) `cmult` (beta t 1 0 1 1)) `V.snoc`
+ ((c t 1 0 2 0) `cmult` (beta t 1 0 2 0)) `V.snoc`
+ ((c t 1 1 0 1) `cmult` (beta t 1 1 0 1)) `V.snoc`
+ ((c t 1 1 1 0) `cmult` (beta t 1 1 1 0)) `V.snoc`
+ ((c t 1 2 0 0) `cmult` (beta t 1 2 0 0)) `V.snoc`
+ ((c t 2 0 0 1) `cmult` (beta t 2 0 0 1)) `V.snoc`
+ ((c t 2 0 1 0) `cmult` (beta t 2 0 1 0)) `V.snoc`
+ ((c t 2 1 0 0) `cmult` (beta t 2 1 0 0)) `V.snoc`
+ ((c t 3 0 0 0) `cmult` (beta t 3 0 0 0))
-- | Returns the domain point of t with indices i,j,k,l.