On the visibility graph of convex translates Original Research Article

We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R2 always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight.