Dan Johnson wrote:

> 
> I think you are right.  I don't think it would be too hard to make a
> macro to do that either.  Now I guess the next thing is to find the
> smallest oriented bounding box, and see which one is smaller.  If one is
> always smaller.
> 

Do bounding boxes with sheer work?  If they do I think you can get even
closer.  Then you could define it as a cube, and a matrix.  I think that
in an ideal bounding box all vertices would also be vertices of the
inclosed tetrahedron.  

Dan Johnson 
http://www.livejournal.com/userinfo.bml?user=teknotus
http://www.geocities.com/zapob

Post a reply to this message