Shortest path between two simple polygons (Q1107993)
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: Shortest path between two simple polygons |
scientific article; zbMATH DE number 4066319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path between two simple polygons |
scientific article; zbMATH DE number 4066319 |
Statements
Shortest path between two simple polygons (English)
0 references
1987
0 references
computational geometry
0 references
computational complexity
0 references
shortest path
0 references
visibility polygon
0 references
wire routing
0 references
0.8677424788475037
0 references
0.8642644286155701
0 references
0.8524108529090881
0 references
0.8498981595039368
0 references
0.8461083173751831
0 references
