Computational geometry: an introduction
Computational geometry: an introduction
SIAM Journal on Computing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Issues in Interactive Orthogonal Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Interactive Orthogonal Graph Drawing: Algorithms and Bounds
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Designing Graph Drawings by Layout Graph Grammars
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
| Hi-index | 0.00 |
We introduce a newapproac h 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. Newv ertices 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.