Shortest path solves edge-to-edge visibility in a polygon (Q3771676): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8655(86)90015-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058872551 / rank | |||
Normal rank | |||
Latest revision as of 03:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path solves edge-to-edge visibility in a polygon |
scientific article |
Statements
Shortest path solves edge-to-edge visibility in a polygon (English)
0 references
1986
0 references
shortest path
0 references
image processing
0 references
computational geometry
0 references
edge-to-edge visibility
0 references
