Simplify analyser machines somewhat

src/Geometry/ConvexPoly.hs

@@ -19,7 +19,6 @@ import Data.Aeson
 import Data.Aeson.TH
 import Geometry.Data
 import Geometry.Intersect
-import Geometry.LHS
 import Geometry.Polygon
 import Geometry.Vector
 
@@ -59,8 +58,8 @@ convexPolysOverlap cp1 cp2 =
 -- | Test whether two polygons intersect or if one is contained in the other.
 polyPointsOverlap :: [Point2] -> [Point2] -> Bool
 polyPointsOverlap (p : ps) (q : qs) =
-    pointInPolygon p (q : qs)
-        || pointInPolygon q (p : ps)
+    pointInPoly p (q : qs)
+        || pointInPoly q (p : ps)
         || polyPointsIntersect (p : ps) (q : qs)
 polyPointsOverlap _ _ = False