Subject: CGAL users discussion list
List archive
- From: Arun Ramasamy <>
- To: "" <>
- Subject: [cgal-discuss] Packing non-overlapping cuboids
- Date: Tue, 1 Nov 2011 20:27:08 -0700 (PDT)
- Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com; h=X-YMail-OSG:Received:X-Mailer:Message-ID:Date:From:Reply-To:Subject:To:MIME-Version:Content-Type; b=GsLjdwWEe2W58M1N5IkHLwhEylSt3YvHWCu6seH9PSpu9oII1vDNTa88BdqrAgZWq2gu6kb42NI1+jv5SQn/H4qt6omwC6/qslbGVLxQrndlMrCFP/BJAvOQmMQNg8dVdgM76LwnlJrPGYBNUrS5af4lT2HDDBzlsLt4tIQ3W3c=;
HI All,
I'm looking for methods that will pack cuboids of varying sizes as tightly as possible. There's no limitation on the output size, just as long as the packing is tight. Orthogonal rotations are also allowed as well, if required. Can any of CGAL's algorithms be extended to support something like this. Also are you aware of any other library implementing a solution for this. I'm ok with approximate solutions as well.
Please let me know if you have any ideas/suggestions on this.
Thanks
arun
I'm looking for methods that will pack cuboids of varying sizes as tightly as possible. There's no limitation on the output size, just as long as the packing is tight. Orthogonal rotations are also allowed as well, if required. Can any of CGAL's algorithms be extended to support something like this. Also are you aware of any other library implementing a solution for this. I'm ok with approximate solutions as well.
Please let me know if you have any ideas/suggestions on this.
Thanks
arun
- [cgal-discuss] Packing non-overlapping cuboids, Arun Ramasamy, 11/02/2011
Archive powered by MHonArc 2.6.16.