International Journal of Computational Geometry & Applications · 1992 · 22 citations · 0 references
ComputingComputer ScienceComputational GeometryGraph VisualizationInformation VisualizationVisibility AnalysisVisibility GraphsComputational Geometry FoundationsDistance VisibilityVertex Visibility
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?