This paper presents some new results on permissible degree sets in polygon visibility graphs (PVGs). If the PVG has n vertices, we say it is an n-PVG. We also show some canonical construction techniques for PVGs with given degree sets.
