title: Cutting Heuristic Solving Algorithm for n-edged polygone
body: <p>I want to programm a tool that can place objects on a rectangle with the minumum of waste, this problem is also known as the cutting problem.
  So i looked around to find some algorithms and i found out there are a few for rectangles but not that much for n-edged polygones.</p>
  
  <p>my first approach was to get a bounding box for the polygone, then run the normal rectangle algorithm. After that you cound slowly try to increase the number of edges but still have only isometric lines (only vertical and horizontal), to approximate the polygone.</p>
  
  <p>I wonder if there is any good algorithm that implement such thing, but is more common than create my own stuff.</p>
  
  <p>the other way ive come up with could be something with two dimensional knapsack and some sorting heuristics that sort the best fitting polygones and try to put them on the rectangle.</p>
  
  <p>But all i come up with has some good detection of special polygones (such as a square or normal rectangle) but does not work on common polygones. </p>