-- | It's easy to tell if a point is within a cube; just make sure
-- that it falls on the proper side of each of the cube's faces.
- contains_point c p
- | (x_coord p) < (xmin c) = False
- | (x_coord p) > (xmax c) = False
- | (y_coord p) < (ymin c) = False
- | (y_coord p) > (ymax c) = False
- | (z_coord p) < (zmin c) = False
- | (z_coord p) > (zmax c) = False
+ contains_point c (x, y, z)
+ | x < (xmin c) = False
+ | x > (xmax c) = False
+ | y < (ymin c) = False
+ | y > (ymax c) = False
+ | z < (zmin c) = False
+ | z > (zmax c) = False
| otherwise = True
v1' = center (back_face c)
v2' = Face.v0 (back_face c)
v3' = Face.v1 (back_face c)
- fv' = rotate cwy $ rotate cwy $ (Tetrahedron.fv (tetrahedron0 c))
+ fv' = rotate cwy $ rotate cwy $ Tetrahedron.fv (tetrahedron0 c)
tetrahedron9 :: Cube -> Tetrahedron
tetrahedron9 c =
$ Tetrahedron.fv (tetrahedron0 c)
-tetrahedrons :: Cube -> [Tetrahedron]
-tetrahedrons c =
+tetrahedra :: Cube -> [Tetrahedron]
+tetrahedra c =
[tetrahedron0 c,
tetrahedron1 c,
tetrahedron2 c,
filter contains_our_point all_tetrahedra
where
contains_our_point = flip contains_point p
- all_tetrahedra = tetrahedrons c
+ all_tetrahedra = tetrahedra c