• Status: Solved
• Priority: Medium
• Security: Public
• Views: 259

# 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
1 Solution

Commented:
Take a look at his link ...
http://matheron.uv.es/investigar/tr01-04.pdf
0

Commented:
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...
http://www.ifors.ms.unimelb.edu.au/tutorial/knapsack/

0

Commented:
Can the paper pieces be of any shape? irregular..??
0

Author Commented:
Yes, kumvjuec. The paper pieces can be any shape (rectangle, triangle, circle...).
0

Commented:
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
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.