Cutting a Convex Polyhedron Out of a Sphere

Masud Hasan; Md. Ariful Islam; Syed Ishtiaque Ahmed

arxiv: 0907.4068 · v2 · submitted 2009-07-23 · 💻 cs.CG · cs.DM· cs.DS

Cutting a Convex Polyhedron Out of a Sphere

Syed Ishtiaque Ahmed , Masud Hasan , Md. Ariful Islam This is my paper

classification 💻 cs.CG cs.DMcs.DS

keywords convexcutscuttingpolyhedronspherealgorithmcostgive

0 comments

read the original 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.

This paper has not been read by Pith yet.

Cutting a Convex Polyhedron Out of a Sphere

discussion (0)