Universal convex covering problems under translations and discrete rotations
From MaRDI portal
Publication:6060891
DOI10.1515/advgeom-2023-0021zbMath1526.52014arXiv2211.14807OpenAlexW4387621387MaRDI QIDQ6060891
Takeshi Tokuyama, Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn
Publication date: 6 November 2023
Published in: Advances in Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.14807
Computational aspects related to convexity (52B55) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- A generalization of the convex Kakeya problem
- Covers for closed curves of length two
- Smallest universal covers for families of triangles
- Problems, problems, problems
- Unsolved problems in geometry
- An improved upper bound for Leo Moser's worm problem
- Wetzel's sector covers unit arcs
- A convex cover for closed unit curves has area at least 0.1
- Aligning two convex figures to minimize area or perimeter
- Triangular covers for closed curves of constant length
- On Moser's problem of accommodating closed curves in triangles
- The reverse Kakeya problem
- The Lebesgue universal covering problem
- Research Problems in Discrete Geometry
- Sectorial Covers for Curves of Constant Length
- Covering Curves by Translates of a Convex Set
- Fits and Covers
- A Convex Cover for Closed Unit Curves has Area at Least 0.0975
- A smaller cover for closed unit curves
This page was built for publication: Universal convex covering problems under translations and discrete rotations
