Following shadows and planar sections, we ask about bisecting sections. This post also continues Convex planar regions with all area bisectors having equal length and A claim on the concurrency of area bisectors of planar convex regions in 3d.
We can consider several types of bisections of 3D convex solids - cutting the solid by a plane into 2 convex pieces of equal volume, equal surface area, equal width and so on..The intersection of a bisecting plane with the body can be called a bisecting section. Naturally, a solid has volume bisecting sections, surface bisecting sections and so forth.
So, an all-in one algorithmic question is:
- Given a convex polyhedron, how does one find the volume bisecting section (equally surface area bisecting section, etc) with largest (equally, smallest) area (equally, perimeter)?
Further, for general convex solids:
if all volume (surface area) bisecting sections of a solid have same area (perimeter), what could we infer?
if all volume (surface area) bisecting sections of a solid pass through a point, is the solid centrally symmetric?
Note: more speculatively, we can cask: do we have some relations between bisecting sections like (say) "for any convex solid, the volume bisecting section with least area is the same as the volume bisecting section with least perimeter" or "the volume bisecting section with max area is the same as the surface area bisecting section with max perimeter"?