Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments

@article{Mirzaian1992HamiltonianTA,
  title={Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments},
  author={Andranik Mirzaian},
  journal={Comput. Geom.},
  year={1992},
  volume={2},
  pages={15-30}
}
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line se gments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian c ycle whose embedded v ersion is a simple polygon (i.e., its boundary edges are non-crossing visibility se gments). We call such a simple polygon a spanning polygonof Σ. Existence of a spanning polygon of Σ is equi valent to the existence of a hamiltonian triangulation of Σ. A… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS