A tight lower bound on the size of visibility graphs
Information Processing Letters
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Discrete Mathematics
On recognizing and characterizing visibility graphs of simple polygons
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Coordinate representation of order types requires exponential storage
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computing simple circuits from a set of line segments is NP-complete
SIAM Journal on Computing
Recognizing visibility graphs of spiral polygons
Journal of Algorithms
Computing simple circuits from a set of line segments
Discrete & Computational Geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Hierarchical decomposition of polygons with applications
Hierarchical decomposition of polygons with applications
The complexity of computing simple circuits in the plane
The complexity of computing simple circuits in the plane
Visibility graph recognition
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Vertex-edge pseudo-visibility graphs: characterization and recognition
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
ACM SIGACT News
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
On the minimum size of visibility graphs
Information Processing Letters
| Hi-index | 0.00 |
Results on visibility graphs are classified and organized into five tables.