[Webinar] Learn how to a build a cloud-first strategyRegister Now

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 257
  • Last Modified:

Optimal problem

Hi experts,
I'm facing with a problem below: I have a rectangular plank and a few of pieces of paper. I stick these pieces of paper on the plank and cut the plank following these pieces. How can I find out a way to stick the pieces on the plank so that the remainder of the plank is optimal.
Who can tell me some books or some components that help me to resolve this problem?
Thanks.
0
rock2003
Asked:
rock2003
1 Solution
 
mmusanteCommented:
Take a look at his link ...
http://matheron.uv.es/investigar/tr01-04.pdf
hope can help you ...
0
 
MistobaanCommented:
The first place to look is : http://www.cs.sunysb.edu/~algorith
Maybe is usefull: http://www.cs.sunysb.edu/~algorith/files/polygon-partitioning.shtml
But I think that your one is a kind of "Hard Problem" also know as NP. It seems like a Bin-packing ( also know as Knapsack problem ) but with areas instead of weight, plus shape matching...
you can find some topics about this kind of problem on :
http://www.ifors.ms.unimelb.edu.au/tutorial/knapsack/

0
 
kumvjuecCommented:
Can the paper pieces be of any shape? irregular..??
0
 
rock2003Author Commented:
Yes, kumvjuec. The paper pieces can be any shape (rectangle, triangle, circle...).
0
 
mmusanteCommented:
A sub-optimal solution could be aproximate your shapes with their bounding-box ...

Have you already choosen a cost-function to evaluate the godness of your pieces placing?
0

Featured Post

Free Tool: Site Down Detector

Helpful to verify reports of your own downtime, or to double check a downed website you are trying to access.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now