A necessary condition for a graph to be the visibility graph of a simple polygon (Q1605320)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A necessary condition for a graph to be the visibility graph of a simple polygon |
scientific article; zbMATH DE number 1768189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary condition for a graph to be the visibility graph of a simple polygon |
scientific article; zbMATH DE number 1768189 |
Statements
A necessary condition for a graph to be the visibility graph of a simple polygon (English)
0 references
15 July 2002
0 references
computational geometry
0 references
visibility problem
0 references
visibility graph
0 references
polygon
0 references
0.8620852828025818
0 references
0.8289634585380554
0 references
0.816692590713501
0 references
0.8112580180168152
0 references
