Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290)
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: Minimum-link shortest paths for polygons amidst rectilinear obstacles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum-link shortest paths for polygons amidst rectilinear obstacles |
scientific article |
Statements
Minimum-link shortest paths for polygons amidst rectilinear obstacles (English)
0 references
8 April 2022
0 references
minimum links
0 references
shortest paths
0 references
polygons
0 references
rectilinear obstacles
0 references
0 references
0.8707898855209351
0 references
0.8488227725028992
0 references
0.848211407661438
0 references
