N-dimensional Convex Hull: Quicker Hull Algorithm A Matlab algorithm that can reduce the number of points before sending them to the mex routine.
Download

N-dimensional Convex Hull: Quicker Hull Algorithm Ranking & Summary

N-dimensional Convex Hull: Quicker Hull Algorithm Tags

Algorithm matlab Matlab Algorithm Matlab Addon Quicker Hull Algorithm Quicker Hull

N-dimensional Convex Hull: Quicker Hull Algorithm Description

The Matlab convhulln is a gateway to the quickhull algorithm. 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. N-dimensional Convex Hull: Quicker Hull Algorithm is 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.

N-dimensional Convex Hull: Quicker Hull Algorithm Related Software