Upward Drawing on the Plane Grid Using Less Ink (Extended Abstract)

Jourdan, Guy-Vincent and Rival, Ivan and Zaguia, Nejib (1995) Upward Drawing on the Plane Grid Using Less Ink (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 318-327(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_387).

Full text not available from this repository.

Abstract

Any upward drawing D(P) on a two-dimensional integer grid I, of an ordered set P, has completion \bar{P} with an upward drawing D(\bar{P}) on a two-dimensional integer grid \bar{I} such that the total edge length of D(\bar{P}) does not exceed the total edge length of D(P). Moreover, by (possibly) translating vertices, there is an upward drawing D(P) on I such that \bar{I} = I. Thus, any integer grid embedding of a two-dimensional ordered set can be extended to a planar upward drawing of its completion, on the same integer grid, without increasing the total edge length.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_387
Classifications: P Styles > P.840 Upward
M Methods > M.999 Others
G Algorithms and Complexity > G.070 Area / Edge Length
URI: http://gdea.informatik.uni-koeln.de/id/eprint/201

Actions (login required)

View Item View Item