Abstract
We introduce and study level-planar straight-line drawings with a fixed number λ of slopes. For proper level graphs (all edges connect vertices of adjacent levels), we give an O(nlog2n/loglogn) -time algorithm that either finds such a drawing or determines that no such drawing exists. Moreover, we consider the partial drawing
... read more