diff --git a/README.md b/README.md
index f72e82ac6..a3294b983 100644
--- a/README.md
+++ b/README.md
@@ -88,7 +88,7 @@ algorithms for computing
   - worst case optimal $O(n\log n)$ time implementations of Graham
     scan and Divide and Conquer,
   - an output sensitive $O(nh)$ time Jarvis March, and
-  - a QuickHull implementation (which has worst case complexity $O(n^2)$)
+  - a QuickHull implementation (which has worst case complexity $O(n^2)$ )
 
   Furtheremore, an optimal linear time algorithm for when the points
   are the vertices of a convex polygon.
diff --git a/hgeometry-examples/duality/Main.hs b/hgeometry-examples/duality/Main.hs
index cdd323c1e..34f81cffd 100644
--- a/hgeometry-examples/duality/Main.hs
+++ b/hgeometry-examples/duality/Main.hs
@@ -146,8 +146,8 @@ instance Drawable (LineEQ R) where
   draw l = let maxP = Point2 large large
                minP = maxP&vector %~ negated
            in case l `intersect` Rectangle minP maxP of
-                Just (Line_x_Box_Segment s) -> draw s
-                _                           -> flip g_ []
+                Just (Line_x_Box_LineSegment s) -> draw s
+                _                               -> flip g_ []
 
 large = 100000