Approximation algorithms for cutting a convex polyhedron out of a sphere
From MaRDI portal
Publication:388101
DOI10.1016/j.tcs.2012.03.035zbMath1416.68199OpenAlexW2085531390MaRDI QIDQ388101
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.035
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Cutting a convex polyhedron out of a sphere
- A PTAS for cutting out polygons with lines
- Finding small simple cycle separators for 2-connected planar graphs
- 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
- A Separator Theorem for Planar Graphs
- Planar Separators
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Computing and Combinatorics
This page was built for publication: Approximation algorithms for cutting a convex polyhedron out of a sphere