diff --git a/README.md b/README.md
new file mode 100644
index 0000000..b8cc0c4
--- /dev/null
+++ b/README.md
@@ -0,0 +1,7 @@
+== An Implementation of the Convex Hull Algorithm for Processing
+
+This sketch implements the Convex Hull Algorithm from [Computational Geometry by deBerg et al](http://www.amazon.com/Computational-Geometry-Algorithms-Applications-Edition/dp/3540656200/ideasfordozens-20). The algorithm takes a set of points and figures out which points beyond to the convex polygon that contains the full set. It does so in a slightly clever manner that is *O(nlogn)*. The code is well-commented.
+
+Video is available here:
+
+[vimeo.com/43366054](https://vimeo.com/43366054)
\ No newline at end of file