We provide an O(log n)-approximation algorithm for the following problem. Given a convex n-gon P, drawn on a convex piece of paper, cut P out of the piece of paper in the cheapest possible way. No approximation algorithm was known for this problem posed in 1985.
展开▼
机译：对于以下问题，我们提供了 O （log n ）逼近算法。给定在凸张纸上绘制的凸 n -gon P ，以最便宜的方式从纸上切出 P 。 1985年提出的此问题尚无近似算法。
展开▼
