Abstract
Given a convex polyhedron \(P\) of \(n\) vertices inside a sphere \(Q\), we give an \(O(n^3)\)-time algorithm that cuts \(P\) out of \(Q\) by using guillotine cuts and has cutting cost \(O((\log n)^2)\) times the optimal.
- Title
- Cutting a Convex Polyhedron Out of a Sphere
- Creators - without role
- Syed Ishtiaque AhmedMasud HasanMd Islam
- Publication Details
- arXiv.org
- Publisher
- Cornell University Library, arXiv.org; Ithaca
- Identifiers
- 9930153908331
- Academic Unit
- Taibah University
- Language
- English
- Resource Type
- Other