相关论文: A convex cover for closed unit curves has area at …

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 by considering the minimal area of convex…

In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a…

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…

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…

We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, i.e., four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper…

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…

We show that every planar convex body is contained in a quadrangle whose area is less than $(1 - 2.6 \cdot 10^{-7}) \sqrt{2}$ times the area of the original convex body, improving the best known upper bound by W. Kuperberg.

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

We show that in Euclidean 3-space any closed curve which lies outside the unit sphere and contains the sphere within its convex hull has length at least $4\pi$. Equality holds only when the curve is composed of $4$ semicircles of length…

We prove that every unit area convex pentagon is contained in a convex quadrilateral of area no greater than $3/\sqrt{5}$, and that every unit area convex hexagon is contained in a convex pentagon of area no greater than $7/6$. Both results…

Forty years ago Schaer and Wetzel showed that a $\frac{1}{\pi}\times\frac {1}{2\pi}\sqrt{\pi^{2}-4}$ rectangle, whose area is about $0.122\,74,$ is the smallest rectangle that is a cover for the family of all closed unit arcs. More recently…

The total diameter of a closed planar curve $C\subset R^2$ is the integral of its antipodal chord lengths. We show that this quantity is bounded below by twice the area of $C$. Furthermore, when $C$ is convex or centrally symmetric, the…

We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere,…

We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a…