Simpler Projective Plane Embedding

A projective plane is equivalent to a disk with antipodal points identified. A graph is projective planar if it can be drawn on the projective plane with no crossing edges. A linear time algorithm for projective planar embedding has been described by Mohar [9]. We provide a new approach that takes O(n2) time but is much easier to implement.