A necessary condition for a graph to be the visibility graph of a simple polygon (Q1605320): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00208-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066546022 / rank | |||
Normal rank | |||
Latest revision as of 11:14, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary condition for a graph to be the visibility graph of a simple polygon |
scientific article |
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
