Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of cutting paper (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Polygons cuttable by a circular saw
Computational Geometry: Theory and Applications
The cost of cutting out convex n-gons
Discrete Applied Mathematics
Nesting of two-dimensional irregular parts: an integrated approach
International Journal of Computer Integrated Manufacturing
A PTAS for cutting out polygons with lines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Cutting out polygons with lines and rays
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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.