Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
Given an orthogonal representation $H$ with $n$ vertices and bends, we study the problem of computing a planar orthogonal drawing of $H$ with small area. This problem has direct applications to the development of practical graph drawing techniques for information visualization and VLSI layout. In this paper, we introduce the concept of turn-regularity of an orthogonal representation $H$, provide combinatorial characterizations of it, and show that if $H$ is turn-regular (i.e., all its faces are turn-regular), then a planar orthogonal drawing of $H$ with minimum area can be computed in $O(n)$ time, and a planar orthogonal drawing of $H$ with minimum area and minimum total edge length within that area can be computed in $O(n^{7/4} \log n)$ time. We also apply our theoretical results to the design and implementation of new practical heuristic methods for constructing planar orthogonal drawings. An experimental study conducted on a test suite of orthogonal representations of randomly generated biconnected $4$-planar graphs shows that, on average, 95\ of the faces are regular and that our heuristic drawing methods perform better than previous ones.