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.
Official URL: http://dx.doi.org/10.1007/3-540-36151-0_33
AbstractWe 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.
Actions (login required)
|