. . . . . "In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice."@en . . . . . . . . . . . . . . . "15936136"^^ . . . . . . . . "5939"^^ . "In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice."@en . . . . . . . . . . "1102073602"^^ . . . . . . "Bitonic tour"@en . . .