diff --git a/doc/autobuild.py b/doc/autobuild.py
index 2f1658095..362816dcd 100644
--- a/doc/autobuild.py
+++ b/doc/autobuild.py
@@ -37,6 +37,7 @@ import kivy.core.text.markup
 import kivy.core.video
 import kivy.core.window
 import kivy.ext
+import kivy.geometry
 import kivy.graphics
 import kivy.graphics.shader
 import kivy.animation
diff --git a/kivy/geometry.py b/kivy/geometry.py
index 3d6b3913c..3134b9788 100644
--- a/kivy/geometry.py
+++ b/kivy/geometry.py
@@ -54,7 +54,8 @@ def minimum_bounding_circle(points):
 
     For a description of the problem being solved, see:
         http://en.wikipedia.org/wiki/Smallest_circle_problem
-    The function uses Applet's Algorithm, the runtime is O(h^3 *n),
+
+    The function uses Applet's Algorithm, the runtime is O\(h^3, \*n\),
     where h is the number of points in the convex hull of the set of points.
     **But** it runs in linear time in almost all real world cases.
     See: http://tinyurl.com/6e4n5yb