Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Cite this paper as:
- Alam M.J., Brandenburg F.J., Kobourov S.G. (2013) Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. In: Wismath S., Wolff A. (eds) Graph Drawing. GD 2013. Lecture Notes in Computer Science, vol 8242. Springer, Cham
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.
Unable to display preview. Download preview PDF.