A note on rectilinear and polar visibility graphs

Authors:
Joan P. Hutchinson
Affiliations:
Department of Mathematics and Computer Science, Macalester College, St. Paul, MN
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
A note on visibility graphs

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

Graph Algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

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.