0
$\begingroup$

I have some background in 2D computational geometry and understand how to find a convex hull in 2D. Now I'm looking at a set of vectors with 20-some components and want to find the convex hull on them.

I'm looking for an algorithm or even some kind of equivalence which would allow me to compute the convex boundaries of the set. I'm a bit out of my depth, so any insight would likely be valuable.

  • 0
    The four algorithms described on [the first page](http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html) the article links to generalize to higher dimensions. The generalizations for Gift Wrap and Divide & Conquer are perhaps not obvious, but the ones for Incremental and Quick Hull are rather straightforward; they're spelled out in [this lecture](http://www.cs.duke.edu/courses/fall05/cps234/notes/lecture04.pdf).2011-12-14

1 Answers 1

1

All I can - is to propose my own implementation of the Quickhull Algorithm written on C++. It works for any dimensionality and can be used for user-defined floating-point types.