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. © 2013 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Alam, M. J., Brandenburg, F. J., & Kobourov, S. G. (2013). Straight-line grid drawings of 3-connected 1-planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 83–94). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
