Cutting out polygon collections with a saw

DOI10.1016/j.dam.2016.05.026zbMath1365.05060OpenAlexW2437864991MaRDI QIDQ2357165

Masud Hasan, Adrian Dumitrescu, Anirban Ghosh

Publication date: 19 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.026

zbMATH Keywords

separabilitycutting sequencecuttable collectioncuttable polygonline cutray cutsegment cut

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• A PTAS for cutting out polygons with lines
• Separating convex sets in the plane
• Stock cutting to minimize cutting length
• Separation of convex sets
• Cutting glass
• An approximation algorithm for cutting out convex polygons
• The cost of cutting out convex \(n\)-gons
• On reconfiguration of disks in the plane and related problems
• Cutting disjoint disks by straight lines
• CUTTING OUT POLYGONS WITH A CIRCULAR SAW
• SLIDING DISKS IN THE PLANE
• Separating plane convex sets.
• Computational Geometry in C
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• Computing and Combinatorics
• Separating convex sets by straight lines
• Polygons cuttable by a circular saw

This page was built for publication: Cutting out polygon collections with a saw