diff --git a/Graphics/Gloss/Algorithms/RayCast.hs b/Graphics/Gloss/Algorithms/RayCast.hs
--- a/Graphics/Gloss/Algorithms/RayCast.hs
+++ b/Graphics/Gloss/Algorithms/RayCast.hs
@@ -16,7 +16,7 @@
 -- | The quadtree contains cells of unit extent (NetHack style).
 --   Given a line segement (P1-P2) through the tree, get the cell 
 --   closest to P1 that intersects the segment, if any.
---   
+---
 --   TODO: This currently uses a naive algorithm. It just calls 
 --         `traceSegIntoCellularQuadTree` and sorts the results
 --         to get the one closest to P1. It'd be better to do a 
diff --git a/gloss-algorithms.cabal b/gloss-algorithms.cabal
--- a/gloss-algorithms.cabal
+++ b/gloss-algorithms.cabal
@@ -1,5 +1,5 @@
 Name:                gloss-algorithms
-Version:             1.9.4.1
+Version:             1.10.1.1
 License:             MIT
 License-file:        LICENSE
 Author:              Ben Lippmeier
@@ -25,7 +25,7 @@
         base       == 4.8.*,
         ghc-prim   == 0.4.*,
         containers == 0.5.*,
-        gloss      == 1.9.4.*
+        gloss      == 1.10.*
 
   ghc-options:
         -O2 -Wall