Imhotep@cup.portal.com (STEVE CARL MAHER) (11/07/88)
I have a question about closed convel polyhedral solids. If I am given two arbitrary solids whose surface consists of convex polyhedra, and if the solids themselves are convex, does anyone know of an algorithm for finding a separatin plane? All the algorithms that I have been able to devise are of order N^3. It seems to me that the convexity is such a strong restriction that an algorithm of lower order should exist. Thanks in advance for any possible help with this.