|A piecewise-linear directed path in the plane is defined by a sequence of
points (its vertices). It is said to be "ccw-turning"
if at each vertex (other than the first and last) as the path is traversed the
heading changes by more than 0
but less than 180 degrees counterclockwise. The path may intersect itself or
even trace over itself.
We are given a circle and the sequence of segment lengths that are encountered
as we traverse a ccw-turning path. You must place each vertex of the path on the circle.
What is the smallest Euclidean distance between the endpoints of such a path?
Your method will be given radius and a int segLength and should return the
minimum distance between the endpoints or -1 in case there is no such