Geometric graphs which are 1-skeletons of unstacked triangulated polygons

We give sufficient (and necessary) conditions of local character ensuring that a geometric graph is the 1-skeleton of an unstacked triangulation of a simple polygon.