Minimizing the area requirement by placing different polygon

Question

0.00/5 (No votes)

See more:

, +

Hi All

I am working on a project wherein i have to place rectangle, square, polygon in such a way so that area requirement will be minimum. Kindly suggest, is it possible in winform/WPF. If so, pl advice how to proceed ?

What I have tried:

Tried in excel solver, but drawing a picture of each items with fix dimension(length, breadth, height) and then minimizing the area requirement seems not possible in excel

Posted 19-Aug-20 6:22am

gmanishg

Updated 19-Aug-20 7:58am

Add a Solution

Comments

[no name] 19-Aug-20 12:45pm

Stack them.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Answer 1 · 2020-08-19T07:58:00

Quote:
Minimizing the area requirement by placing different polygon

This look like a 2D cutting stock problem, a problem very common in industry, but the problem is complicated enough to have companies selling specialized products for this problem. So don't expect a simple solution to fit in a couple hundred lines of code.
Cutting stock problem - Wikipedia[^]

In the 2D cutting stock problem, squares and rectangles are the easiest to deal with, after that, convex polygon are next, and then concave polygons are the hardest.
Not all programs can deal with every polygon, so first you need to be precise with the kind of polygons you have to deal with.
You need to give more details to give us an idea of your real problem.