Let $E=\{e_1,\ldots,e_n\}$ be a set of $C$-oriented disjoint segments in the plane, where $C$ is a given finite set of orientations that spans the plane, and let $s$ and $t$ be two points. %(We also require that for each orientation in $C$, its opposite orientation is also in $C$.) We seek a minimum-link $C$-oriented tour of $E$, that is, a polygonal path $\pi$ from $s$ to $t$ that visits the segments of $E$ in order, such that, the orientations of its edges are in $C$ and their number is minimum. We present an algorithm for computing such a tour in $O(|C|^2 \cdot n^2)$ time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which $E$ is a set of not-necessarily-disjoint $C$-oriented polygons.

翻译：令$E=\{e_1,\ldots,e_n\}$为平面上一组$C$方向不相交线段，其中$C$是给定的有限方向集合且可张成平面，并令$s$和$t$为两个点。我们寻求$E$的最少链接$C$方向遍历，即从$s$到$t$的多边形路径$\pi$，该路径按顺序访问$E$中的线段，且其边的方向均属于$C$，同时边的数量最小。我们提出了一种在$O(|C|^2 \cdot n^2)$时间内计算此类遍历的算法。该问题已涵盖研究更一般问题（其中$E$为一组未必不相交的$C$方向多边形）时遇到的大部分难点。