On translating a set of line segments

Abstract An optimal one-pass algorithm is presented for the computation of an ordering for a set of line segments in the plane according to which the segments can be moved to the right by an arbitrary fixed distance, such that during the move no segment meets another.