On Inside-Out Dissections of Polygons and Polyhedra: Improved Upper Bounds and Three-Dimensional Results

This research paper presents improved upper bounds for the minimum number of pieces required to inside-out dissect arbitrary and regular polygons, and proves that any polyhedron decomposable into regular tetrahedra and octahedra can be inside-out dissected.