A tight lower bound on the size of visibility graphs
Information Processing Letters
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing simple circuits from a set of line segments is NP-complete
SIAM Journal on Computing
Computing simple circuits from a set of line segments
Discrete & Computational Geometry
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Computational Geometry: Theory and Applications
On a counterexample to a conjecture of Mirzaian
Computational Geometry: Theory and Applications
Two segment classes with Hamiltonian visibility graphs
Computational Geometry: Theory and Applications
Maintenance of the set of segments visible from a moving viewpoint in two dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Minimal tangent visibility graphs
Computational Geometry: Theory and Applications
Handbook of discrete and computational geometry
Planar segment visibility graphs
Computational Geometry: Theory and Applications
Alternating paths through disjoint line segments
Information Processing Letters
Pointed and colored binary encompassing trees
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Encompassing colored planar straight line graphs
Computational Geometry: Theory and Applications
Compatible geometric matchings
Computational Geometry: Theory and Applications
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Pointed binary encompassing trees: Simple and optimal
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian.