Articles
Simpler Projective Plane Embedding

https://doi.org/10.1016/S1571-0653(05)80175-1Get rights and content

Abstract

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.

References (18)

There are more references available in the full text version of this article.

Cited by (0)

View full text