Shortest path solves edge-to-edge visibility in a polygon (Q3771676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path solves edge-to-edge visibility in a polygon |
scientific article; zbMATH DE number 4031065 |
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
0.8754019737243652
0 references
0.8515288829803467
0 references
0.8420148491859436
0 references
0.8306401371955872
0 references
0.8271051645278931
0 references
