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
An approximation algorithm for cutting out convex polygons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for cutting out convex polygons
Computational Geometry: Theory and Applications
A PTAS for cutting out polygons with lines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Cutting a convex polyhedron out of a sphere
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
On finding a better position of a convex polygon inside a circle to minimize the cutting cost
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Cutting out polygons with a circular saw
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.04 |
Given a convex n-gon P drawn on a piece of paper Q of unit diameter we prove that it can be cut with a total cost of O(log n). This bound is shown to be asymptotically tight: a regular n-gon (whose circumscribed circle has radius, say, 1/3) drawn on a square piece of paper of unit diameter requires a cut cost of Ω(log n).