Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract)

Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 354-361(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_33).

Full text not available from this repository.

Abstract

We introduce a new approach to orthogonal drawings of planar graphs. We define invariants that are respected by every drawing of the graph. The invariants are the embedding together with relative positions of adjacent vertices. Insertions imply only minor changes of the invariants. This preserves the users mental map. Our technique is applicable to two-connected planar graphs with vertices of arbitrary size and degree. New vertices and edges can be added to the graph in O(log n) time. The algorithm produces drawings with at most m + f bends, where m and f are the number of edges and faces of the graph.

Item Type:	Conference Paper
Additional Information:	10.1007/3-540-36151-0_33
Classifications:	M Methods > M.300 Dynamic / Incremental / Online G Algorithms and Complexity > G.999 Others M Methods > M.600 Planar G Algorithms and Complexity > G.210 Bends P Styles > P.600 Poly-line > P.600.700 Orthogonal P Styles > P.999 Others P Styles > P.540 Planar
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/321

Actions (login required)

View Item