Polynomial-time recognition conjecture for ordered curve pseudo-visibility graphs

An ordered curve pseudo-visibility graph is the ordered graph arising from the pseudo-visibility representation by curves discussed in the paper. Recognition conjecture. Ordered curve pseudo-visibility graphs can be recognized in polynomial time. The problem is motivated by the difficulty of characterizing and recognizing point and polygon visibility graphs; the paper presents this as an open algorithmic question in the more combinatorial pseudo-visibility setting.