the asteroid surveying problem and other puzzles

We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the shortest curve that starts at the origin and intersects all planes at unit distance from the origin. Several possible solutions are suggested in the video, including a curve of length less than 12.08. The second version (the “river shore” problem) asks for the shortest curve in the plane that has unit width. A solution of length 2.2782 . . . is described, which we have proved to be optimal. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—geometrical problems and computations General Terms Theory Keywords curves, geometric constants

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
• Keywords: COMPGEOM 2003, Several Possible Solutions, Shortest Curve, first Version