N-dimensional Convex Hull: Quicker Hull Algorithm
Time comparison between quicker and quick hull algorithm
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.
For any problem, bug, information or suggestion just contact me at:
Coming soon the how does it work section.
Download Now
Popularity: 100% [?]
Related Posts
Comments
2 Comments on N-dimensional Convex Hull: Quicker Hull Algorithm
-
tool on
Sat, 19th Dec 2009 13:36
-
name on
Tue, 4th May 2010 23:40
Tell me what you're thinking...
and oh, if you want a pic to show with your comment, go get a gravatar!
Include MATLAB code in your comment by doing the following:
<pre lang="MATLAB">
%insert code here
</pre>
Translator
Follow Us
Video Posts
