A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Level-Planar Drawings with Few Slopes
2021
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 𝑂(𝑛 log$^{2}$ 𝑛/ log log 𝑛)-time algorithm that either finds such a drawing or determines that no such drawing exists. Moreover, we consider the partial drawing extension problem, where we seek to extend an immutable drawing of a subgraph to a drawing of the whole graph, and the simultaneous drawing problem, which asks
doi:10.5445/ir/1000140541
fatcat:p6blstwpbvc7ldkom75x2lyu7a