Rook-drawing for plane graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Rook-drawing for plane graphs

Résumé

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.
Fichier principal
Vignette du fichier
rook_drawing.pdf (349.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01207960 , version 1 (01-10-2015)

Identifiants

  • HAL Id : hal-01207960 , version 1

Citer

David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun. Rook-drawing for plane graphs. 23rd International Symposium on Graph Drawing and Network Visualization, Sep 2015, Los Angeles, United States. ⟨hal-01207960⟩
179 Consultations
244 Téléchargements

Partager

Gmail Facebook X LinkedIn More