|
[x]
Posted via EE Mobile
|
|
| Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
|
|
|
|
Asked by AdnanKurtovic in Algorithms, Theory, Math & Science
I am working on polygon packaging problem. My idea is to use linear programming to solve this because of a speed. Currently I have developed program that uses computational geometry, but it is very slow, so that is why I am considering LP (using Simplex I can get solution much faster). At the beginning I need help to write LP that will place one polygon inside another. Polygons are simple and concave. Does anybody know how to write this LP. If somebody knows how to solve it using Integer programming, that will also be considered as an answer.
20091111-EE-VQP-89 - Hierarchy / EE_QW_2_20070628