Visibility Graph Recognition

Given a visibility graph $G$ and a Hamiltonian circuit $C$, determine in polynomial time whether there is a simple polygon whose vertex visibility graph is $G$, and whose boundary corresponds to $C$.