On Mon, 13 Jan 1997, Ilkka Tapio Ikonen wrote:
> in layers). Program will read part STL files and find a good packing for them.
> Meaning, it tries to pack them as tightly as possible without part
> or build envelope intersections. This program is meant to be a tool for human operator
Dear Ilkka,
That's a great idea. Let me ask, do you expect to be able to prove
mathematically that you have obtained the tightest possible packing
for a given collection? What limitations on shape would allow you to
provide such a mathematical proof?
Best regards,
Marshall Burns
marshall@ennex.com
*************************************************************************
** Ennex(TM) Fabrication Technologies **
** FABRICATING THE FUTURE (TM) **
******* *******
** 10911 Weyburn Avenue, Suite 332, Los Angeles, U.S.A. 90024 **
** Phone: +1 (310) 824-8700 Fax: +1 (310) 824-5185 **
** E-Mail: fabbers@ennex.com **
*************************************************************************
This archive was generated by hypermail 2.1.2 : Tue Jun 05 2001 - 22:39:13 EEST