Minimal visibility graphs (Q2639649): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tight lower bound on the size of visibility graphs / rank | |||
Normal rank | |||
Revision as of 14:12, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal visibility graphs |
scientific article |
Statements
Minimal visibility graphs (English)
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
