The Inverse Kakeya Problem

DOI10.1007/S10998-021-00392-ZMaRDI QIDQ6331330arXivFDO

Authors S. Cabello, Otfried Cheong, Michael Gene Dobbins

Publication date 18 December 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10998-021-00392-Z

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

arXiv classification

math.MG

Abstract: We prove that the largest convex shape that can be placed inside a given convex shape $Qsubsetmathbb{R}^d$ in any desired orientation is the largest inscribed ball of $Q$. The statement is true both when "largest" means "largest volume" and when it means "largest surface area". The ball is the unique solution, except when maximizing the perimeter in the two-dimensional case.

This page was built for publication: The Inverse Kakeya Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6331330)