  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.
