A convex cover for closed unit curves has area at least 0.0975

05/01/2019
by   Bogdan Grechuk, et al.
0

We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower bound of 0.096694. In fact, we show that the minimal area of convex hull of circle, equilateral triangle, and rectangle of perimeter 1 is between 0.0975 and 0.09763.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2018

A smaller cover for closed unit curves

Forty years ago Schaer and Wetzel showed that a 1/π×1/2π√(π^2-4) rectang...
research
11/27/2022

Universal convex covering problems under translation and discrete rotations

We consider the smallest-area universal covering of planar objects of pe...
research
03/31/2018

Fast Fencing

We consider very natural "fence enclosure" problems studied by Capoyleas...
research
03/03/2020

About the Serpinsky-Knopp curve

The Serpinsky-Knopp curve is characterized as the only curve (up to isom...
research
09/05/2023

From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy

Let γ be a generic closed curve in the plane. Samuel Blank, in his 1967 ...
research
03/30/2020

Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries

We study the interplay between the recently defined concept of minimum h...
research
05/24/2023

Optimal separator for an hyperbola; Application to localization

This paper proposes a minimal contractor and a minimal separator for an ...

Please sign up or login with your details

Forgot password? Click here to reset