Sets of lines and cutting out polyhedral objects
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1182925 (Why is no real title available?)
- scientific article; zbMATH DE number 3428118 (Why is no real title available?)
- A survey of motion planning and related geometric algorithms
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Constructing the relative neighborhood graph in 3-dimensional Euclidean space
- Lower bounds on stabbing lines in 3-space
- Spatial Planning: A Configuration Space Approach
- Stabbing line segments
Cited in
(7)- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Cutting a convex polyhedron out of a sphere
- A PTAS for cutting out polygons with lines
- Snipperclips: cutting tools into desired polygons using themselves
- Cutting a Convex Polyhedron Out of a Sphere
- Approximation algorithms for cutting a convex polyhedron out of a sphere
- Approximation algorithms for cutting a convex polyhedron out of a sphere
This page was built for publication: Sets of lines and cutting out polyhedral objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873156)