Recommendations
Cites work
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Cutting glass
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Minimum convex partition of polygonal domains by guillotine cuts
- On-line construction of the convex hull of a simple polyline
- Ray shooting in polygons using geodesic triangulations
- Visibility and intersection problems in plane geometry
Cited in
(17)- A PTAS for cutting out polygons with lines
- The geometry of carpentry and joinery
- Sets of lines and cutting out polyhedral objects
- An approximation algorithm for cutting out convex polygons
- The cost of cutting out convex n-gons
- Snipperclips: cutting tools into desired polygons using themselves
- Cutting out polygon collections with a saw
- scientific article; zbMATH DE number 1630086 (Why is no real title available?)
- Cutting circles into equal area pieces
- Cutting out polygons with a circular saw
- CUTTING OUT POLYGONS WITH A CIRCULAR SAW
- Two Problems with Table Saws
- Crazy-cuts: from theory to app
- On collections of polygons cuttable with a segment saw
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Cutting a convex polyhedron out of a sphere
- Polynomial-time algorithms for contiguous art gallery and related problems
This page was built for publication: Polygons cuttable by a circular saw
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952972)
