• DOI:10.1016/0925-7721(94)90019-1
Corpus ID: 20681549

Two Segment Classes with Hamiltonian Visibility Graphs

@article{ORourke1994TwoSC,
  title={Two Segment Classes with Hamiltonian Visibility Graphs},
  author={J. O’Rourke and J. Rippel},
  journal={Comput. Geom.},
  year={1994},
  volume={4},
  pages={209-218}
}

J. O’Rourke, J. Rippel

Published 1994

Computer Science, Mathematics

Comput. Geom.

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed

Abstract We prove that the endpoint visibility graph of a set of disjoint segments that satisfy one of two restrictions, always contains a simple Hamiltonian circuit. The first restriction defines the class of independent segments: the line containing each segment misses all the other segments. The second restriction specifies unit lattice segments: unit length segments whose endpoints have integer coordinates.