Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm

Details Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm

2011-12-20

arxiv.org/abs/1112.4791v1

Computer Science

Computational Geometry

15 pages, 10 figures

Scientific paper

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts the polyhedron only where it is met by the grid of coordinate planes passing through the vertices, together with Theta(n^2) additional coordinate planes between every two such grid planes.

Affiliated with

Also associated with

No associations

Rating

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm 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 Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58780