Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
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
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
| Hi-index | 0.00 |
Given a convex polyhedron P of n vertices inside a sphere Q, we give an O(n3)-time algorithm that cuts P out of Q by using guillotine cuts and has cutting cost O(log2n) times the optimal.