This paper provides a linear time algorithm in the number of edges that, given a simple 3-connected non-planar graph G with a Klein bottle rotation system, outputs a straight line drawing of G with no crossings on the flat Klein bottle.

翻译：本文提出了一种边数线性时间的算法，对于给定具有克莱因瓶旋转系统的简单3-连通非平面图G，该算法在平坦克莱因瓶上输出G的无交叉直线绘制。