Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere
From MaRDI portal
Publication:3004662
DOI10.1007/978-3-642-21204-8_16zbMath1329.68269MaRDI QIDQ3004662
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_16
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
Cites Work
- A PTAS for cutting out polygons with lines
- Stock cutting to minimize cutting length
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Sets of lines and cutting out polyhedral objects
- An approximation algorithm for cutting out convex polygons
- Cutting a Convex Polyhedron Out of a Sphere
- A Separator Theorem for Planar Graphs
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Computing and Combinatorics