An approximation algorithm for cutting out convex polygons

DOI10.1016/j.comgeo.2004.01.010zbMath1082.65020OpenAlexW2013409484MaRDI QIDQ1886238

Adrian Dumitrescu

Publication date: 18 November 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.01.010

zbMATH Keywords

approximation algorithmcombinatorial geometryconvex polygonsstock cuttingcomplexity of cuttingoptimal edge-cutting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items (7)

CUTTING OUT POLYGONS WITH A CIRCULAR SAW ⋮ Approximation algorithms for cutting a convex polyhedron out of a sphere ⋮ Cutting a convex polyhedron out of a sphere ⋮ Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere ⋮ A PTAS for cutting out polygons with lines ⋮ CUTTING OUT POLYGONS WITH LINES AND RAYS ⋮ Cutting out polygon collections with a saw

Cites Work

• Stock cutting to minimize cutting length
• Cutting glass
• The cost of cutting out convex \(n\)-gons
• Polygons cuttable by a circular saw

This page was built for publication: An approximation algorithm for cutting out convex polygons