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.
  • 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. 
    17 Citations

    Figures and Topics from this paper

    Segment endpoint visibility graphs are Hamiltonian
    • 29
    • PDF
    Every Set of Disjoint Line Segments Admits a Binary Tree
    • 16
    • PDF
    A General Notion of Visibility Graphs
    • 3
    • PDF
    On circumscribing polygons for line segments
    • 20
    • PDF
    Disproving a conjecture on planar visibility graphs
    • 4
    • PDF
    Unsolved problems in visibility graphs of points, segments, and polygons
    • 50
    • PDF
    A general notion of visiblity graphs
    • PDF
    Plane Geometric Graph Augmentation: A Generic Perspective
    • 36
    • PDF
    Alternating Paths along Orthogonal Segments
    • 3
    • PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    Computing simple circuits from a set of line segments
    • 25
    • PDF
    Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments
    • A. Mirzaian
    • Computer Science, Mathematics
    • Comput. Geom.
    • 1992
    • 26
    • PDF
    Intersection and decomposition algorithms for planar arrangements
    • 56
    • PDF
    On computing simple circuits on a set of line segments
    • 20
    • PDF
    Good splitters for counting points in triangles
    • 27
    • Highly Influential
    A class of segments whose visibility graphs are Hamiltonian
    • Technical Report 12, Smith College,
    • 1991