How do I determine if a polyhedron is convex?

Question

I'm looking for an efficient algorithm that determines if a polyhedron is convex.

I started by checking that the Euler characteristic is 2. And I'm also checking that every face is convex. But that still doesn't catch a lot of cases.

Answer 1

Check this out: http://liam.flookes.com/cs/geo/

Basically:

• pick a point within the polyhedron
• send a ray from that point to each face
• ensure that the ray only intersects the chosen face