Cutting a Convex Polyhedron Out of a Sphere

Details Cutting a Convex Polyhedron Out of a Sphere Cutting a Convex Polyhedron Out of a Sphere

2009-07-23

arxiv.org/abs/0907.4068v2

Computer Science

Computational Geometry

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cutting a Convex Polyhedron Out of a Sphere does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cutting a Convex Polyhedron Out of a Sphere, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cutting a Convex Polyhedron Out of a Sphere will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355072