Distance visibility graphs
C Coullard, A Lubiw - Proceedings of the seventh annual symposium on …, 1991 - dl.acm.org
Proceedings of the seventh annual symposium on Computational geometry, 1991•dl.acm.org
A new necessary condition for a graph G to be the visibility graph of a simple polygon is
given: each 3-connected component of G must. have a vertex ordering in which every vertex
is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance
visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple
polygon with the given weights as Euclidean distances?
given: each 3-connected component of G must. have a vertex ordering in which every vertex
is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance
visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple
polygon with the given weights as Euclidean distances?
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must. have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?
ACM Digital Library