A generalization of the convex Kakeya problem

DOI10.1007/s00453-013-9831-yzbMath1314.52002arXiv1209.2171OpenAlexW1833243817MaRDI QIDQ486985

Sang Won Bae, Joachim Gudmundsson, Hee-Kap Ahn, Takeshi Tokuyama, Antoine Vigneron, Otfried Schwarzkopf

Publication date: 19 January 2015

Published in: Algorithmica, LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.2171

zbMATH Keywords

algorithmscomputational geometryKakeya problem, convex sets

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (3)

Smallest universal covers for families of triangles ⋮ Universal convex covering problems under translations and discrete rotations ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimum mean width translation cover for sets of diameter one
• Aligning two convex figures to minimize area or perimeter
• Sets of constant width
• Extremalprobleme für konvexe Bereiche der euklidischen Ebene
• Sectorial Covers for Curves of Constant Length
• Covering Curves by Translates of a Convex Set
• On the densest packing of convex discs
• Maximum area with Minkowski measures of perimeter
• From harmonic analysis to arithmetic combinatorics
• On a Problem of Besicovitch
• The Kakeya Problem
• On Fundamental Geometric Properties of Plane Line-Sets

This page was built for publication: A generalization of the convex Kakeya problem