Visibility Graph

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility edge) between vertices v and w if these vertices are mutually visible.

Explore with Wolfram|Alpha


de Berg, M.; van Kreveld, M.; Overmans, M.; and Schwarzkopf, O. "Visibility Graphs: Finding the Shortest Route." Ch. 15 in Computational Geometry: Algorithms and Applications, 2nd rev. ed. Berlin: Springer-Verlag, pp. 307-317, 2000.

Referenced on Wolfram|Alpha

Visibility Graph

Cite this as:

Weisstein, Eric W. "Visibility Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications