Two-point \(L_1\) shortest path queries in the plane (Q4635565)
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 6863041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-point \(L_1\) shortest path queries in the plane |
scientific article; zbMATH DE number 6863041 |
Statements
Two-Point L1 Shortest Path Queries in the Plane (English)
0 references
23 April 2018
0 references
\(L_1\) metric
0 references
shortest paths
0 references
polygonal domains
0 references
polygons with holes
0 references
two-point queries
0 references
weighted rectilinear obstacles
0 references
0.9893593192100524
0 references
0.9432239532470704
0 references
0.9236931800842284
0 references
0.9231776595115662
0 references
