Art gallery theorems and algorithms
Art gallery theorems and algorithms
Discrete Mathematics
Projective planarity in linear time
Journal of Algorithms
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Graph Algorithms
On Polar Visibility Representations of Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Hi-index | 0.04 |
We give a new, inductive proof that every 2-connected planar graph is a bar-visibility graph. Changing from horizontal lines to arcs of concentric circles and from vertical to radial visibility, we obtain a similar result for polar visibility graphs, which naturally embed on the projective plane.