Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment?
Sep 10, 2012 · This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated ...
This can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within ...
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment?
Sep 12, 2012 · This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated.
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a ...
Oct 1, 2014 · This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated through 360 ...
In this paper, we describes a method for determining the minimum bounding ball of a set of 2D convex polygon based on Chan's algorithm which consist of ...
People also ask
What is the generalization from the nature of images formed by convex?
What is the generalization from the nature of images formed by concave mirror?
Jul 27, 2013 · I'm intruiged by the Kakeya Needle problem, described here on Wikipedia. Wikipedia has a nice animation of a needle turning through a hypo-cycloid.
In mathematics, a Kakeya set, or Besicovitch set, is a set of points in Euclidean space which contains a unit line segment in every direction.