Path: utzoo!utgpu!attcan!uunet!portal!cup.portal.com!Imhotep
From: Imhotep@cup.portal.com (STEVE CARL MAHER)
Newsgroups: comp.graphics
Subject: Question about convex polyhedral solids
Message-ID: <11011@cup.portal.com>
Date: 7 Nov 88 05:11:46 GMT
Organization: The Portal System (TM)
Lines: 8

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.