Rook-drawing for plane graphs
Abstract
Motivated by visualization of large graphs, we introduce a new type of graph drawing called ``rook-drawing".
A \emph{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.
Origin : Files produced by the author(s)
Loading...