CUTTING OUT POLYGONS WITH LINES AND RAYS

DOI10.1142/S0218195906002014zbMath1096.65015MaRDI QIDQ5470174

Jun Luo, Ovidiu Daescu

Publication date: 29 May 2006

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

zbMATH Keywords

algorithmconvex polygoncomputational geometrycutting sequencepolygon cuttingline cuttingray cuttable polygonray 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)

Related Items (6)

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 polygon collections with a saw

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Stock cutting to minimize cutting length
• Sets of lines and cutting out polyhedral objects
• An approximation algorithm for cutting out convex polygons
• Polygons cuttable by a circular saw

This page was built for publication: CUTTING OUT POLYGONS WITH LINES AND RAYS