On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
The VLSI layout problem in various embedding models
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Drawing graphs on rectangular grids
Discrete Applied Mathematics
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
2-Visibility Drawings of Planar Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
A Pairing Technique for Area-Efficient Orthogonal Drawings
GD '96 Proceedings of the Symposium on Graph Drawing
Interactive Orthogonal Graph Drawing: Algorithms and Bounds
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Two Algorithms for Finding Rectangular Duals of Planar Graphs
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Optimal three-dimensional orthogonal graph drawing in the general position model
Theoretical Computer Science
Rectangular drawings of planar graphs
Journal of Algorithms
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Manhattan-Geodesic embedding of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Hamiltonian orthogeodesic alternating paths
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Hi-index | 0.00 |
We consider orthogonal drawings in the general position model, i.e., no two points share a coordinate. The drawings are also required to be bend minimal, i.e., each edge of a drawing in k dimensions has exactly one segment parallel to each coordinate direction that are glued together at k-1 bends. We provide a precise description of the class of graphs that admit an orthogonal drawing in the general position model in the plane. The main tools for the proof are Eulerian orientations of graphs and discrete harmonic functions. The tools developed for the planar case can also be applied in higher dimensions. We discuss two-bend drawings in three dimensions and show that K"2"k"+"2 admits a k-bend drawing in k+1 dimensions. If we allow that a vertex is placed at infinity, we can draw K"2"k"+"3 with k bends in k+1 dimensions.