Tailoring for Every Body: Reshaping Convex Polyhedra

08/04/2020
by   Joseph O'Rourke, et al.
0

Given any two convex polyhedra P and Q, we prove as one of our main results that the surface of P can be reshaped to a homothet of Q by a finite sequence of "tailoring" steps. Each tailoring excises a digon surrounding a single vertex and sutures the digon closed. One phrasing of this result is that, if Q can be "sculpted" from P by a series of slices with planes, then Q can be tailored from P. And there is a sense in which tailoring is finer than sculpting in that P may be tailored to polyhedra that are not achievable by sculpting P. It is an easy corollary that, if S is the surface of any convex body, then any convex polyhedron P may be tailored to approximate a homothet of S as closely as desired. So P can be "whittled" to e.g., a sphere S. Another main result achieves the same reshaping, but by excising more complicated shapes we call "crests," still each enclosing one vertex. Reversing either digon-tailoring or crest-tailoring leads to proofs that any Q inside P can be enlarged to P by cutting Q and inserting and sealing surface patches. One surprising corollary of these results is that, for Q a subset of P, we can cut-up Q into pieces and paste them non-overlapping onto an isometric subset of P. This can be viewed as a form of "unfolding" Q onto P. All our proofs are constructive, and lead to polynomial-time algorithms.

READ FULL TEXT
research
07/07/2021

Reshaping Convex Polyhedra

Given a convex polyhedral surface P, we define a tailoring as excising f...
research
04/13/2020

Reconstructing a Polyhedron between Polygons in Parallel Slices

Given two n-vertex polygons, P=(p_1, …, p_n) lying in the xy-plane at z=...
research
08/29/2018

A polynomial-time algorithm for median-closed semilinear constraints

A subset of Q^n is called semilinear (or piecewise linear) if it is Bool...
research
12/19/2019

On the hardness of finding normal surfaces

There are fundamental topological problems, such as unknot recognition a...
research
03/09/2022

Simple Closed Quasigeodesics on Tetrahedra

Pogorelov proved in 1949 that every every convex polyhedron has at least...
research
08/03/2020

Finding Closed Quasigeodesics on Convex Polyhedra

A closed quasigeodesic is a closed loop on the surface of a polyhedron w...
research
11/24/2018

Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring

Finding the exact integrality gap α for the LP relaxation of the 2-edge-...

Please sign up or login with your details

Forgot password? Click here to reset