Minimal visibility graphs (Q2639649)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minimal visibility graphs
scientific article

    Statements

    Minimal visibility graphs (English)
    0 references
    0 references
    1991
    0 references
    Given n nonintersecting line segments in the plane, no three endpoints of which are colinear, the visibility graph generated by these n segments consists of the n segments and all segents formed by joining those endpoints of the n segments that can see each other. The authors give an alternative proof for the following result: The visibility graph of a set of n nonintersecting line segments in the plane contains at least 5n-4 edges.
    0 references
    visibility graph
    0 references

    Identifiers