p-hughes/Dirty_business — pull request #7 by sebastian-c (2012-08-22 00:10:47+00:00)
Title: New convex hull algorithm

I've included a new convex hull algorithm script. Basically, it takes every pair of dimensions and performs a convex hull on those, then takes all the unique points produced by those hulls.

I'm thinking that in theory these points should be the furthest points from each other on the hull. Furthermore, it's fast. Snap your fingers sort of fast. I've tested it with an array of random numbers of the same dimensions as your data.

I've also removed some files which I don't think relate the the soil portion of the project or are obsolete. Note that these will not be removed from the repository, just from the commits they are removed onwards. You can always go back an retrieve them.

If you think the hull algorithm is good enough, I'll turn it into a proper function. I might add a feature so you can choose how many columns it takes at a time. 1 at a time - `min`/`max`. 2 at a time - `chull`, 3 or more - `qhull`.