We construct an *N*-node graph *G* which has
(i) a layout with area *O*(*N*) and maximum edge length
*O*(*N*^{1/2}),
(ii) a layout with area
*O*(*N*^{5/4}) and maximum edge length
*O*(*N*^{1/4}).
We prove for
that any layout for *G* with
area *N f*(*N*) has an edge of length
.
Hence *G* has no layout which is optimal with respect to both measures.