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
Computational Geometry: Theory and Applications
Cutting out polygons with lines and rays
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximation algorithms for cutting a convex polyhedron out of a sphere
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
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
Approximation algorithms for cutting a convex polyhedron out of a sphere
Theoretical Computer Science
| Hi-index | 0.00 |
This paper studies the problem of cutting out a given polygon, drawn on a convex piece of paper, in the cheapest possible way. For the problems of cutting out convex polygons with line cuts and ray cuts, we present a 7.9-approximation algorithm and a 6-approximation algorithm, respectively. For the problem of cutting out ray-cuttable polygons, an O(log n)-approximation algorithm is given.