Before revision:  It is known that if G is 3-connected it admits an OPVR with vertex complexity at most twelve, while a vertex complexity at least two may be required in some cases.
After revision:  It is known that if G is 3-connected 1-plane graphs admit an OPVR with vertex complexity at most twelve, while a vertex complexity at least two may be required in some cases.