O. Aichholzer, M. Hoffmann, M. V. Kreveld, and G. Rote
We study plane straight-line embeddings of graphs where certain edges are
specified to be longer than other edges. We analyze which graphs are
universal in the sense that they allow a planar embedding for any total,
strict order on the edge lengths. In addition, we also briefly consider
circular arc drawings with relative edge length specifications.
