8 citations
1 paper · 1 filter
David Eppstein, Kevin A. Wortman
Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maxim…