Lower Bound for Convex Hull Area and Universal Cover Problems

@article{Khandhawit2013LowerBF,
  title={Lower Bound for Convex Hull Area and Universal Cover Problems},
  author={Tirasan Khandhawit and Dimitrios Pagonakis and Sira Sriswasdi},
  journal={Int. J. Comput. Geom. Appl.},
  year={2013},
  volume={23},
  pages={197-212}
}
We provide a technique to obtain a lower bound for the area of the convex hull of a set of points and a rectangle in the plane, and then apply the resulting estimates to improve the lower bound for the convex case of Moser's Worm problem. Specifically, we show that any convex universal cover for unit arcs has an area of at least 0.232239. We also apply our approach to the universal cover problem for closed unit curves. 
A convex cover for closed unit curves has area at least 0.0975
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.Expand
A convex cover for closed unit curves has area at least 0.1
We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this byExpand
Wetzel’s sector covers unit arcs
TLDR
Leo Moser asked in 1966 for the (convex) region with the smallest area in the plane that can accommodate each arc of unit length, and this sector is the smallest such set presently known. Expand
Lost in an Isosceles Triangle
Sixty years ago Richard Bellman issued a difficult challenge to his fellow mathematicians. If a rambler is lost in a forest of known shape and size, how can she find the best path to follow in orderExpand
Errata and Addenda to Mathematical Constants
We humbly and briefly offer corrections and supplements to Mathematical Constants (2003) and Mathematical Constants II (2019), both published by Cambridge University Press. Comments are alwaysExpand

References

SHOWING 1-10 OF 26 REFERENCES
A Lower Bound for Lebesgue's Universal Cover Problem
TLDR
Any convex set that contains a congruent copy of any set of diameter one (universal cover) has area at least 0.832, considerably improves the lower bound for Lebesgue's universal cover problem, using a combination of computer search and geometric bounds. Expand
An Improved Lower Bound for Moser's Worm Problem
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 attemptExpand
Small Convex Covers for Convex Unit Arcs
More than 40 years ago, Leo Moser stated a geometry problem on the plane asking for the least-area set that contains a congruent copy of every unit arc. The smallest set known, by Norwood and PooleExpand
Covers for closed curves of length two
The least area α2 of a convex set in the plane large enough to contain a congruent copy of every closed curve of length two lies between 0.385 and 0.491, as has been known for more than 38 years. WeExpand
Boxes for curves of constant length
We prove that every arc of lengthL inEn lies in some hypercube of diagonalL and that every closed curve of lengthL lies in some hypercube of diagonalL/2. In the casen=2, we find the smallestExpand
An Improved Upper Bound for Leo Moser's Worm Problem
TLDR
This paper reduces the smallest known upper bound for this area from 0.275237 [10] to 0.260437. Expand
The Worm Problem of Leo Moser
TLDR
This paper shows that a solution to the Worm Problem of Moser is a region with area less than 0.27524. Expand
Fits and Covers
Combinatorial Euclidean geometry is replete with appealing, uninvestigated questions of unpredictable depth and difficulty. Interesting, innocent-looking, beguilingly simple questions having to doExpand
Lost in a Forest
TLDR
To solve the "lost in a forest" problem the authors must find the "best" escape path, and Bellman proposed two different interpretations of "best," one in which the maximum time to escape is minimized, and one inWhich the expected time to Escape is minimized. Expand
Research problems in discrete geometry
TLDR
This chapter discusses 100 Research Problems in Discrete Geometry from the Facsimile edition of the World Classics in Mathematics Series, vol. Expand
...
1
2
3
...