From 5ea933a5ca41dca110bc7db142688a30fdbb8e9c Mon Sep 17 00:00:00 2001 From: Greg Borenstein Date: Sun, 3 Jun 2012 21:24:09 -0400 Subject: [PATCH] add readme --- README.md | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 README.md 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