This is the problem I am dealing with:
Given a set P of n points in general position, let a graph G be defined as follows:
The vertex set is P. Two vertices, a and b, are joined by an edge provided there exists an axis parallel square S with a and b on the boundary and no other point of P in the interior of S.
I need to prove or disprove that G is a near-triangulation where every face except the outerface is a triangle and the outerface is a cycle.
Thanks in advance