Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865)
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: Computing Lā shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 7056535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing \(L_1\) shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 7056535 |
Statements
Computing \(L_1\) shortest paths among polygonal obstacles in the plane (English)
0 references
17 May 2019
0 references
shortest paths
0 references
polygonal domains
0 references
L1 metric
0 references
Voronoi diagrams
0 references
computational geometry
0 references
algorithms
0 references
data structures
0 references
0 references
0 references
0 references
0.9804177284240724
0 references
0.9396722316741944
0 references
0.9341442584991456
0 references
0.9296162128448486
0 references
0.9231776595115662
0 references
