CUTTING OUT POLYGONS WITH A CIRCULAR SAW

DOI10.1142/S0218195913600030zbMath1344.68257MaRDI QIDQ3459357

Adrian Dumitrescu, Masud Hasan

Publication date: 22 December 2015

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmshortest path treecuttable polygonsaw cut

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Cutting out polygon collections with a saw

Cites Work

• Cutting a convex polyhedron out of a sphere
• A PTAS for cutting out polygons with lines
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• Stock cutting to minimize cutting length
• An approximation algorithm for cutting out convex polygons
• The cost of cutting out convex \(n\)-gons
• Euclidean shortest paths in the presence of rectilinear barriers
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• Polygons cuttable by a circular saw

This page was built for publication: CUTTING OUT POLYGONS WITH A CIRCULAR SAW