Do anyone know of any algorithm or library that can triangulate a convex hull that is defined by a set of planes?
The libraries I’ve seen all represents the hull as a set of points. Some have to ability to get the planes, but none that I’ve seen can generate points from a set of planes.
There’s a naïve O(n^4) algorithm, but you really don’t want that.
JBullet has conversion methods for both ways. See the GeometryUtil class. It’s the naive approach though (works fine for small number of planes/points).
It also has polygon approximation of any convex shape (including convex hulls). See the ShapeHull class.
Thank you! This was exactly what I was looking for.