Abstract
We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently, closed curves of length 2) allowing translations and discrete rotations. In particular, we show that the solution is an equilateral triangle of height 1 when translations and discrete rotations of π are allowed. We also give convex coverings of closed curves of length 2 under translations and discrete rotations of multiples of π/2 and of 2π/3. We show that no proper closed subset of that covering is a covering for discrete rotations of multiples of π/2, which is an equilateral triangle of height smaller than 1, and conjecture that such a covering is the smallest-area convex covering. Finally, we give the smallest-area convex coverings of all unit segments under translations and discrete rotations of 2π/k for all integers k=3.
1 Introduction
Given a (possibly infinite) set S of planar objects and a group G of geometric transformations, a G-covering K of S is a region such that every object in S can be included in K by transforming the object with a suitable transformation g ∈ G. Equivalently, every object of S is contained in g−1K for a suitable transformation g ∈ G; that is,
We denote the group of planar translations by T and that of planar translations and rotations by TR. Group-theoretically, TR=T⋊ R is the semidirect product of T and the rotation group
The universal covering problem has attracted many mathematicians. Henri Lebesgue (in his letter to J. Pál in 1914) proposed the problem to find the smallest-area convex TR-covering of all objects of unit diameter; see [7,4,10] for the history. Kakeya considered in 1917 the T-covering of the set
Generalizing Pál’s result, for any set of n segments, there is a a triangle is the smallest-area convex T-covering of the set, and that triangle can be computed efficiently in O(nlogn) time; see [1]. It is further conjectured that the smallest-area convex TR-covering of a family of triangles is a triangle, which is shown to be true for some families in [19].
The problem of finding the smallest-area covering and convex covering of the set of all curves of unit length for G=TR was listed by Leo Moser as an open problem in 1966 [14]. The problem is still unsolved, and the best lower bound of the smallest area of the convex covering is 0.21946; see [22]. For the best upper bound, Wetzel informally conjectured in 1970 (and published in [23]) that the 30° circular fan of unit radius, which has the area π/12 ≈ 0.2618, is a convex TR-covering of all unit-length curves; this was proved by Panraksa and Wichiramala in [18]. Recently, the upper bound was improved to 0.260437 in [16], but there still remains a substantial gap between the lower and upper bounds.
However, when only translations are allowed, the equilateral triangle of height 1 is the smallest-area convex covering (Corollary 4), which is the same as in the case of considering the unit line segments. There has been no concrete proof of Corollary 4 in the literature. It can be confirmed analytically, since it suffices to consider a polyline consisting of two segments. Also, we can directly prove it by applying a reflecting argument (similar to the proof of Theorem 2) which is given in Appendix.
There are many variants of Moser’s problem, and they are called Moser’s worm problem. The history of progress on this topic can be found in the article [15] by William Moser (Leo’s younger brother), in Chapter D18 in [8], and in Chapter 11.4 in [7]. It is interesting to find a new case of Moser’s worm problem with a clean mathematical solution.
From now on, we focus on the convex G-covering of the set
This problem is known to be an interesting but hard variant of Moser’s worm problem, and remains unsolved for T and TR despite of substantial efforts in the literature; see [9,23,20,8,7]. As far as the authors know, the smallest-area convex TR-covering known today is a hexagon obtained by clipping two corners of a rectangle, see given by Wichiramala [24], and its area is slightly less than 0.441. [24].By [11] the smallest area is at least 0.39, which has been recently improved to 0.4 in [12] using computer programs. The smallest area of the convex T-covering is known to be between 0.620 and 0.657 by [7].
There are some results on restricted shapes of covering. Especially, ifFor triangular coverings, Wetzel [20,21] gave a complete description, and he it is showed that an acute triangle with side lengths a, b, c and area X becomes a T-covering (respectively TR-covering) of
If H is a subgroup of G, then an H-covering is a G-covering. Since T⊂ TR, it is quite reasonable to consider groups G lying in between, that is T ⊂ G⊂ TR. The group
In this paper, we consider the coverings under the action of the group Gk=T⋊ Zk. We show that the smallest-area convex G2-covering of
However, the smallest-area convex G3-covering is no longer an equilateral triangle. We give a convex G3-covering of
A table listing our results
| All closed curves with length 2 | All unit segments | |
| G2-covering | Equilateral triangle with height 1 (smallest area) | - |
| G3-covering | Part of a church window | - |
| G4-covering | Equilateral triangle with height cos(π/12) (minimal) | Isosceles right triangle with legs of length 1 (smallest area) |
| Gk-covering for odd k ≥ 3 | - | Triangle with base length 1, height sin(π/k), and π/2 ≤ θ ≤ (k − 1)π/k for a corner angle θ incident to the base (smallest area) |
| Gk-covering for even k ≥ 4 | - | Triangle with base length 1, height sin(2π/k), and π/2 ≤ θ' ≤ (k − 2)π/k for a corner angle θ' incident to the base (smallest area) |
-
We denote by ℓ(C) the perimeter of a compact set C, and by ℓ(γ) the length of a curve γ. The slope of a line is the angle swept from the x-axis in a counter-clockwise direction to the line, and it is thus in [0, π). The slope of a segment is the slope of the line that extends it. For two points p and q, we denote by pq the line segment connecting p and q, and by |pq| the length of pq.We denote by ℓpq the line passing through p and q.
Covering under rotation by 180 degrees
In this section, we show that the smallest-area convex G2-covering of the set
2.1 The smallest-area covering and related results
We recall a famous result mentioned in the introduction.
Theorem 1
(Pal’s theorem for the convex Kakeya problem). The equilateral triangle Δ1 is the smallest-area convex T-covering of the set of all unit line segments.
Corollary 1
The area of a convex
G
2-covering of
Proof. Observe that all unit line segments are in
By Corollary 1, it suffices to show that any closed curve γ in
Theorem 2
The equilateral triangle Δ1is the smallest-area convexG2-covering of
Before proving the theorem, we give some direct implications of it. An object P is centrally symmetric with respect to the origin if −P=P, where −P={−x∣ x ∈ P}. Let
Corollary 2
The equilateral triangle Δ1is the smallest-area convexT-covering of
Proof.
We can consider two special cases shown below. Corollary 2 implies that Δ1 is a T-covering of all rectangles of perimeter 2, and also of all parallelograms of perimeter 2. Since a unit line segment is a degenerate rectangle and a degenerate parallelogram of perimeter 2, we have the following corollary.
Corollary 3
The equilateral triangle Δ1 is the smallest-area convex T-covering of the set of all parallelograms of perimeter 2. This also holds for the set of all rectangles of perimeter 2.
We also obtain the following well-known result about the covering of the set
Corollary 4
The equilateral triangle Δ1is the smallest-area convexT-covering of
Proof. Given a curve ζ in
We can prove Corollary 4 directly by applying a reflecting argument (similar to the proof of Theorem 2) which is given in Appendix.

Tiling argument. (a) Hγ=L0∩ Lπ/3∩ L2π/3. (b) A tiling of six copies Hγ(1), ⋅, Hγ(6) of Hγ. Any closed curve that touches every side of Hγ is not shorter than the dashed (blue) segment of length at least d0+dπ/3+d2π/3.
2.2 Proof of Theorem 2
A slab is the region bounded by two parallel lines in the plane; its width is the distance between the two bounding lines. For a closed curve γ of
Lemma 1
For a closed curve
γ
of
Proof. Let Hγ be the hexagon which is the intersection of L0, Lπ/3 and L2π/3 of γ; see Figure 1(a). Let e1, ⋅, e6 be the edges of Hγ in counter-clockwise order. We can obtain a tiling of six copies Hγ(1), ⋅, Hγ(6) of Hγ such that Hγ(1)=Hγ and Hγ(k + 1) is the copy of Hγ(k) reflected about ek of Hγ(k) for k=1, ⋅, 5 from 1 to 5 as shown in Figure 1(b). We observe that the length of a closed curve that touches every side of Hγ is at least d0+dπ/3+d2π/3; see Figure 1(b). Since γ touches every side of Hγ and the length of γ is 2 by the definition of

(a) Pγ=Lπ/3∩ L2π/3, andh=dπ/3+d2π/3. (b) h+d=2.
Lemma 2
Any closed curve
γ of
Proof. Let Pγ be the parallelogram which is the intersection of Lπ/3 and L2π/3 of γ. The height h of Pγ is h=dπ/3+d2π/3; see Figure 2(a). If h ⩽ 1, then Pγ can be included in both Δ1 and −Δ1 under translation.
For h > 1 we consider two horizontal lines ℓt and ℓb such that they intersect Pγ, and ℓt lies above the bottom corner of Pγ at distance 1 and ℓb lies below the top corner of Pγ at distance 1. If d is the distance between ℓt and ℓb, then d+h=2; equals 2 (see Figure 2(b). By Lemma 1 we have d0+dπ/3+d2π/3=d0+h ⩽ 2, so d=d0. This implies that ℓb or ℓt is not contained in the interior of L0. If ℓb lies below the interior of L0, then γ can be included in Δ1 under translation. If ℓt lies above the interior of L0, then γ can be included in −Δ1 under translation. □
For a closed curve γ, either γ or −γ can be included in Δ1 under translation by Lemma 2, so we obtain Theorem 2.
3 Covering under rotation by 90 degrees
In this section we consider the convex G4-coverings of the sets
3.1 Covering of unit line segments
First, we consider the set
Theorem 3
The smallest-area convex G 4-covering of all unit segments has area 1/2, and the unique compact convexG4-covering of all unit segments with smallest area is the isosceles right triangle with legs of length 1.
Proof. Let
Now we show that any convex G4-covering of
Consider the case that A− contains no interval. Let I(x, ε) be the open interval in [0, π/2) centered at an angle x with radius ε, and let θ′ be an angle in A−. Observe that I(θ′, 1/k) ∩ A+≠∅ since A− contains no interval and A−∪ A+=[0, π/2). So there is a sequence
Consider now the case that A− contains an interval. Since A+≠∅, there is an interval in A− with an endpoint
We show the uniqueness of the smallest-area compact convex G4-covering of
Let X be a convex quadrilateral. Then both
3.2 An equilateral triangle covering of closed curves
Unfortunately, the isosceles right triangle with legs of length 1 is not a G4-coverings of
Naturally, the equilateral triangle of height 1 is a G4-covering of

The smallest equilateral triangle Δβ containing a pair of orthogonal unit segments
Theorem 4
The equilateral triangle Δβis a convexG4-covering of all closed curves of length 2.
Definition 1
A closed curve γ is called G-brimful for a set Λ if it can be placed in Λ but cannot be placed in any smaller scaled copy of Λ under G transformation.
To prove Theorem 4, we consider the following claim.
Claim 1
The length of any G 4-brimful curve for Δβis at least 2.
The claim implies that any closed curve of length smaller than 2 can be placed in Δβ under G4 transformation, but it is not G4-brimful for Δβ. Thus, if the claim is true, then every closed curve of length 2 can be placed in Δβ under G4 transformation, so Theorem 4 holds. Thus, we will prove the claim.
Let γ be a G4-brimful curve for Δβ. Let
As illustrated in Figure 4(a), the intersection

(a)
Lemma 3
The perimeter ℓ(H) equals
Proof. Let δ be the side length of Δβ. The intersection X0,2=ϒ0∩ϒ2 is a hexagon where γ touches all of its six (possibly degenerate) edges. Then, (ϒ0∪ϒ2)∖ X0,2 consists of six equilateral triangles, and the total sum of the perimeters of them is ℓ(ϒ0) + ℓ(ϒ2)=3(a0 + a2) δ. On the other hand, one edge of each equilateral triangle contributes to the boundary polygon of X0,2, hence ℓ(X0,2)=(a0 + a2)δ. Similarly, the perimeter of X1,3=ϒ1∩ϒ3 is (a1 + a3)δ.
Let
The third equality comes from
The following lemma states the relation between the lengths of γ and H.

Illustration of the proof of Lemma 4
Lemma 4
Let
P
be a (possibly degenerate) convex 12-gon with edges
e
k
of slopes
Proof. Let C be a convex 12-gon such that one vertex lies on each edge of P, and let Let pk be the vertex of C on ek for k=0, ⋅, 11. The boundary of C connects the points from p0, ⋅, p12 in counter-clockwise order along the boundary of P, where p12 is a duplicate of p0. We also assume that p12 is on e12 which is a duplicate of e0. For k=1, ⋅, 11 we reflect the edges ek+1, ⋅, e12 about the edge ek. Then, the edges e0, …,e12 are transformed to a zigzag path alternating between a horizontal edge and an edge of slope 2π/12, and C becomes the path connecting p0, p1, p′2, ⋅, p′12 where p′k is the location of pk after the series of reflections for k=2, ⋅, 12. Thus, ℓ(C) is at least the distance between p0 to p′12. See Figure 5 for an illustration. The vector x=p0p′12 is the sum of a horizontal vector a and another vector b of slope π/6 such that ∣a∣ + ∣b∣=ℓ(P). The size ∣x∣ of x is minimized when ∣a∣=∣b∣ attains the value (∣a∣+∣b∣) cos (π/12). Thus ∣x∣ ⩾ ℓ(P) cos (π/12) and ℓ(C) ⩾ ℓ(P) cos (π/12). □
From Lemma 4, the following corollary is immediate.
Corollary 5
For any G 4-brimful curve γ for Δβ, we have ℓ(γ) ⩾ ℓ(H) cos (π/12) whereH=H(γ).
Lemma 3 and Corollary 5 imply we have ℓ(γ) ⩾ ℓ(H) cos (π/12)=(a0+ a1 + a2+ a3)/2=2, which proves Claim 1. . The claim is proved.
3.3 Minimality of the covering

Examples of G4-brimful curves of length 2
There are many G4-brimful curves of length 2, and some examples are illustrated as red curves (the line segment is considered as a degenerate closed curve) in Figure 6 together with the (possibly degenerate) 12-gons they inscribe. Based on them, we conjecture that Δβ is the smallest-area convex G4-covering of SC.
Conjecture 1
Δβis the smallest-area convexG4-covering ofSC.
Although we have not yet proven the conjecture rigorously, we can prove that Δβ is minimal.Recall that Δβ has a horizontal base. Let S be the set of unit line segments that can be included in Δβ under translation (without considering the Z4-action). Then A=[0, π/12]∪[3π/12, 5π/12]∪[7π/12, 9π/12]∪[11π/12, π] is the set of slope angles of the line segments of S. Let A′=(0, π/12)∪(3π/12, 5π/12)∪(7π/12, 9π/12)∪(11π/12, π) and let SA′ be the set of all unit line segments of slopes in A′.
Lemma 5
Δβis the smallest-area closed convexT-covering of SA′.
Proof. Consider six unit segments of slopes π/12+i·π/6 for i=0, 1, ⋅, 5. Then any compact convex T-covering of SA′ contains these six unit segments under translation.
By [1, Theorem 9] there exists a triangle that is the smallest-area convex T-covering of any given set of segments. More specifically, every segment of the set is placed with its center at the origin, and the smallest-area affine-regular hexagon that contains the segments is considered. It is proved that a triangle Δ such that the hexagon is the Minkowski symmetrization of Δ, which is
Observe that the smallest-area affine-regular hexagon containing the six unit segments that we consider is the Minkowski symmetrization of Δβ, which is
Proposition 1
Δβis a minimal closed convexG4-covering ofSC.
Proof. Suppose that P⊆Δβ is a closed subset and a G4-covering of SC. Observe that, for each angle θ in A′, A does not contain
4 G k -covering of unit line segments
Consider the smallest-area convex Gk-covering of the set
Theorem 5
If
k=3 is odd, then the smallest area of a convexGk-covering of
Proof. We have already seen a proof for k=4, and it can be generalized asfollows. Let Λ be a smallest-area convex Gk-covering of
First we consider the case where k is odd. Since Zk consists of 2iπ/k rotations for i=0, 1, 2, ⋅, k − 1, one of the unit segments of slopes
Let A={f(θ)∣ 0 ⩽ θ<2π/k } be the set of angles, let AC denote the complement of A, and let s(θ) be a unit segment of slope θ. There exists an angle
On the other hand, let Δ XYZ be a triangle with bottom side XY of length 1 and height sin (π/k) such that π/2 ⩽ ∠ X ⩽ (k−1)π/k. Then ∠ Y+∠ Z ⩾ π/k. We show that any segment of slope θ with 0 ⩽ θ ⩽ π/k can be placed within Δ XYZ. Any unit line segment of slope θ1 with 0 ⩽ θ1 ⩽ ∠ Y can be placed within Δ XYZ with one endpoint at Y, and any unit line segment of slope θ2 with ∠ Y ⩽ θ2 ⩽ max{∠ Y, π/k} can be placed within Δ XYZ with one endpoint at Z. Thus, any segment of slope θ with 0 ⩽ θ ⩽ π/k can be placed within Δ XYZ.
The case where k is even can be handled analogously; the only difference is that the area is minimized at i=k/2 − 1. As in the case of odd k, a triangle satisfying the conditions stated in Theorem 5 is a Gk-covering. □
5 Covering under rotation by 120 degrees
We construct a convex G3-covering Γ3 of SC as follows. Let Γ be the convex region bounded by y2=1 + 2x and y2=1 − 2x and containing the origin O. Then Γ3 is the convex subregion of Γ bounded by the x-axis and the line y=2/3. The area of Γ3 is

(a) Illustration of Γ3 (b)H=L0∩ Lπ/3∩ L2π/3
We show that Γ3 is a G3-covering of SC. We first show a few properties that we use for proving Theorem 6. Let Γ+ be the region of Γ above the x-axis. We call the boundary segment on the x-axis the bottom side, the boundary curve on
Lemma 6
Any closed T-brimful curve for Γ+has length at least 2.
Proof. Recall the definition of a G-brimful curve in Definition 1. Consider a closed T-brimful curve γ of minimum length for Γ+. Observe that γ touches every side of Γ+; otherwise γ can be translated to lie in the interior of Γ+. Let ΔXYZ be a triangle for the touching points X, Y, Z of the curve with the boundary of Γ+. Since ℓ(γ) ⩾ ℓ(ΔXYZ), γ is ΔXYZ.

Illustration of the proof of Lemma 6
Without loss of generality, we assume that X is on the left side, Z is on the right side, and Y is on the bottom side of Γ+. If X and Y are at (−1/2, 0), or X and Z are at (0, 1), or Y and Z are at (1/2, 0), then γ becomes a line segment and the length of the line segment is larger than or equal to 1. Thus ℓ(γ)⩾2.
Now we assume that none of X, Y and Z is on a corner of Γ+. Let ℓX be the line tangent to the left side of Γ+ at X. Let Z′ be the point symmetric to Z with respect to the x-axis, and let
We claim that
Suppose that XZ is not horizontal. By the collinearity of
Since XZ is horizontal, Y is at the origin. Thus ΔXYZ is an isosceles triangle with base XZ, and ℓ(ΔXYZ)=2 by the construction of Γ+. □
The following lemma shows the convexity of the perimeter function on the convex hull of planar figures under translation.
Lemma 7
(Theorem 2 of [2]. Givenkcompact convex figuresC1, C2, ⋅, CkCi for i=1, ⋅, kin the plane, the perimeter function
For compact convex figures that have point symmetry in the plane, we can show an optimal translation of them using the convexity of the perimeter function in Lemma 7.
Lemma 8
Given
k
compact convex figures
C
1, C2, ⋅, CkForkcompact convex figuresCi for i=1, ⋅, kthat have point symmetry in the plane, the perimeter function
Proof. Without loss of generality, we assume that the k compact convex figures are given with centers all lying at the origin. Let r=(r1, ⋅, rk) ∈ ℝ2k be a vector such that the perimeter of their convex hull of Ci(r) is minimized among all translation vectors in ℝ2k. Then −r=(−r1, ⋅, −rk) is also a vector such that the convex hull of Ci(−r) has the minimum perimeter. This is because the two convex hulls are symmetric to the origin. Since the perimeter function is convex by Lemma 7, the convex hull of
We are now ready to prove a main result.
Theorem 6
Γ3is a convexG3-covering of all closed curves of length 2.
Proof. By Lemma 6, any closed curve of length 2 can be included in Γ+ under translation. Let C be a closed curve of length 2 that is contained in Γ+ and touches its bottom side, and let
Suppose that C crosses the top side of Γ3. Let s be a segment contained in
Assume now to the contrary that neither C1 nor C2 is contained in Γ3. Then both curves cross the top side of Γ3. For i=1, 2 let si be a line segment contained in the convex hull of Ci and connecting the top side and the bottom side of Γ3 such that the upper endpoint of si lies in the interior of the convex hull of Ci; see Figure 7(a). Then there is a rotated and translated copy
Now consider a translation of these three segments such that their midpoints coincide, meet ???? at a point, and let Φm be the convex hull of the three translated segments. By Lemma 8, ℓ(Φm) ⩽ ℓ(Φ). For 0 ⩽ θ < π let Lθ denote the slab of minimum width at orientation θ for 0 ⩽ θ < π that contains Φm. Let dθ be the width of Lθ. Consider the three slabs L0, Lπ/3 and L2π/3 of Φm. Observe that dθ for θ=0, π/3, 2π/3 is at least the height of Γ3, which is 2/3. Let H=L0∩ Lπ/3∩ L2π/3 as shown in Figure 7(b). Then Φm is contained in H and touches every side of H. Since H is a (possibly degenerate) hexagon, ℓ(Φm) ⩾ d0+dπ/3+d2π/3⩾2, which can be shown by a proper tiling of copies of H as in Lemma 1. Thus ℓ(Φm)⩾2, which is a contradiction to ℓ(Φm) ⩽ ℓ(Φ)<2. □
Recall that the smallest-area convex G2-covering Δ1 and the G4-covering Δβ of SC are equilateral triangles. Our G3-covering Γ3 has area smaller than the area of Δ1, but a bit larger than the area of Δβ, which sounds reasonable. However, it may look odd that Γ3 is not invariant under any discrete rotation while Δ1 and Δβ are invariant under rotation by 2π/3.
Theorem 7
Any convex G 3-covering invariant under rotation by 2π/3 orπ/2 has area strictly larger than the area of Γ3.
Proof. Let Λ2π/3 be a convex G3-covering which is invariant under rotation by 2π/3. Then Λ2π/3 is a T-covering of all unit segments of any slope θ with 0 ⩽ θ<π. As Since Δ1 is the smallest-area convex T-covering of the set of all unit segments by Theorem 1, the area of Λ2π/3 is at least the area of Δ1, which is strictly larger than the area of Γ3.

(a) siπ/2 is contained in Λπ/2 for i=1, 2, 3. (b) The convex hull of
Let Λπ/2 be a convex G3-covering which is invariant under rotation by π/2. Assume that a unit segment s of slope π/4 is contained in Λπ/2. Since Λπ/2 is a G3-covering, there is a unit segment of one of slopes slope in {0, π/3, 2π/3} contained in Λπ/2. Assume that a unit segment t of slope π/3 is contained in Λπ/2. Since Λπ/2 is invariant under rotation by π/2, there are a unit segment s′ of slope 3π/4=π/4+π/2 and a unit segment t′ of slope 5π/6=π/3+π/2 contained in Λπ/2. Thus, the four segments s, s′, t, t′ are contained in Λπ/2.
Let c be the point of symmetry of Λπ/2. Let Φ be the convex hull of the translated copies of s, s′, t, t′ such that their midpoints are all at c. We will prove that the area ∣Λπ/2∣ of Λπ/2 is at least the area ∣Φ∣ of Φ.
Suppose that the midpoint of s is not at c. Let siπ/2 beobtained by rotating s around c by iπ/2 for i=1, 2, 3. Since Λπ/2 is regular invariant under the rotation by π/2, siπ/2 is contained in Λπ/2 for every i=1, 2, 3. Since Λπ/2 is convex, the convex hull Φ1 of s and the segments siπ/2 for i=1, 2, 3 is contained in Λπ/2, and thus ∣Λπ/2∣ ⩾ ∣Φ1∣. See Figure 9(a).
Let
We can show this for unit segments of slopes 0 and 2π/3 contained in Λπ/2 in a similar way. □
6 Covering of triangles under rotation by 120 degrees
6.1 Construction
Let St be the set of all triangles of perimeter 2. We construct a convex G3-covering of St, denoted by

Construction: (a) The covering Γ3 (b) The trajectories of X, Y and Z (c) The G3-covering
Imagine that Δ rotates in a clockwise direction such that X moves along the left side and Y moves along the bottom side of Γ3. Let t denote the x-coordinate of X and θ=∠XYO. Then
We show that
We obtain
where
Now we estimate the area of
where f(x) is the function of γDE such that
Thus the area of
6.2 Covering of triangles of perimeter 2
We show that
Lemma 9
Let ΔXYZbe a triangle of perimeter 2 contained in Γ+. If it is on the left of ℓOEor on the right of ℓOB(including the lines), then
Proof. If ΔXYZ lies on the left of ℓOE (including the line), then ΔXYZ lies in between ℓOE and the line ℓ tangent to Γt at B. The two lines have slope π/3 and are at distance

(a) ΔXYZ lying on the left of ℓOE. There is a copy Δ that is contained in
In the following, we assume that ΔXYZ is contained in Γ3 but it is not contained in
Lemma 10
Let ΔXYZbe a triangle contained in Γ3such thatXis atA, Yis on the right of ℓOE, andZ ∈ R2. Then
Proof. Let

(a) ΔXYZ with Z ∈ R2. (b) A rotated copy
If
We can also show that
Lemma 11
Let ΔXYZbe a triangle contained in Γ3such thatXis onγOA, Yis on the right of ℓOEandZ ∈ R1. Then
Before proving this, we need a few technical lemmas.
Lemma 12
Let ΔXYZbe an isosceles triangle of perimeter 2 such that its baseYZis of length ⩾2/3, at least 2/3, and letX ∈ γOA, Y ∈ γEFandZ ∈ ℓBE. Then ΔXYZcan be rotated in clockwise direction within
Proof. By Lemma 6, Z lies on BE. Let

(a) An isosceles triangle Δ XYZ and a translated copy
Let ΔUVW be an equilateral triangle with base VW of length ∣VW∣=2/3, W lying at B, and U lying at O. Observe that
Let p be a point in

(a) The convex hull Q of an equilateral triangle Δ UVW and p (b) Rotated copy Q(θ) of Q by θ around O (c) Translated copy
Since ΔUVW is an equilateral triangle,
Observe that sin θ cos θ0⩾0. Since 0< sin θ0 sin (θ0−θ)<1, it suffices to show that (sin (θ0−θ)− sin θ0)+ sin θ>0 to show g1(θ0)>0. Let
Let Φ be the convex hull of
Consider the rotation for θ′ from π/3 to π/2. Observe that
Now we claim that
For a fixed θ′ with π/3 ⩽ θ′ ⩽ π/2, we can translate
Lemma 13
Let ΔXYZbe an isosceles triangle of perimeter 2 such that its baseYZis of length at least 2/3, and letY ∈ γOAandZ ∈ γEF. Then the line throughXand parallel toYZintersectsγOB.
Proof. Let ℓX and ℓB be the lines parallel to YZ such that ℓX passes through X and ℓB passes through B. See Figure 15(a). Let θ=∠ZYF and let p denote the y-coordinate of Z. Then
We will show that for
We have
and with
For
Now we show that
Let t= sin θ. Then
Since
Observe that f(p, θ) is minimized at
Lemma 14
Let ΔXYZbe an isosceles triangle of perimeter 2 such that its baseYZis of length at least 2/3, Xlies above or on ℓYZ, Y ∈ γOAandZ ∈ γEF. Then ΔXYZis contained in
Proof. Let ΔXYZ be an isosceles triangle satisfying these conditions in the lemma statement with φ=∠XYZ and θ=∠ZYF. Observe that 0 ⩽ φ, θ ⩽ π/3. Let f(φ) be the y-coordinate of X. Then
Let ΔUVW be the equilateral triangle such that V ∈ γOA, W ∈ γEF and VW is parallel to YZ. Let ℓU be the line parallel to VW and passing through U. See Figure 15(b). Then X lies below or on ℓU by the proof of Lemma 13, and its y-coordinate f(φ) is smaller than or equal to the y-coordinate of U by the argument in the previous paragraph. Since U is on the boundary of
Now we are ready to prove Lemma 11.
Proof. Translate ΔXYZ to the right until Y meets γEF; see Figure 16(a). If
Consider Case (1) that XZ is the longest side. There are two subcases, ∣XY∣ ⩾ ∣YZ∣ or ∣XY∣ < ∣YZ∣. Suppose that ∣XY∣ ⩾ ∣YZ∣. Let

(a) ℓX lies below ℓB or ℓX=ℓB. (b) X lies below or on ℓU.

(a) Z ∈ R1 and ZX is the longest side. ΔXYZ is translated to the right until Y meets γEF. (b) A copy
Since
Suppose now that ∣XY∣ < ∣YZ∣. Let
Now consider Case (2) that YZ is the longest side. Translate ΔXYZ such that Y ∈ γEF and Z ∈ γBC. If ∣XY∣ ⩾ ∣ZX∣, then
Finally, consider Case (3) that XY is the longest side. Translate ΔXYZ such that X ∈ γOA and Y ∈ γEF. If ∣XZ∣ ⩽ ∣YZ∣, then
Combining Lemmas 9, 10 and 11, we have the following result.
Theorem 8
Observe that no proper subset of
7 Conclusion
We considered the smallest-area covering of planar objects of perimeter 2 allowing translations and discrete rotations of multiples of π, π/2 and 2π/3. We gave a geometric and elementary proof of the smallest-area convex coverings for translations and rotation of π while showing convex coverings for the other discrete rotations. We also gave the smallest-area convex coverings of all unit segments under translations and discrete rotations π/k for all integers k=3. Open problems include the optimality proof of the equilateral triangle covering for the rotation of multiples of π/2, and the smallest-area coverings allowing other discrete rotations with clean mathematical solutions.
Funding statement: Work by M. K. Jung and H.-K. Ahn was supported by the Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2017-0-00905, Software Star Lab (Optimal Data Structure and Algorithmic Applications in Dynamic Geometric Environment)) and (No. 2019-0-01906, Artificial Intelligence Graduate School Program (POSTECH)). S. D. Yoon was supported by “Cooperative Research Program for Agriculture Science & Technology Development (Project No. PJ015269032022)”, Rural Development Administration, Republic of Korea. Work by T. Tokuyama was partially supported by MEXT JSPS Kakenhi 20H04143.
8 Appendix
We give a proof of Corollary 4 using a reflecting argument similar to the proof of Theorem 2.
Proof. Given a worm γ, let γ′ be its largest scaled copy contained in Δ1. It suffices to show that the length of γ′ is not shorter than 1.
Observe that γ′ touches all three edges of Δ1, possibly touching two edges simultaneously at a vertex, since otherwise we can translate γ′ into the interior of Δ1 and get a larger scaled copy of γ′ contained in Δ1. If γ′ touches a vertex of Δ1, then it connects the vertex and the edge opposite to the vertex. Thus its length is not shorter than the height 1 of Δ1.
Consider the case that γ′ touches the three edges of Δ1 at three distinct points a, b, c along γ′ in that order. Then the length of γ′ is not shorter than the two-leg polyline abc with the joint point b. Let ℓ be the line containing the edge of Δ1 that contains b. Now, abc has the same length as abc′, where c′ is the reflection of c over ℓ. Consider the union of Δ1 and the reflected copy of Δ1 over ℓ. The union is a rhombus of height 1 containing a and c′ on opposite parallel edges. Thus the length of abc′ is at least 1, and we complete the proof. □
References
[1] H.-K. Ahn, S. W. Bae, O. Cheong, J. Gudmundsson, T. Tokuyama, A. Vigneron, A generalization of the convex Kakeya problem. Algorithmica 70 (2014), 152–170. MR3239787 Zbl 1314.5200210.1007/s00453-013-9831-ySearch in Google Scholar
[2] H.-K. Ahn, O. Cheong, Aligning two convex figures to minimize area or perimeter. Algorithmica 62 (2012), 464–479. MR2886052 Zbl 1311.6816110.1007/s00453-010-9466-1Search in Google Scholar
[3] S. W. Bae, S. Cabello, O. Cheong, Y. Choi, F. Stehn, S. D. Yoon, The reverse Kakeya problem. Adv. Geom. 21 (2021), 75–84. MR4203286 Zbl 1479.5202810.1515/advgeom-2020-0030Search in Google Scholar
[4] J. C. Baez, K. Bagdasaryan, P. Gibbs, The Lebesgue universal covering problem. J. Comput. Geom. 6 (2015), 288–299. MR3400942 Zbl 1408.52029Search in Google Scholar
[5] A. S. Besicovitch, On Kakeya's problem and a similar one. Math. Z. 27 (1928), 312–320. MR1544912 Zbl 0258375110.1007/BF01171101Search in Google Scholar
[6] K. Bezdek, R. Connelly, Covering curves by translates of a convex set. Amer. Math. Monthly 96 (1989), 789–806. MR1033346 Zbl 0706.5200610.1080/00029890.1989.11972283Search in Google Scholar
[7] P. Brass, W. Moser, J. Pach, Research problems in discrete geometry. Springer 2005. MR2163782 Zbl 1086.52001Search in Google Scholar
[8] H. T. Croft, K. J. Falconer, R. K. Guy, Unsolved problems in geometry. Springer 1991. MR1107516 Zbl 0748.5200110.1007/978-1-4612-0963-8Search in Google Scholar
[9] Z. Füredi, J. E. Wetzel, Covers for closed curves of length two. Period. Math. Hungar. 63 (2011), 1–17. MR2853167 Zbl 1265.5202010.1007/s10998-011-7001-zSearch in Google Scholar
[10] P. Gibbs, An Upper Bound for Lebesgue's Covering Problem. Preprint 2018, arXiv:1810.10089Search in Google Scholar
[11] B. Grechuk, S. Som-am, A convex cover for closed unit curves has area at least 0.0975. Internat. J. Comput. Geom. Appl. 30 (2020), 121–139. MR4224201 Zbl 1508.6838610.1142/S0218195920500065Search in Google Scholar
[12] B. Grechuk, S. Som-am, A convex cover for closed unit curves has area at least 0.1. Discrete Optim. 38 (2020), Article ID 100608, 15 pages. MR4143497 Zbl 1506.5203010.1016/j.disopt.2020.100608Search in Google Scholar
[13] S. Kakeya, Some problems on maxima and minima regarding ovals. Tohoku Science Reports 6 (1917), 71–88. Zbl 46.1119.02Search in Google Scholar
[14] L. Moser, Poorly formulated unsolved problems of combinatorial geometry. Mimeographed, 1966.Search in Google Scholar
[15] W. O. J. Moser, Problems, problems, problems. Discrete Appl. Math. 31 (1991, 201–225. MR1106701 Zbl 0817.5200210.1016/0166-218X(91)90071-4Search in Google Scholar
[16] R. Norwood, G. Poole, An improved upper bound for Leo Moser's worm problem. Discrete Comput. Geom. 29 (2003), 409–417. MR1961007 Zbl 1028.5200110.1007/s00454-002-0774-3Search in Google Scholar
[17] J. Pál, Ein Minimumproblem für Ovale. Math. Ann. 83 (1921), 311–319. MR1512015 Zbl 0260303010.1007/BF01458387Search in Google Scholar
[18] C. Panraksa, W. Wichiramala, Wetzel's sector covers unit arcs. Period. Math. Hungar. 82 (2021), 213–222. MR4260141 Zbl 1488.5200910.1007/s10998-020-00354-xSearch in Google Scholar
[19] J.-w. Park, O. Cheong, Smallest universal covers for families of triangles. Comput. Geom. 92 (2021), Paper No. 101686, 10 pages. MR4126371 Zbl 1471.5201710.1016/j.comgeo.2020.101686Search in Google Scholar
[20] J. E. Wetzel, Triangular covers for closed curves of constant length. Elem. Math. 25 (1970), 78–82. MR266051 Zbl 0199.57201Search in Google Scholar
[21] J. E. Wetzel, On Moser's problem of accommodating closed curves in triangles. Elem. Math. 27 (1972), 35–36. MR295214 Zbl 0228.50013Search in Google Scholar
[22] J. E. Wetzel, Sectorial covers for curves of constant length. Canad. Math. Bull. 16 (1973), 367–375. MR362009 Zbl 0271.510.4153/CMB-1973-058-8Search in Google Scholar
[23] J. E. Wetzel, Fits and covers. Math. Mag. 76 (2003), 349–363. MR2085394 Zbl 1059.5202210.1080/0025570X.2003.11953209Search in Google Scholar
[24] W. Wichiramala, A smaller cover for closed unit curves. Miskolc Math. Notes 19 (2018), 691–698. MR3895606 Zbl 1463.5200710.18514/MMN.2018.2485Search in Google Scholar
© 2023 Walter de Gruyter GmbH, Berlin/Boston
This work is licensed under the Creative Commons Attribution 4.0 International License.
Articles in the same Issue
- Frontmatter
- Exploring tropical differential equations
- On the bond polytope
- Universal convex covering problems under translations and discrete rotations
- Ehrhart theory of paving and panhandle matroids
- A partial compactification of the Bridgeland stability manifold
- The geometry of discrete L-algebras
- Projective self-dual polygons in higher dimensions
Articles in the same Issue
- Frontmatter
- Exploring tropical differential equations
- On the bond polytope
- Universal convex covering problems under translations and discrete rotations
- Ehrhart theory of paving and panhandle matroids
- A partial compactification of the Bridgeland stability manifold
- The geometry of discrete L-algebras
- Projective self-dual polygons in higher dimensions