The cost of cutting out convex \(n\)-gons
From MaRDI portal
Publication:1887073
DOI10.1016/j.dam.2003.09.001zbMath1087.68116OpenAlexW1997775408MaRDI QIDQ1887073
Publication date: 23 November 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.001
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
An approximation algorithm for cutting out convex polygons ⋮ CUTTING OUT POLYGONS WITH A CIRCULAR SAW ⋮ Cutting a convex polyhedron out of a sphere ⋮ A PTAS for cutting out polygons with lines ⋮ Cutting out polygon collections with a saw
Cites Work
This page was built for publication: The cost of cutting out convex \(n\)-gons
