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
Sets of lines and cutting out polyhedral objects
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
An approximation algorithm for cutting out convex polygons
Computational Geometry: Theory and Applications
The cost of cutting out convex n-gons
Discrete Applied Mathematics
Approximation algorithms for cutting out polygons with lines and rays
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
| Hi-index | 0.00 |
The problem of cutting a convex polygon P out of a planar piece of material Q (P is already drawn on Q) with minimum total cutting cost is a well studied problem in computational geometry that has been studied with several variations such as P and Q are convex or non-convex polygons, Q is a circle, and the cuts are line cuts or ray cuts. In this paper, we address this problem without the restriction that P is fixed inside Q and consider the variation where Q is a circle and the cuts are line cuts. We show that if P can be placed inside Q such that P does not contain the center of Q, then placing P in a most cornered position inside Q gives a cutting cost of 6.48 times the optimal. We also give an O(n2)-time algorithm for finding such a position of P, a problem that may be of independent interest. When any placement of P must contain the center of Q, we show that P can be cut of Q with cost 6.054 times the optimal.