N-DIMENSIONAL CONVEX HULL: QUICKER HULL ALGORITHM 1.0

The Matlab convhulln is a gateway to the quickhull algorithm ( see www.qhull.org ). In my opinion, one weak point of this mex routine is that it processes all the points without performing any preliminary filtering.In many cases it would be faster if only the point that can be part of the convhull were send to the quick hull algorithm.Here is proposed an algorithm that can reduce the number of points before sending them to the mex routine.For large models in dimensions lower than 6 the speed improvement can be even of several factors.Unfortunately filtering points costs time and for high dimensions becomes unadvantageous.But no problem in these cases the algorithm just switch to the normal convhulln.A test to compare performances is provided. Acknowledgments about bugs or incorrect timing are greatly appreciated.

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Algorithm,  Algorithmhere,  All The,  And For,  Be Even,  Bugs,  Can Be,  Compare Performances,  Faster,  Greatly,  Mex Routine,  Part,  Preliminary,  Sending,  Time,  Timing Greatly,  Unadvantageousbut
Users rating:	0/10