Polygons cuttable by a circular saw

DOI10.1016/S0925-7721(01)00036-0zbMath0991.68120OpenAlexW2053814689WikidataQ126634800 ScholiaQ126634800MaRDI QIDQ5952972

Erik D. Demaine, Craig S. Kaplan, Martin L. Demaine

Publication date: 14 January 2002

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00036-0

zbMATH Keywords

separabilityvisibilityrecognition algorithmscuttability

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

An approximation algorithm for cutting out convex polygons ⋮ The cost of cutting out convex \(n\)-gons ⋮ CUTTING OUT POLYGONS WITH A CIRCULAR SAW ⋮ Cutting a convex polyhedron out of a sphere ⋮ Snipperclips: cutting tools into desired polygons using themselves ⋮ The geometry of carpentry and joinery ⋮ A PTAS for cutting out polygons with lines ⋮ CUTTING OUT POLYGONS WITH LINES AND RAYS ⋮ Cutting out polygon collections with a saw

Cites Work

• Unnamed Item
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On-line construction of the convex hull of a simple polyline
• Ray shooting in polygons using geodesic triangulations
• Minimum convex partition of polygonal domains by guillotine cuts
• Cutting glass
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk