Cutting a convex polyhedron out of a sphere
From MaRDI portal
Publication:659695
DOI10.1007/s00373-011-1018-1zbMath1242.52016arXiv0907.4068OpenAlexW1949305763MaRDI QIDQ659695
Syed Ishtiaque Ahmed, Md. Ariful Islam, Masud Hasan
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.4068
Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Approximation algorithms (68W25)
Related Items (2)
CUTTING OUT POLYGONS WITH A CIRCULAR SAW ⋮ Approximation algorithms for cutting a convex polyhedron out of a sphere
Cites Work
- Unnamed Item
- A PTAS for cutting out polygons with lines
- Stock cutting to minimize cutting length
- Sets of lines and cutting out polyhedral objects
- An approximation algorithm for cutting out convex polygons
- The cost of cutting out convex \(n\)-gons
- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
- Finding minimal enclosing boxes
- Mathematical Foundations of Computer Science 2004
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Computing and Combinatorics
- Polygons cuttable by a circular saw
This page was built for publication: Cutting a convex polyhedron out of a sphere