Art gallery theorems and algorithms
Art gallery theorems and algorithms
Representations of graphs on a cylinder
SIAM Journal on Discrete Mathematics
Projective planarity in linear time
Journal of Algorithms
Rectangle-visibility representations of bipartite graphs
Discrete Applied Mathematics
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
On representations of some thickness-two graphs
Computational Geometry: Theory and Applications
On Rectangle Visibility Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Note: A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We introduce polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the well-studied bar-visibility graphs and are characterized here, when arcs are proper subsets of circles, as the graphs that embed on the plane with all but at most one cut-vertex on a common face or on the projective plane with all cut-vertices on a common face. We also characterize the graphs representable using full circles and arcs.