Rook-Drawing for Plane Graphs
Motivated by visualization of large graphs, we introduce a new type of graph drawing called “rook-drawing”. A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs. We then characterize the maximal planar graphs admitting a planar straight-line rook-drawing, which are unique for a given order. Finally, we give a linear time algorithm to compute a polyline planar rook-drawing for plane graphs with at most \(n-3\) bent edges.
- 7.Di Giacomo, E., Didimo, W., Kaufmann, M., Liotta, G., Montecchiani, F.: Upward-rightward planar drawings. In: The 5th International Conference on Information, Intelligence, Systems and Applications, IISA 2014, pp. 145–150. IEEE (2014)Google Scholar
- 9.de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting fary embeddings of planar graphs. In: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 426–433. ACM (1988)Google Scholar
- 14.Schnyder, W.: Embedding planar graphs on the grid. Symp. Discrete Algorithms 90, 138–148 (1990)Google Scholar