A vertex-face assignment for plane graphs

doi:10.1016/j.comgeo.2008.06.005

Computational Geometry

Volume 42, Issue 5, July 2009, Pages 388-394

https://doi.org/10.1016/j.comgeo.2008.06.005 Get rights and content

Under an Elsevier user license

open archive

Abstract

For every planar straight line graph (Pslg), there is a vertex-face assignment such that every vertex is assigned to at most two incident faces, and every face is assigned to all its reflex corners and one more incident vertex. Such an assignment allows us to augment every disconnected Pslg into a connected Pslg such that the degree of every vertex increases by at most two.

Keywords

Plane straight line graph

Pseudo-triangulation

Encompassing graph

Cited by (0)

¹: Partially supported by NSF grant CCF-0431027.

²: Research by this author was done at the Massachusetts Institute of Technology.