StraightLine Grid Drawings of 3Connected 1Planar GraphsAlam, Muhammed Jawaherul and Brandenburg, Franz J. and Kobourov, Stephen G. (2013) StraightLine Grid Drawings of 3Connected 1Planar Graphs. In: 21st International Symposium, GD 2013, September 2325, 2013 , pp. 8394(Official URL: http://dx.doi.org/10.1007/9783319038414_8). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783319038414_8
AbstractA graph is 1planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1planar graphs do not admit straightline drawings. We show that every 3connected 1planar graph has a straightline 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 1planar embedding of the graph.
Actions (login required)
