Two segment classes with Hamiltonian visibility graphs (Q1334612)

It has been conjectured that the visibility graph of a set of non- collinear disjoint line segments always contains a simple Hamiltonian circuit. The general problem and the problem for so-called shellable segments remain open, but the authors show that the conjecture holds for the class of independent segments (the line containing each segment misses all the other segments) and for the class of unit lattice segments (unit length segments whose endpoints have integer coordinates).