Back to Search
Start Over
A PTAS for Cutting Out Polygons with Lines.
- Source :
- Algorithmica; Feb2009, Vol. 53 Issue 2, p157-171, 15p
- Publication Year :
- 2009
-
Abstract
- Abstract  We present a simple O(m+n 6/ε 12) time (1+ε)-approximation algorithm for finding a minimum-cost sequence of lines to cut a convex n-gon out of a convex m-gon. [ABSTRACT FROM AUTHOR]
- Subjects :
- POLYGONS
ALGORITHMS
CONVEX surfaces
ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 01784617
- Volume :
- 53
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Algorithmica
- Publication Type :
- Academic Journal
- Accession number :
- 36526006
- Full Text :
- https://doi.org/10.1007/s00453-008-9182-2