Kakeya problem
Kakeya problem
[kä ′kā·ə ‚präb·ləm] (mathematics)
The problem of finding the plane figure of least area within which a unit line segment can be moved continuously so as to return to its original position with its end points reversed; in fact, there is no such minimum area.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.