Lecture Notes in Computer Science Volume 8242, 2013, pp 83-94

Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straight-line drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any given 1-planar embedding of the graph.