Point visibility graph recognition is NP-hard
  Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard. 
Bodhayan Roy
cs.CG cs.CC cs.DM