Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608)
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 5369395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding rectilinear least cost paths in the presence of convex polygonal congested regions |
scientific article; zbMATH DE number 5369395 |
Statements
Finding rectilinear least cost paths in the presence of convex polygonal congested regions (English)
0 references
20 November 2008
0 references
least cost path
0 references
congested regions
0 references
rectilinear distance metric
0 references
0 references
0 references
0.7801511287689209
0 references
0.7758321762084961
0 references
0.7739666700363159
0 references
0.7698886394500732
0 references
