FAST CONVEX HULL ALGORITHM (Scripts) Publisher's description
from Luigi Giaccari
Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points.
Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the call to unique function which can be very slow for large models .
Algorithm is very simple, itвЂ™s based on cross product.
It is brand new, so please let me know if something goes wrong!
Since I received comments about different timings this version includes a speed test to compare ConvHull2D to the native matlab convhull. There is also a graphical explanation on how the algorithm works.
ConvHull2D returns indices into the X and Y vectors of the points on the convex hull.
System Requirements:Should work on all platforms
Program Release Status: Major Update
Program Install Support: Install and Uninstall