Ref: On folding a polygonal sheet, Multi-layered wrapping of polyhedra
Basic intent: to wrap a given convex planar lamina with a convex sheet of non-stretchable paper (such that every point on both sides of the lamina has at least one layer of paper covering it). To optimize, the wrapping convex paper sheet could be of least area/perimeter/diameter. An n-layered wrap is a wrap such that to reach any point on the lamina from outside, a 'needle' will have to pierce at least n layers of paper.
Question: Which is the unit area convex lamina for which the least area n-layered wrap needs a sheet of the largest area? For any n, is it always a unit disk?
Note: Same question can be asked for the least perimeter/diameter wrapping sheet.