An approximation algorithm for cutting out convex polygons

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 823-827

  Dumitrescu, Adrian ^a  

^a University of Wisconsin Milwaukee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CONVEX POLYGONS; CUTTING SEQUENCE;

ALGORITHMS;

EID: 0038754029     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. E. D. Demaine, M. L. Demaine and C. S. Kaplan, Polygons cuttable by a circular saw, Computational Geometry: Theory and Applications, 20 (2001), 69-84.
2. A. Dumitrescu, The cost of cutting out convex n-gons, manuscript (submitted), April 2002.
3. J. Erickson, L. J. Guibas, J. Stolfi and L. Zhang, Separation-sensitive collision detection for convex objects, Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms, 1999, 327-336.
4. M. H. Overmars and E. Welzl, The complexity of cutting paper, Proceedings of the 1-st Annual ACM Symposium on Computational Geometry, 1985, 316-321.
5. J. Pach and G. Tardos, Cutting glass, Discrete & Computational Geometry, 24 (2000), 481-495.