On the circular cylinder, is constant, so the given line element reduces to . Unroll the circular cylinder with . The line element is then , so the usual Euclidean geometry formula measures arc length in the plane.
The endpoint has infinitely many lifts , with . For each lift, the straight line segment is shortest; its length is . Comparing the lifts gives the unrestricted shortest path on a circular cylinder:
If is a minimizing angular increment, a shortest geodesic is parametrized by , . This is a helix when both increments are nonzero, and a circular arc or vertical generator in the limiting cases. A nonminimal lift also gives a geodesic, but it is only shortest within its fixed winding class.
For , put . Then . At , both winding directions give distinct shortest paths of equal length.
For and , the shortest path on a circular cylinder has length
Its graph is triangular, with endpoint values zero and maximum at . In particular, increasing the angle to a full turn brings the endpoint back to the starting point.
For and , the corresponding length is
This graph has endpoint values one, a maximum at , and symmetry about . Each half is smooth, with horizontal slope at the outer endpoint; at the two halves meet at a corner, because the minimizing winding direction changes.
Figure 1.
Unrolling a cylinder and choosing the shorter angular route
. Original diagram. Left: two lifts of an endpoint at angular position and height one; the negative angular increment gives the shorter segment. Right: both requested shortest-length graphs for unit radius, with height differences zero and one. Details.