\(L_1\) shortest path queries among polygonal obstacles in the plane (Q2957892)
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: Lā shortest path queries among polygonal obstacles in the plane |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L_1\) shortest path queries among polygonal obstacles in the plane |
scientific article |
Statements
30 January 2017
0 references
computational geometry
0 references
shortest path queries
0 references
shortest paths among obstacles
0 references
\(L_1\)/\(L_\infty\)/rectilinear metric
0 references
shortest path maps
0 references
geodesic Voronoi diagrams
0 references
0.9804177284240724
0 references
0.9432239532470704
0 references
0.9330503344535828
0 references
0.9324307441711426
0 references
0.9317643046379088
0 references
