We enumerate total cyclic orders on {1,...,n} where we prescribe the relative cyclic order of consecutive triples (i,i+1,i+2), these indices being taken modulo n. In some cases, the problem reduces to the enumeration of descent classes of permutations, which is done via the boustrophedon construction. In other cases, we solve the question by introducing mul-tidimensional versions of the boustrophedon. In particular we find new interpretations for the Euler up/down numbers and the Entringer numbers .