Interactive Orthogonal Graph Drawing: Algorithms and Bounds

Fößmeier, Ulrich (1998) Interactive Orthogonal Graph Drawing: Algorithms and Bounds. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 111-123(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_55).

Full text not available from this repository.

Abstract

Incremental graph drawing is a model gaining more and more importance in many applications. We present algorithms that allow insertions of new vertices into an existing drawing without changing the position of the objects drawn so far. We prove bounds for the quality of our drawings and considerably improve on previous bounds. Here the number of bends and the used area are our quality measures. Besides we discuss lower bounds for this problem.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_55
Classifications: M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/72

Actions (login required)

View Item View Item