Covering the boundary of a convex set by tiles
Covering the boundary of a convex set by tiles
Let Euclidean space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper E Superscript n"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>E</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{E^n}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be dissected by a finite family of hyper-planes. We estimate how many of the tiles obtained are sufficient to cover the boundary of a convex set …