Lower bound for convex hull area and universal cover problems

From MaRDI portal
Publication:3459368



Abstract: We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three objects with minimal convex hull area. Consequently, we improve a lower bound for Moser's worm problem from 0.2194 to 0.227498.












This page was built for publication: Lower bound for convex hull area and universal cover problems

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