## Shortest closed curve to inspect a sphere

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let $S$ be a sphere in $\mathbb{R}^3$. Let $C$ be a closed curve in $\mathbb{R}^3$ disjoint from and exterior to $S$ which has the property that every point $x$ on $S$ is visible to some point $y$ of $C$, in the sense that the segment $xy$ intersects $S$ at precisely the one point $x$. I am interested in the shortest $C$ with this property. In computational geometry, such paths are called watchman tours, and there are many results concerning polygons in the plane finding such tours.

This question arose at a conference I'm attending, and I was pointed to a paper by V. A. Zalgaller:

"Shortest Inspection Curves for the Sphere" (Journal of Mathematical Sciences, Volume 131, Number 1, 5307-5320; Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 299, 2003, pp. 87–108.)

I cannot access the paper from the conference, but from the abstract it appears he focused on open rather than closed curves.

Has anyone heard of this natural question? Can you point me to relevant literature? Thanks!

Addendum. Here is the $4\pi$ saddle / baseball-stitches curve suggested by Gjergji Zaimi:

-

10
My guess is $4\pi R$, which I can achieve gluing 4 semicircles of radius $R$ (saddle shape). My attempts at finding a clever way to prove the lower bound using a Crofton formula have failed though... – Gjergji Zaimi Jun 29 2011 at 9:51

2
It is also the single boundary curve remaining on this figure: take the favorite cylinder of Archimedes, having height and diameter $2R.$ Take a saw and cut it in half on a plane that contains the axis of rotation. Now you have two shapes, each a cylinder over a semicircle, and each having a flat square as one face. Rotate one piece 90 degrees with respect to the other, so that the squares match up, and glue back together. – Will Jagy Jun 29 2011 at 17:57

4
(of course if we allow unions of closed curves, the infimum of length is 0, e.g. C = 6 small circles, each passing through a vertex of the cube $[−1,+1]^3$, or even C = the vertices themselves, as a degenerate case). – Pietro Majer Jun 30 2011 at 8:35

6
It is not difficult to see that if the curve is at constant distance from the sphere, then its length is at least $4\pi$. Indeed suppose that it is a constant distance $r$ from the center. The area of the set of points newly seen from a short segment of length $ds$ is $a(r)ds$, with $a(r)=2\sqrt{r^2-1}/r^2$. This is maximal for $r=\sqrt{2}$, then $a=1$. Since each point of the sphere is "newly seen" from at least one point of the curve, the result follows. The curve proposed by Gjergji Zaimi is at constant distance from the center, so it is optimal at least in this restricted sense. – Jean-Marc Schlenker Jul 2 2011 at 6:24

3
This problem appears in the last lines of a math popularization article by Jean-Baptiste Hiriart-Urruty, Du calcul différentiel au calcul variationnel, in Quadrature 70(2008):8-18, see www.math.univ-toulouse.fr/~jbhu/Fermat_Quadrature.pdf There the problem is presented as open and attributed to Alain Grigis. – Jean-Marc Schlenker Jul 5 2011 at 6:15
show 15 more comments
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 25, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9354814887046814, "perplexity_flag": "head"}