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
The cost of cutting out convex n-gons
Discrete Applied Mathematics
The geometry of carpentry and joinery
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
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 out polygons with lines and rays
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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.00 |