Abstract
Given a finite set of points $S$ in $\R^d$, we consider visiting the points in $S$ with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number of segments (links).
Given a finite set of points $S$ in $\R^d$, we consider visiting the points in $S$ with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number of segments (links).