Answers are grounded in this paper and cite their sources.
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?
No takes yet. Share an insight, caveat, or question.
Coullard et al. (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: