Lecture Notes in Computer Science Volume 5849, 2010, pp 413-414

4-Labelings and Grid Embeddings of Plane Quadrangulations

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Finding aesthetic drawings of planar graphs is a main issue in graph drawing. Of special interest are rectangle of influence drawings.The graphs considered here are quadrangulations, that is, planar graphs all whose faces have degree four.We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n - 2) × (n - 2) grid. Biedl, Bretscher and Meijer [2] proved that every planar graph on n vertices without separating triangle has a closed rectangle of influence drawing on the (n - 1) × (n - 1) grid.Our method, which is completely different from that of [2], is in analogy to Schnyder’s algorithm for embedding triangulations on an integer grid [9] and gives a simple algorithm.